./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 21:41:51,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 21:41:51,546 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 21:41:51,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 21:41:51,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 21:41:51,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 21:41:51,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 21:41:51,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 21:41:51,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 21:41:51,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 21:41:51,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 21:41:51,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 21:41:51,591 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 21:41:51,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 21:41:51,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 21:41:51,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 21:41:51,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 21:41:51,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 21:41:51,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 21:41:51,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 21:41:51,592 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 21:41:51,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 21:41:51,592 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 21:41:51,592 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 21:41:51,592 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 21:41:51,592 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 21:41:51,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 21:41:51,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:41:51,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 21:41:51,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 21:41:51,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 21:41:51,593 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 21:41:51,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 21:41:51,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b59248e26671131ba5a1485c53f1a9d7532ad734408c4cd915dfefae46656687 [2024-11-13 21:41:51,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 21:41:51,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 21:41:51,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 21:41:51,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 21:41:51,919 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 21:41:51,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c Unable to find full path for "g++" [2024-11-13 21:41:53,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 21:41:54,549 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 21:41:54,551 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c [2024-11-13 21:41:54,605 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/data/74b7bbded/2996614580c9417ab68329680aecb090/FLAG2c469fa2a [2024-11-13 21:41:54,629 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/data/74b7bbded/2996614580c9417ab68329680aecb090 [2024-11-13 21:41:54,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 21:41:54,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 21:41:54,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 21:41:54,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 21:41:54,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 21:41:54,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:41:54" (1/1) ... [2024-11-13 21:41:54,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505cd523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:54, skipping insertion in model container [2024-11-13 21:41:54,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 09:41:54" (1/1) ... [2024-11-13 21:41:54,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 21:41:56,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2024-11-13 21:41:56,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2024-11-13 21:41:56,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:41:56,984 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 21:41:58,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[381679,381692] [2024-11-13 21:41:58,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/sv-benchmarks/c/combinations/Problem05_label43+token_ring.01.cil-2.c[383339,383352] [2024-11-13 21:41:58,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 21:41:58,195 INFO L204 MainTranslator]: Completed translation [2024-11-13 21:41:58,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:58 WrapperNode [2024-11-13 21:41:58,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 21:41:58,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 21:41:58,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 21:41:58,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 21:41:58,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:58" (1/1) ... [2024-11-13 21:41:58,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:58" (1/1) ... [2024-11-13 21:41:58,898 INFO L138 Inliner]: procedures = 46, calls = 45, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 12574 [2024-11-13 21:41:58,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 21:41:58,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 21:41:58,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 21:41:58,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 21:41:58,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:58" (1/1) ... [2024-11-13 21:41:58,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:58" (1/1) ... [2024-11-13 21:41:59,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:58" (1/1) ... [2024-11-13 21:41:59,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:58" (1/1) ... [2024-11-13 21:41:59,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:58" (1/1) ... [2024-11-13 21:41:59,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:58" (1/1) ... [2024-11-13 21:41:59,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:58" (1/1) ... [2024-11-13 21:41:59,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:58" (1/1) ... [2024-11-13 21:41:59,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 21:41:59,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 21:41:59,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 21:41:59,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 21:41:59,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 09:41:58" (1/1) ... [2024-11-13 21:41:59,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 21:41:59,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 21:41:59,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 21:41:59,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 21:41:59,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 21:41:59,507 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-13 21:41:59,507 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-13 21:41:59,507 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-13 21:41:59,507 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-13 21:41:59,508 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-13 21:41:59,508 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-13 21:41:59,508 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-13 21:41:59,508 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-13 21:41:59,508 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-13 21:41:59,508 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-13 21:41:59,508 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-13 21:41:59,508 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-13 21:41:59,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 21:41:59,508 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-13 21:41:59,509 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-13 21:41:59,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 21:41:59,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 21:41:59,657 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 21:41:59,660 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 21:42:10,823 INFO L? ?]: Removed 1693 outVars from TransFormulas that were not future-live. [2024-11-13 21:42:10,823 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 21:42:13,017 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 21:42:13,021 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-13 21:42:13,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:42:13 BoogieIcfgContainer [2024-11-13 21:42:13,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 21:42:13,023 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 21:42:13,023 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 21:42:13,035 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 21:42:13,035 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:42:13" (1/1) ... [2024-11-13 21:42:13,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 21:42:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3379 states to 1718 states and 3379 transitions. [2024-11-13 21:42:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 3379 transitions. [2024-11-13 21:42:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:42:13,131 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:13,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:42:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1722 states and 3385 transitions. [2024-11-13 21:42:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3385 transitions. [2024-11-13 21:42:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:42:13,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:13,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:42:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 1723 states and 3385 transitions. [2024-11-13 21:42:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 3385 transitions. [2024-11-13 21:42:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-13 21:42:13,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 21:42:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 1731 states and 3399 transitions. [2024-11-13 21:42:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3399 transitions. [2024-11-13 21:42:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 21:42:13,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:13,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:42:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:14,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 1744 states and 3426 transitions. [2024-11-13 21:42:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 3426 transitions. [2024-11-13 21:42:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-13 21:42:14,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:14,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:14,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 21:42:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:15,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 1747 states and 3431 transitions. [2024-11-13 21:42:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 3431 transitions. [2024-11-13 21:42:15,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 21:42:15,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:15,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 21:42:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 1745 states and 3426 transitions. [2024-11-13 21:42:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 3426 transitions. [2024-11-13 21:42:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-13 21:42:15,670 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:15,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-13 21:42:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 1742 states and 3418 transitions. [2024-11-13 21:42:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 3418 transitions. [2024-11-13 21:42:15,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 21:42:15,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:42:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 1755 states and 3445 transitions. [2024-11-13 21:42:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 3445 transitions. [2024-11-13 21:42:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-13 21:42:17,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:17,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:42:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 1757 states and 3451 transitions. [2024-11-13 21:42:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 3451 transitions. [2024-11-13 21:42:18,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-13 21:42:18,039 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:18,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:42:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 1754 states and 3442 transitions. [2024-11-13 21:42:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 3442 transitions. [2024-11-13 21:42:18,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 21:42:18,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:18,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:42:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 1758 states and 3448 transitions. [2024-11-13 21:42:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3448 transitions. [2024-11-13 21:42:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 21:42:18,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:18,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:42:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 1758 states and 3447 transitions. [2024-11-13 21:42:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 3447 transitions. [2024-11-13 21:42:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 21:42:18,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:18,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-13 21:42:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3492 states to 1760 states and 3451 transitions. [2024-11-13 21:42:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 3451 transitions. [2024-11-13 21:42:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 21:42:18,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:18,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 21:42:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:19,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 1771 states and 3469 transitions. [2024-11-13 21:42:19,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 3469 transitions. [2024-11-13 21:42:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 21:42:19,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:19,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:42:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 1775 states and 3476 transitions. [2024-11-13 21:42:19,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3476 transitions. [2024-11-13 21:42:19,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 21:42:19,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:19,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 21:42:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 1776 states and 3477 transitions. [2024-11-13 21:42:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 3477 transitions. [2024-11-13 21:42:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-13 21:42:19,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:19,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:42:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 1778 states and 3480 transitions. [2024-11-13 21:42:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 3480 transitions. [2024-11-13 21:42:19,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-13 21:42:19,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:19,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 21:42:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 1780 states and 3482 transitions. [2024-11-13 21:42:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 3482 transitions. [2024-11-13 21:42:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 21:42:20,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:20,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:20,112 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:42:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 1784 states and 3490 transitions. [2024-11-13 21:42:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 3490 transitions. [2024-11-13 21:42:20,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 21:42:20,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:20,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 21:42:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 1791 states and 3506 transitions. [2024-11-13 21:42:20,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 3506 transitions. [2024-11-13 21:42:20,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 21:42:20,826 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:20,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:42:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 1798 states and 3527 transitions. [2024-11-13 21:42:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3527 transitions. [2024-11-13 21:42:22,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-13 21:42:22,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:22,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:42:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 1800 states and 3532 transitions. [2024-11-13 21:42:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 3532 transitions. [2024-11-13 21:42:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 21:42:22,757 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:22,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:42:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 1798 states and 3526 transitions. [2024-11-13 21:42:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 3526 transitions. [2024-11-13 21:42:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 21:42:22,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:22,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 21:42:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 1794 states and 3515 transitions. [2024-11-13 21:42:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3515 transitions. [2024-11-13 21:42:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-13 21:42:22,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:22,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 21:42:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1803 states and 3531 transitions. [2024-11-13 21:42:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 3531 transitions. [2024-11-13 21:42:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-13 21:42:23,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:23,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 21:42:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 1804 states and 3531 transitions. [2024-11-13 21:42:23,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 3531 transitions. [2024-11-13 21:42:23,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-13 21:42:23,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 21:42:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:24,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 1806 states and 3535 transitions. [2024-11-13 21:42:24,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 3535 transitions. [2024-11-13 21:42:24,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 21:42:24,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:24,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 21:42:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 1811 states and 3546 transitions. [2024-11-13 21:42:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 3546 transitions. [2024-11-13 21:42:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-13 21:42:25,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:25,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 21:42:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:25,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 1815 states and 3552 transitions. [2024-11-13 21:42:25,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 3552 transitions. [2024-11-13 21:42:25,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 21:42:25,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:42:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:26,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2024-11-13 21:42:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2024-11-13 21:42:26,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 21:42:26,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:26,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:42:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2024-11-13 21:42:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2024-11-13 21:42:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 21:42:26,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:26,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 21:42:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 1827 states and 3576 transitions. [2024-11-13 21:42:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 3576 transitions. [2024-11-13 21:42:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 21:42:26,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:26,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 21:42:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 1829 states and 3578 transitions. [2024-11-13 21:42:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 3578 transitions. [2024-11-13 21:42:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 21:42:27,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:27,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-13 21:42:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 1834 states and 3587 transitions. [2024-11-13 21:42:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 3587 transitions. [2024-11-13 21:42:27,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-13 21:42:27,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:27,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 21:42:28,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 1834 states and 3586 transitions. [2024-11-13 21:42:28,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 3586 transitions. [2024-11-13 21:42:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 21:42:28,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:28,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 21:42:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 1841 states and 3600 transitions. [2024-11-13 21:42:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 3600 transitions. [2024-11-13 21:42:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 21:42:29,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 21:42:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 1845 states and 3606 transitions. [2024-11-13 21:42:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 3606 transitions. [2024-11-13 21:42:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-13 21:42:30,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:30,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-13 21:42:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:31,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 1847 states and 3608 transitions. [2024-11-13 21:42:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 3608 transitions. [2024-11-13 21:42:31,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 21:42:31,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:31,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:42:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 1853 states and 3618 transitions. [2024-11-13 21:42:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 3618 transitions. [2024-11-13 21:42:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 21:42:31,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:31,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-13 21:42:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 1859 states and 3629 transitions. [2024-11-13 21:42:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 3629 transitions. [2024-11-13 21:42:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 21:42:31,604 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 21:42:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 1864 states and 3637 transitions. [2024-11-13 21:42:32,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 3637 transitions. [2024-11-13 21:42:32,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 21:42:32,005 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:32,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-13 21:42:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 1874 states and 3660 transitions. [2024-11-13 21:42:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 3660 transitions. [2024-11-13 21:42:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 21:42:33,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:33,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 21:42:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 1876 states and 3663 transitions. [2024-11-13 21:42:34,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 3663 transitions. [2024-11-13 21:42:34,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 21:42:34,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:34,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 21:42:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3791 states to 1896 states and 3722 transitions. [2024-11-13 21:42:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 3722 transitions. [2024-11-13 21:42:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 21:42:38,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:38,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 21:42:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 1900 states and 3728 transitions. [2024-11-13 21:42:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 3728 transitions. [2024-11-13 21:42:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 21:42:38,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 21:42:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 1910 states and 3749 transitions. [2024-11-13 21:42:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 3749 transitions. [2024-11-13 21:42:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 21:42:40,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 21:42:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 1916 states and 3765 transitions. [2024-11-13 21:42:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 3765 transitions. [2024-11-13 21:42:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-13 21:42:41,086 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:41,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 21:42:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 21:42:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 21:42:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3843 states to 1921 states and 3774 transitions. [2024-11-13 21:42:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 3774 transitions. [2024-11-13 21:42:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 21:42:41,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 21:42:41,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 21:42:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:42:41,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:42:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:42:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:42:41,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 21:42:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 21:42:41,863 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 49 iterations. [2024-11-13 21:42:41,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 09:42:41 ImpRootNode [2024-11-13 21:42:41,968 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 21:42:41,969 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 21:42:41,969 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 21:42:41,969 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 21:42:41,970 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 09:42:13" (3/4) ... [2024-11-13 21:42:41,971 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 21:42:42,098 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 21:42:42,101 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 21:42:42,102 INFO L158 Benchmark]: Toolchain (without parser) took 47467.66ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 57.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 397.3MB. Max. memory is 16.1GB. [2024-11-13 21:42:42,102 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:42:42,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3561.58ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 57.8MB in the beginning and 45.4MB in the end (delta: 12.5MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. [2024-11-13 21:42:42,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 701.20ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 45.4MB in the beginning and 88.1MB in the end (delta: -42.7MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2024-11-13 21:42:42,104 INFO L158 Benchmark]: Boogie Preprocessor took 533.85ms. Allocated memory was 226.5MB in the beginning and 578.8MB in the end (delta: 352.3MB). Free memory was 88.1MB in the beginning and 403.3MB in the end (delta: -315.2MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2024-11-13 21:42:42,104 INFO L158 Benchmark]: RCFGBuilder took 13586.94ms. Allocated memory was 578.8MB in the beginning and 1.3GB in the end (delta: 721.4MB). Free memory was 403.3MB in the beginning and 834.9MB in the end (delta: -431.6MB). Peak memory consumption was 793.8MB. Max. memory is 16.1GB. [2024-11-13 21:42:42,106 INFO L158 Benchmark]: CodeCheck took 28945.71ms. Allocated memory was 1.3GB in the beginning and 1.6GB in the end (delta: 327.2MB). Free memory was 834.9MB in the beginning and 1.2GB in the end (delta: -349.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 21:42:42,106 INFO L158 Benchmark]: Witness Printer took 132.20ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 21:42:42,108 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 8 procedures, 1718 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 28.8s, OverallIterations: 49, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18782 SdHoareTripleChecker+Valid, 37.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11169 mSDsluCounter, 26945 SdHoareTripleChecker+Invalid, 32.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17375 mSDsCounter, 6488 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22881 IncrementalHoareTripleChecker+Invalid, 29369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6488 mSolverCounterUnsat, 9570 mSDtfsCounter, 22881 mSolverCounterSat, 1.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29736 GetRequests, 29192 SyntacticMatches, 178 SemanticMatches, 366 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64448 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 3164 NumberOfCodeBlocks, 3164 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3019 ConstructedInterpolants, 0 QuantifiedInterpolants, 5185 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 39 PerfectInterpolantSequences, 1138/1183 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int m_st ; [L11180] int t1_st ; [L11181] int m_i ; [L11182] int t1_i ; [L11183] int M_E = 2; [L11184] int T1_E = 2; [L11185] int E_M = 2; [L11186] int E_1 = 2; [L11190] int token ; [L11192] int local ; [L11651] COND FALSE !(__VERIFIER_nondet_int()) [L11654] CALL main2() [L11638] int __retres1 ; [L11642] CALL init_model() [L11553] m_i = 1 [L11554] t1_i = 1 [L11642] RET init_model() [L11643] CALL start_simulation() [L11579] int kernel_st ; [L11580] int tmp ; [L11581] int tmp___0 ; [L11585] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11586] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11587] CALL init_threads() [L11335] COND TRUE m_i == 1 [L11336] m_st = 0 [L11340] COND TRUE t1_i == 1 [L11341] t1_st = 0 [L11587] RET init_threads() [L11588] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11424] COND FALSE !(M_E == 0) [L11429] COND FALSE !(T1_E == 0) [L11434] COND FALSE !(E_M == 0) [L11439] COND FALSE !(E_1 == 0) [L11588] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11589] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11299] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11308] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11589] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11590] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11452] COND FALSE !(M_E == 1) [L11457] COND FALSE !(T1_E == 1) [L11462] COND FALSE !(E_M == 1) [L11467] COND FALSE !(E_1 == 1) [L11590] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11593] COND TRUE 1 [L11596] kernel_st = 1 [L11597] CALL eval() [L11371] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L11208] COND TRUE 1 [L11211] token = __VERIFIER_nondet_int() [L11212] local = token [L11213] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=-1] [L11214] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11506] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11289] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11299] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND FALSE !(\read(tmp)) [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11308] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11309] COND TRUE E_1 == 1 [L11310] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=-1] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND TRUE \read(tmp___0) [L11493] t1_st = 0 [L11506] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=-1] [L11214] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=-1] [L11215] E_1 = 2 [L11216] m_pc = 1 [L11217] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=-1] [L11391] RET master() [L11399] COND TRUE t1_st == 0 [L11400] int tmp_ndt_2; [L11401] tmp_ndt_2 = __VERIFIER_nondet_int() [L11402] COND TRUE \read(tmp_ndt_2) [L11404] t1_st = 1 [L11405] CALL transmit1() [L11253] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=-1] [L11256] COND TRUE t1_pc == 1 [L11272] token += 1 [L11273] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11274] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11506] CALL activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11477] int tmp ; [L11478] int tmp___0 ; [L11482] CALL, EXPR is_master_triggered() [L11286] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11289] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11290] COND TRUE E_M == 1 [L11291] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11301] return (__retres1); [L11482] RET, EXPR is_master_triggered() [L11482] tmp = is_master_triggered() [L11484] COND TRUE \read(tmp) [L11485] m_st = 0 [L11490] CALL, EXPR is_transmit1_triggered() [L11305] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11308] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11309] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11318] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11320] return (__retres1); [L11490] RET, EXPR is_transmit1_triggered() [L11490] tmp___0 = is_transmit1_triggered() [L11492] COND FALSE !(\read(tmp___0)) [L11506] RET activate_threads() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11274] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11275] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L11264] COND TRUE 1 [L11266] t1_pc = 1 [L11267] t1_st = 2 [L11405] RET transmit1() [L11375] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11350] int __retres1 ; [L11353] COND TRUE m_st == 0 [L11354] __retres1 = 1 [L11366] return (__retres1); [L11378] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11378] tmp = exists_runnable_thread() [L11380] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11385] COND TRUE m_st == 0 [L11386] int tmp_ndt_1; [L11387] tmp_ndt_1 = __VERIFIER_nondet_int() [L11388] COND TRUE \read(tmp_ndt_1) [L11390] m_st = 1 [L11391] CALL master() [L11195] int tmp_var = __VERIFIER_nondet_int(); [L11197] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11200] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11222] COND FALSE !(token != local + 1) [L11227] COND TRUE tmp_var <= 5 [L11228] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11233] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11234] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=0] [L11235] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11236] CALL error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L11173] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=-1, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3561.58ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 57.8MB in the beginning and 45.4MB in the end (delta: 12.5MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 701.20ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 45.4MB in the beginning and 88.1MB in the end (delta: -42.7MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 533.85ms. Allocated memory was 226.5MB in the beginning and 578.8MB in the end (delta: 352.3MB). Free memory was 88.1MB in the beginning and 403.3MB in the end (delta: -315.2MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * RCFGBuilder took 13586.94ms. Allocated memory was 578.8MB in the beginning and 1.3GB in the end (delta: 721.4MB). Free memory was 403.3MB in the beginning and 834.9MB in the end (delta: -431.6MB). Peak memory consumption was 793.8MB. Max. memory is 16.1GB. * CodeCheck took 28945.71ms. Allocated memory was 1.3GB in the beginning and 1.6GB in the end (delta: 327.2MB). Free memory was 834.9MB in the beginning and 1.2GB in the end (delta: -349.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 132.20ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 21:42:42,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c1f6a9c-26b6-4174-8b5e-3445b5f3dd95/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE