./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b --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 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 00:23:58,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 00:23:58,057 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 00:23:58,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 00:23:58,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 00:23:58,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 00:23:58,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 00:23:58,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 00:23:58,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 00:23:58,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 00:23:58,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 00:23:58,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 00:23:58,082 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 00:23:58,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 00:23:58,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 00:23:58,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 00:23:58,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 00:23:58,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 00:23:58,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 00:23:58,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 00:23:58,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 00:23:58,082 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 00:23:58,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 00:23:58,083 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 00:23:58,083 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 00:23:58,083 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 00:23:58,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 00:23:58,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:23:58,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 00:23:58,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 00:23:58,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 00:23:58,084 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 00:23:58,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 00:23:58,084 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_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b 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 -> 8ec94212d42d56ec4ec8ccfb1876cba582c3e983611a6a88d38f3b3edc8b85b6 [2024-12-06 00:23:58,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 00:23:58,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 00:23:58,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 00:23:58,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 00:23:58,299 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 00:23:58,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-12-06 00:24:00,912 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/data/8ea9ae485/b9f7fedb30f94c86999ec381a44c96aa/FLAGde3601110 [2024-12-06 00:24:01,125 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 00:24:01,125 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-12-06 00:24:01,134 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/data/8ea9ae485/b9f7fedb30f94c86999ec381a44c96aa/FLAGde3601110 [2024-12-06 00:24:01,145 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/data/8ea9ae485/b9f7fedb30f94c86999ec381a44c96aa [2024-12-06 00:24:01,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 00:24:01,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 00:24:01,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 00:24:01,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 00:24:01,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 00:24:01,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cbeeb0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01, skipping insertion in model container [2024-12-06 00:24:01,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 00:24:01,374 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_fb17ba10-810d-409f-b889-0d8709126a56/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2024-12-06 00:24:01,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:24:01,389 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 00:24:01,439 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_fb17ba10-810d-409f-b889-0d8709126a56/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.1.ufo.UNBOUNDED.pals.c[11552,11565] [2024-12-06 00:24:01,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:24:01,453 INFO L204 MainTranslator]: Completed translation [2024-12-06 00:24:01,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01 WrapperNode [2024-12-06 00:24:01,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 00:24:01,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 00:24:01,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 00:24:01,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 00:24:01,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,499 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 441 [2024-12-06 00:24:01,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 00:24:01,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 00:24:01,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 00:24:01,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 00:24:01,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 00:24:01,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 00:24:01,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 00:24:01,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 00:24:01,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:24:01" (1/1) ... [2024-12-06 00:24:01,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:24:01,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 00:24:01,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 00:24:01,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 00:24:01,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 00:24:01,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 00:24:01,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 00:24:01,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 00:24:01,693 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 00:24:01,696 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 00:24:02,157 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-12-06 00:24:02,157 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 00:24:02,651 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 00:24:02,651 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 00:24:02,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:24:02 BoogieIcfgContainer [2024-12-06 00:24:02,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 00:24:02,652 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 00:24:02,652 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 00:24:02,659 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 00:24:02,659 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:24:02" (1/1) ... [2024-12-06 00:24:02,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 00:24:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-12-06 00:24:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-12-06 00:24:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 00:24:02,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:02,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-12-06 00:24:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-12-06 00:24:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 00:24:04,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:04,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:05,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-12-06 00:24:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-12-06 00:24:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 00:24:05,332 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:05,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-12-06 00:24:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-12-06 00:24:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 00:24:06,484 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-12-06 00:24:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-12-06 00:24:07,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 00:24:07,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:07,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:08,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-12-06 00:24:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-12-06 00:24:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-12-06 00:24:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 00:24:09,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:09,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-12-06 00:24:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-12-06 00:24:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 00:24:10,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:10,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-12-06 00:24:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-12-06 00:24:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 00:24:11,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:11,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2024-12-06 00:24:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2024-12-06 00:24:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 00:24:11,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2024-12-06 00:24:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2024-12-06 00:24:13,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 00:24:13,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:13,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2024-12-06 00:24:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2024-12-06 00:24:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 00:24:13,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:13,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 76 states and 130 transitions. [2024-12-06 00:24:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 130 transitions. [2024-12-06 00:24:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 00:24:18,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 89 states and 155 transitions. [2024-12-06 00:24:20,647 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 155 transitions. [2024-12-06 00:24:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 00:24:20,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:20,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:21,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 103 states and 184 transitions. [2024-12-06 00:24:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 184 transitions. [2024-12-06 00:24:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 00:24:23,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:23,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 105 states and 195 transitions. [2024-12-06 00:24:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 195 transitions. [2024-12-06 00:24:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 00:24:25,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 114 states and 215 transitions. [2024-12-06 00:24:28,296 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 215 transitions. [2024-12-06 00:24:28,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 00:24:28,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:28,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 115 states and 220 transitions. [2024-12-06 00:24:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 220 transitions. [2024-12-06 00:24:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 00:24:29,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:29,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 116 states and 223 transitions. [2024-12-06 00:24:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 223 transitions. [2024-12-06 00:24:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 00:24:30,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:31,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 118 states and 229 transitions. [2024-12-06 00:24:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 229 transitions. [2024-12-06 00:24:31,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 00:24:31,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:31,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:35,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 124 states and 253 transitions. [2024-12-06 00:24:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 253 transitions. [2024-12-06 00:24:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 00:24:35,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:35,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 144 states and 285 transitions. [2024-12-06 00:24:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 285 transitions. [2024-12-06 00:24:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 00:24:40,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:40,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 149 states and 298 transitions. [2024-12-06 00:24:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 298 transitions. [2024-12-06 00:24:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 00:24:42,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:42,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:49,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 161 states and 323 transitions. [2024-12-06 00:24:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 323 transitions. [2024-12-06 00:24:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 00:24:49,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:49,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 00:24:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:49,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 161 states and 322 transitions. [2024-12-06 00:24:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 322 transitions. [2024-12-06 00:24:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 00:24:49,673 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:24:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:24:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:24:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 179 states and 379 transitions. [2024-12-06 00:24:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 379 transitions. [2024-12-06 00:24:59,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 00:24:59,694 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:24:59,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:24:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:01,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:25:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 194 states and 431 transitions. [2024-12-06 00:25:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 431 transitions. [2024-12-06 00:25:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 00:25:09,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:09,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 00:25:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 208 states and 463 transitions. [2024-12-06 00:25:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 463 transitions. [2024-12-06 00:25:17,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 00:25:17,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:17,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:25:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 218 states and 481 transitions. [2024-12-06 00:25:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 481 transitions. [2024-12-06 00:25:24,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 00:25:24,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:24,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:25:34,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 230 states and 507 transitions. [2024-12-06 00:25:34,399 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 507 transitions. [2024-12-06 00:25:34,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 00:25:34,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:34,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:25:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 239 states and 525 transitions. [2024-12-06 00:25:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 525 transitions. [2024-12-06 00:25:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 00:25:41,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:41,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:25:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 247 states and 540 transitions. [2024-12-06 00:25:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 540 transitions. [2024-12-06 00:25:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 00:25:46,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:46,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:25:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:25:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 260 states and 572 transitions. [2024-12-06 00:25:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 572 transitions. [2024-12-06 00:25:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 00:25:56,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:25:56,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:25:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:25:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:26:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:26:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 266 states and 585 transitions. [2024-12-06 00:26:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 585 transitions. [2024-12-06 00:26:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 00:26:00,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:26:00,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:26:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:26:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:26:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:26:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 267 states and 589 transitions. [2024-12-06 00:26:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 589 transitions. [2024-12-06 00:26:02,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 00:26:02,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:26:02,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:26:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:26:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:26:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:26:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 271 states and 597 transitions. [2024-12-06 00:26:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 597 transitions. [2024-12-06 00:26:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 00:26:05,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:26:05,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:26:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:26:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:26:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:26:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 272 states and 606 transitions. [2024-12-06 00:26:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 606 transitions. [2024-12-06 00:26:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 00:26:06,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:26:06,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:26:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:26:10,521 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:26:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:26:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 284 states and 634 transitions. [2024-12-06 00:26:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 634 transitions. [2024-12-06 00:26:20,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:26:20,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:26:20,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:26:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:26:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:26:25,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:26:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 288 states and 650 transitions. [2024-12-06 00:26:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 650 transitions. [2024-12-06 00:26:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:26:25,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:26:25,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:26:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:26:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:26:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:26:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 289 states and 654 transitions. [2024-12-06 00:26:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 654 transitions. [2024-12-06 00:26:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:26:27,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:26:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:26:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:26:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:26:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:26:39,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 296 states and 668 transitions. [2024-12-06 00:26:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 668 transitions. [2024-12-06 00:26:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:26:39,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:26:39,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:26:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:26:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:26:41,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:26:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 297 states and 672 transitions. [2024-12-06 00:26:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 672 transitions. [2024-12-06 00:26:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:26:41,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:26:41,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:26:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:26:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:26:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:26:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 298 states and 676 transitions. [2024-12-06 00:26:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 676 transitions. [2024-12-06 00:26:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:26:47,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:26:47,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:26:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:26:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:26:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:26:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 308 states and 699 transitions. [2024-12-06 00:26:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 699 transitions. [2024-12-06 00:26:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 00:26:59,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:26:59,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:26:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 309 states and 700 transitions. [2024-12-06 00:27:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 700 transitions. [2024-12-06 00:27:06,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 00:27:06,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 316 states and 721 transitions. [2024-12-06 00:27:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 721 transitions. [2024-12-06 00:27:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 00:27:17,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:17,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 319 states and 737 transitions. [2024-12-06 00:27:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 737 transitions. [2024-12-06 00:27:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 00:27:21,516 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:21,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 321 states and 743 transitions. [2024-12-06 00:27:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 743 transitions. [2024-12-06 00:27:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 00:27:24,979 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 324 states and 765 transitions. [2024-12-06 00:27:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 765 transitions. [2024-12-06 00:27:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 00:27:32,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:32,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 325 states and 765 transitions. [2024-12-06 00:27:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 765 transitions. [2024-12-06 00:27:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 00:27:34,531 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:34,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 326 states and 766 transitions. [2024-12-06 00:27:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 766 transitions. [2024-12-06 00:27:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 00:27:36,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:36,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 335 states and 786 transitions. [2024-12-06 00:27:45,124 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 786 transitions. [2024-12-06 00:27:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 00:27:45,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:45,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:52,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 340 states and 800 transitions. [2024-12-06 00:27:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 800 transitions. [2024-12-06 00:27:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 00:27:52,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:52,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:27:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:27:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:27:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 341 states and 801 transitions. [2024-12-06 00:27:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 801 transitions. [2024-12-06 00:27:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 00:27:57,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:27:57,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:27:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 00:27:58,206 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 00:27:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 00:27:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 00:27:58,947 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 00:27:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 00:27:59,243 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 53 iterations. [2024-12-06 00:27:59,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 12:27:59 ImpRootNode [2024-12-06 00:27:59,390 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 00:27:59,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 00:27:59,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 00:27:59,392 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 00:27:59,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:24:02" (3/4) ... [2024-12-06 00:27:59,395 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 00:27:59,549 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 174. [2024-12-06 00:27:59,649 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 00:27:59,650 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 00:27:59,650 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 00:27:59,651 INFO L158 Benchmark]: Toolchain (without parser) took 238503.34ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 117.8MB in the beginning and 549.8MB in the end (delta: -432.0MB). Peak memory consumption was 292.7MB. Max. memory is 16.1GB. [2024-12-06 00:27:59,651 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:27:59,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.31ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 101.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 00:27:59,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.29ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 97.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:27:59,652 INFO L158 Benchmark]: Boogie Preprocessor took 33.30ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 00:27:59,652 INFO L158 Benchmark]: RCFGBuilder took 1117.69ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 53.7MB in the end (delta: 41.9MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2024-12-06 00:27:59,652 INFO L158 Benchmark]: CodeCheck took 236738.69ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 53.7MB in the beginning and 574.9MB in the end (delta: -521.2MB). Peak memory consumption was 201.9MB. Max. memory is 16.1GB. [2024-12-06 00:27:59,653 INFO L158 Benchmark]: Witness Printer took 258.72ms. Allocated memory is still 872.4MB. Free memory was 574.9MB in the beginning and 549.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 00:27:59,654 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 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 236.6s, OverallIterations: 53, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23335 SdHoareTripleChecker+Valid, 120.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21576 mSDsluCounter, 7900 SdHoareTripleChecker+Invalid, 108.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7054 mSDsCounter, 8473 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65717 IncrementalHoareTripleChecker+Invalid, 74190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8473 mSolverCounterUnsat, 846 mSDtfsCounter, 65717 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16586 GetRequests, 14587 SyntacticMatches, 769 SemanticMatches, 1230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934294 ImplicationChecksByTransitivity, 183.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 70.8s InterpolantComputationTime, 1541 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1441 ConstructedInterpolants, 0 QuantifiedInterpolants, 13774 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 11 PerfectInterpolantSequences, 183/915 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, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 543]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L465] int c1 ; [L466] int i2 ; [L469] c1 = 0 [L470] ep12 = __VERIFIER_nondet_bool() [L471] ep13 = __VERIFIER_nondet_bool() [L472] ep21 = __VERIFIER_nondet_bool() [L473] ep23 = __VERIFIER_nondet_bool() [L474] ep31 = __VERIFIER_nondet_bool() [L475] ep32 = __VERIFIER_nondet_bool() [L476] id1 = __VERIFIER_nondet_char() [L477] r1 = __VERIFIER_nondet_uchar() [L478] st1 = __VERIFIER_nondet_char() [L479] nl1 = __VERIFIER_nondet_char() [L480] m1 = __VERIFIER_nondet_char() [L481] max1 = __VERIFIER_nondet_char() [L482] mode1 = __VERIFIER_nondet_bool() [L483] id2 = __VERIFIER_nondet_char() [L484] r2 = __VERIFIER_nondet_uchar() [L485] st2 = __VERIFIER_nondet_char() [L486] nl2 = __VERIFIER_nondet_char() [L487] m2 = __VERIFIER_nondet_char() [L488] max2 = __VERIFIER_nondet_char() [L489] mode2 = __VERIFIER_nondet_bool() [L490] id3 = __VERIFIER_nondet_char() [L491] r3 = __VERIFIER_nondet_uchar() [L492] st3 = __VERIFIER_nondet_char() [L493] nl3 = __VERIFIER_nondet_char() [L494] m3 = __VERIFIER_nondet_char() [L495] max3 = __VERIFIER_nondet_char() [L496] mode3 = __VERIFIER_nondet_bool() [L497] CALL, EXPR init() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND FALSE !(\read(r121)) [L244] COND FALSE !(\read(r131)) [L251] tmp = 0 [L253] r122 = (_Bool )tmp [L254] COND FALSE !(\read(r131)) [L257] COND FALSE !(\read(r121)) [L264] tmp___0 = 0 [L266] r132 = (_Bool )tmp___0 [L267] COND TRUE \read(r211) [L268] tmp___1 = 1 [L279] r212 = (_Bool )tmp___1 [L280] COND TRUE \read(r231) [L281] tmp___2 = 1 [L292] r232 = (_Bool )tmp___2 [L293] COND TRUE \read(r311) [L294] tmp___3 = 1 [L305] r312 = (_Bool )tmp___3 [L306] COND FALSE !(\read(r321)) [L309] COND TRUE \read(r311) [L310] COND FALSE !(\read(ep12)) [L313] tmp___4 = 0 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE (int )max1 == (int )id1 [L329] COND TRUE (int )max2 == (int )id2 [L330] COND TRUE (int )max3 == (int )id3 [L331] COND TRUE (int )st1 == 0 [L332] COND TRUE (int )st2 == 0 [L333] COND TRUE (int )st3 == 0 [L334] COND TRUE (int )nl1 == 0 [L335] COND TRUE (int )nl2 == 0 [L336] COND TRUE (int )nl3 == 0 [L337] COND TRUE (int )mode1 == 0 [L338] COND TRUE (int )mode2 == 0 [L339] COND TRUE (int )mode3 == 0 [L340] tmp___5 = 1 [L404] return (tmp___5); [L497] RET, EXPR init() [L497] i2 = init() [L498] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L498] RET assume_abort_if_not(i2) [L499] p12_old = nomsg [L500] p12_new = nomsg [L501] p13_old = nomsg [L502] p13_new = nomsg [L503] p21_old = nomsg [L504] p21_new = nomsg [L505] p23_old = nomsg [L506] p23_new = nomsg [L507] p31_old = nomsg [L508] p31_new = nomsg [L509] p32_old = nomsg [L510] p32_new = nomsg [L511] i2 = 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=2, max1=0, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L514] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L514] RET node1() [L515] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND TRUE \read(ep21) [L155] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L515] RET node2() [L516] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=2, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=2, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=2, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=2, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=2, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=2, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=2, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=2, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=2, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=2, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=2, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=2, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L530] RET assert(c1) [L514] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND TRUE (int )m1 > (int )max1 [L95] max1 = m1 [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L514] RET node1() [L515] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [L137] COND FALSE !(\read(ep32)) [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L515] RET node2() [L516] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L530] RET assert(c1) [L514] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L514] RET node1() [L515] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND TRUE \read(ep21) [L155] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L515] RET node2() [L516] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND FALSE !(\read(ep32)) [L207] mode3 = (_Bool)1 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L412] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L413] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L414] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L415] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L416] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L419] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L421] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L426] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L429] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L431] COND TRUE (int )r1 < 2 [L432] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L530] RET assert(c1) [L514] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND FALSE !((int )m1 > (int )max1) [L98] COND TRUE (int )r1 == 2 [L99] COND FALSE !((int )max1 == (int )id1) [L102] nl1 = (char)1 [L105] mode1 = (_Bool)0 [L514] RET node1() [L515] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND FALSE !(\read(ep12)) [L137] COND FALSE !(\read(ep32)) [L144] COND TRUE (int )r2 == 2 [L145] COND TRUE (int )max2 == (int )id2 [L146] st2 = (char)1 [L151] mode2 = (_Bool)0 [L515] RET node2() [L516] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L516] RET node3() [L517] p12_old = p12_new [L518] p12_new = nomsg [L519] p13_old = p13_new [L520] p13_new = nomsg [L521] p21_old = p21_new [L522] p21_new = nomsg [L523] p23_old = p23_new [L524] p23_new = nomsg [L525] p31_old = p31_new [L526] p31_new = nomsg [L527] p32_old = p32_new [L528] p32_new = nomsg [L529] CALL, EXPR check() [L409] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L412] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L458] tmp = 0 VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L460] return (tmp); [L529] RET, EXPR check() [L529] c1 = check() [L530] CALL assert(c1) [L541] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L543] reach_error() VAL [ep12=0, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=127, m3=1, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.31ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 101.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.29ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 97.9MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.30ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1117.69ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 53.7MB in the end (delta: 41.9MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * CodeCheck took 236738.69ms. Allocated memory was 142.6MB in the beginning and 872.4MB in the end (delta: 729.8MB). Free memory was 53.7MB in the beginning and 574.9MB in the end (delta: -521.2MB). Peak memory consumption was 201.9MB. Max. memory is 16.1GB. * Witness Printer took 258.72ms. Allocated memory is still 872.4MB. Free memory was 574.9MB in the beginning and 549.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 00:27:59,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb17ba10-810d-409f-b889-0d8709126a56/bin/ukojak-verify-CZk0znPC7b/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