./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.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_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/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_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/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_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/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 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 04:14:10,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 04:14:10,820 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 04:14:10,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 04:14:10,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 04:14:10,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 04:14:10,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 04:14:10,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 04:14:10,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 04:14:10,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 04:14:10,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 04:14:10,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 04:14:10,845 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 04:14:10,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 04:14:10,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 04:14:10,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 04:14:10,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 04:14:10,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 04:14:10,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 04:14:10,846 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 04:14:10,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 04:14:10,846 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 04:14:10,846 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 04:14:10,846 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 04:14:10,846 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 04:14:10,846 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 04:14:10,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 04:14:10,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:14:10,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 04:14:10,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 04:14:10,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 04:14:10,847 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 04:14:10,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 04:14:10,847 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_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/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 -> 205f0e0aff0d53187144e7eaaf7c9176a7ca6bc04dd0065235effeefd306421c [2024-12-06 04:14:11,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 04:14:11,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 04:14:11,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 04:14:11,061 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 04:14:11,062 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 04:14:11,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2024-12-06 04:14:13,857 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/bin/ukojak-verify-CZk0znPC7b/data/aa539b837/7fd7b82e44bc4a83a3fde44145c48bef/FLAG7afc53fae [2024-12-06 04:14:14,055 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 04:14:14,056 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2024-12-06 04:14:14,066 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/bin/ukojak-verify-CZk0znPC7b/data/aa539b837/7fd7b82e44bc4a83a3fde44145c48bef/FLAG7afc53fae [2024-12-06 04:14:14,078 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/bin/ukojak-verify-CZk0znPC7b/data/aa539b837/7fd7b82e44bc4a83a3fde44145c48bef [2024-12-06 04:14:14,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 04:14:14,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 04:14:14,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 04:14:14,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 04:14:14,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 04:14:14,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df731bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14, skipping insertion in model container [2024-12-06 04:14:14,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 04:14:14,292 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_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2024-12-06 04:14:14,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:14:14,306 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 04:14:14,359 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_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c[14511,14524] [2024-12-06 04:14:14,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 04:14:14,373 INFO L204 MainTranslator]: Completed translation [2024-12-06 04:14:14,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14 WrapperNode [2024-12-06 04:14:14,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 04:14:14,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 04:14:14,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 04:14:14,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 04:14:14,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,419 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-12-06 04:14:14,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 04:14:14,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 04:14:14,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 04:14:14,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 04:14:14,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,435 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,437 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 04:14:14,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 04:14:14,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 04:14:14,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 04:14:14,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:14:14" (1/1) ... [2024-12-06 04:14:14,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 04:14:14,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 04:14:14,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 04:14:14,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 04:14:14,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 04:14:14,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 04:14:14,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 04:14:14,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 04:14:14,595 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 04:14:14,596 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 04:14:15,139 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-12-06 04:14:15,139 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 04:14:15,676 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 04:14:15,676 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 04:14:15,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:14:15 BoogieIcfgContainer [2024-12-06 04:14:15,676 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 04:14:15,677 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 04:14:15,677 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 04:14:15,684 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 04:14:15,684 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:14:15" (1/1) ... [2024-12-06 04:14:15,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 04:14:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-12-06 04:14:15,727 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-12-06 04:14:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 04:14:15,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:17,899 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 04:14:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-12-06 04:14:18,015 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-12-06 04:14:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 04:14:18,016 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:18,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:19,135 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 04:14:19,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-12-06 04:14:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-12-06 04:14:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 04:14:19,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:19,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:20,357 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 04:14:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-12-06 04:14:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-12-06 04:14:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 04:14:20,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:20,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:21,485 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 04:14:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:22,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-12-06 04:14:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-12-06 04:14:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 04:14:22,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:22,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:22,948 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 04:14:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 37 states and 65 transitions. [2024-12-06 04:14:23,346 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 65 transitions. [2024-12-06 04:14:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 04:14:23,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:23,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:24,282 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 04:14:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 43 states and 77 transitions. [2024-12-06 04:14:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2024-12-06 04:14:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 04:14:25,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:25,256 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 04:14:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 44 states and 77 transitions. [2024-12-06 04:14:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 77 transitions. [2024-12-06 04:14:25,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:14:25,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:25,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:25,637 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 04:14:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2024-12-06 04:14:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2024-12-06 04:14:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 04:14:25,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:25,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:26,697 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 04:14:28,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 55 states and 95 transitions. [2024-12-06 04:14:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 95 transitions. [2024-12-06 04:14:28,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 04:14:28,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:28,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:28,852 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 04:14:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 58 states and 100 transitions. [2024-12-06 04:14:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2024-12-06 04:14:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 04:14:29,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:29,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:31,465 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 04:14:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 74 states and 127 transitions. [2024-12-06 04:14:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 127 transitions. [2024-12-06 04:14:34,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:14:34,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:34,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:35,586 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 04:14:37,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 88 states and 152 transitions. [2024-12-06 04:14:37,882 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2024-12-06 04:14:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 04:14:37,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:37,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:38,672 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 04:14:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 89 states and 154 transitions. [2024-12-06 04:14:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 154 transitions. [2024-12-06 04:14:39,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:14:39,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:39,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:40,157 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 04:14:43,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 103 states and 186 transitions. [2024-12-06 04:14:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 186 transitions. [2024-12-06 04:14:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 04:14:43,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:43,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:44,275 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 04:14:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 105 states and 191 transitions. [2024-12-06 04:14:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 191 transitions. [2024-12-06 04:14:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:14:44,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:44,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:46,147 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 04:14:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 119 states and 216 transitions. [2024-12-06 04:14:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 216 transitions. [2024-12-06 04:14:49,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:14:49,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:49,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:50,113 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 04:14:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 122 states and 226 transitions. [2024-12-06 04:14:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 226 transitions. [2024-12-06 04:14:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:14:51,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:51,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:52,623 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 04:14:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 126 states and 249 transitions. [2024-12-06 04:14:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 249 transitions. [2024-12-06 04:14:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 04:14:55,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:55,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:56,353 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 04:14:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:14:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 127 states and 252 transitions. [2024-12-06 04:14:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 252 transitions. [2024-12-06 04:14:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 04:14:56,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:14:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:14:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:14:59,100 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 04:15:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:15:03,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 146 states and 284 transitions. [2024-12-06 04:15:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 284 transitions. [2024-12-06 04:15:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 04:15:03,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:15:03,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:15:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:15:04,821 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 04:15:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:15:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 151 states and 298 transitions. [2024-12-06 04:15:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 298 transitions. [2024-12-06 04:15:06,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 04:15:06,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:15:06,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:15:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:15:08,999 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 04:15:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:15:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 160 states and 319 transitions. [2024-12-06 04:15:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 319 transitions. [2024-12-06 04:15:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 04:15:12,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:15:12,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:15:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:15:13,694 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 04:15:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:15:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 161 states and 320 transitions. [2024-12-06 04:15:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 320 transitions. [2024-12-06 04:15:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 04:15:14,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:15:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:15:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:15:16,603 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 04:15:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:15:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 175 states and 370 transitions. [2024-12-06 04:15:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 370 transitions. [2024-12-06 04:15:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 04:15:23,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:15:23,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:15:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:15:25,908 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 04:15:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:15:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 189 states and 417 transitions. [2024-12-06 04:15:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 417 transitions. [2024-12-06 04:15:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 04:15:33,040 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:15:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:15:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:15:34,780 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 04:15:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:15:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 200 states and 444 transitions. [2024-12-06 04:15:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2024-12-06 04:15:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 04:15:39,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:15:39,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:15:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:15:41,493 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 04:15:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:15:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 208 states and 458 transitions. [2024-12-06 04:15:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 458 transitions. [2024-12-06 04:15:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 04:15:45,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:15:45,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:15:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:15:46,230 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 04:15:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:15:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 210 states and 462 transitions. [2024-12-06 04:15:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 462 transitions. [2024-12-06 04:15:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 04:15:47,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:15:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:15:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:15:49,389 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 04:15:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:15:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 211 states and 467 transitions. [2024-12-06 04:15:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 467 transitions. [2024-12-06 04:15:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:15:50,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:15:50,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:15:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:15:52,542 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 04:15:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:15:58,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 217 states and 489 transitions. [2024-12-06 04:15:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 489 transitions. [2024-12-06 04:15:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:15:58,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:15:58,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:15:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:15:59,486 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 04:16:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:16:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 228 states and 509 transitions. [2024-12-06 04:16:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 509 transitions. [2024-12-06 04:16:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:16:04,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:16:04,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:16:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:16:06,230 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 04:16:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:16:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 231 states and 518 transitions. [2024-12-06 04:16:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 518 transitions. [2024-12-06 04:16:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:16:08,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:16:08,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:16:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:16:09,743 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 04:16:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:16:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 232 states and 530 transitions. [2024-12-06 04:16:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 530 transitions. [2024-12-06 04:16:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:16:11,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:16:11,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:16:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:16:12,161 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 04:16:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:16:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 233 states and 533 transitions. [2024-12-06 04:16:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 533 transitions. [2024-12-06 04:16:12,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 04:16:12,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:16:12,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:16:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:16:13,963 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 04:16:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:16:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 235 states and 541 transitions. [2024-12-06 04:16:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 541 transitions. [2024-12-06 04:16:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:16:15,611 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:16:15,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:16:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:16:18,967 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 04:16:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:16:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 246 states and 567 transitions. [2024-12-06 04:16:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 567 transitions. [2024-12-06 04:16:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:16:26,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:16:26,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:16:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:16:28,489 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 04:16:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:16:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 255 states and 583 transitions. [2024-12-06 04:16:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 583 transitions. [2024-12-06 04:16:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:16:34,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:16:34,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:16:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:16:35,246 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 04:16:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:16:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 266 states and 610 transitions. [2024-12-06 04:16:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 610 transitions. [2024-12-06 04:16:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:16:41,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:16:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:16:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:16:45,668 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 04:16:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:16:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 276 states and 632 transitions. [2024-12-06 04:16:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 632 transitions. [2024-12-06 04:16:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 04:16:54,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:16:54,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:16:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:16:59,454 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 04:17:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:17:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 279 states and 643 transitions. [2024-12-06 04:17:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 643 transitions. [2024-12-06 04:17:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:17:04,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:17:04,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:17:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:17:07,386 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 04:17:15,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:17:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 287 states and 660 transitions. [2024-12-06 04:17:15,750 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 660 transitions. [2024-12-06 04:17:15,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 04:17:15,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:17:15,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:17:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:17:18,432 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 04:17:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:17:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 288 states and 665 transitions. [2024-12-06 04:17:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 665 transitions. [2024-12-06 04:17:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:17:23,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:17:23,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:17:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:17:25,713 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 04:17:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:17:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 302 states and 709 transitions. [2024-12-06 04:17:36,049 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 709 transitions. [2024-12-06 04:17:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:17:36,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:17:36,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:17:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:17:37,680 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 04:17:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:17:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 307 states and 719 transitions. [2024-12-06 04:17:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 719 transitions. [2024-12-06 04:17:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:17:39,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:17:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:17:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:17:41,995 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 04:17:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:17:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 320 states and 759 transitions. [2024-12-06 04:17:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 759 transitions. [2024-12-06 04:17:52,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 04:17:52,299 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:17:52,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:17:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:17:54,032 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 04:17:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:17:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 321 states and 762 transitions. [2024-12-06 04:17:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 762 transitions. [2024-12-06 04:17:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:17:55,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:17:55,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:17:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:18:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 04:18:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:18:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 328 states and 769 transitions. [2024-12-06 04:18:06,415 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 769 transitions. [2024-12-06 04:18:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:18:06,415 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:18:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:18:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:18:09,730 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 04:18:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:18:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 334 states and 791 transitions. [2024-12-06 04:18:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 791 transitions. [2024-12-06 04:18:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:18:19,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:18:19,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:18:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:18:22,279 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 04:18:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:18:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 339 states and 801 transitions. [2024-12-06 04:18:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 801 transitions. [2024-12-06 04:18:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:18:26,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:18:26,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:18:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:18:29,244 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 04:18:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:18:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 340 states and 806 transitions. [2024-12-06 04:18:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 806 transitions. [2024-12-06 04:18:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 04:18:30,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:18:30,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:18:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:18:32,190 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 04:18:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:18:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 341 states and 811 transitions. [2024-12-06 04:18:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 811 transitions. [2024-12-06 04:18:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-06 04:18:33,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:18:33,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:18:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 04:18:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 04:18:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 04:18:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 341 states and 810 transitions. [2024-12-06 04:18:35,337 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 810 transitions. [2024-12-06 04:18:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 04:18:35,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 04:18:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 04:18:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:18:36,122 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 04:18:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:18:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:18:37,267 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 04:18:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 04:18:38,061 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 53 iterations. [2024-12-06 04:18:38,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 04:18:38 ImpRootNode [2024-12-06 04:18:38,149 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 04:18:38,150 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 04:18:38,150 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 04:18:38,150 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 04:18:38,151 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:14:15" (3/4) ... [2024-12-06 04:18:38,152 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 04:18:38,263 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 190. [2024-12-06 04:18:38,373 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 04:18:38,374 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 04:18:38,374 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 04:18:38,375 INFO L158 Benchmark]: Toolchain (without parser) took 264292.91ms. Allocated memory was 117.4MB in the beginning and 872.4MB in the end (delta: 755.0MB). Free memory was 92.5MB in the beginning and 222.2MB in the end (delta: -129.6MB). Peak memory consumption was 621.6MB. Max. memory is 16.1GB. [2024-12-06 04:18:38,375 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:18:38,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.75ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 75.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 04:18:38,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.21ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 71.7MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 04:18:38,376 INFO L158 Benchmark]: Boogie Preprocessor took 31.66ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 69.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 04:18:38,376 INFO L158 Benchmark]: RCFGBuilder took 1224.66ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 39.0MB in the end (delta: 30.2MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2024-12-06 04:18:38,376 INFO L158 Benchmark]: CodeCheck took 262472.34ms. Allocated memory was 117.4MB in the beginning and 872.4MB in the end (delta: 755.0MB). Free memory was 39.0MB in the beginning and 251.5MB in the end (delta: -212.6MB). Peak memory consumption was 543.7MB. Max. memory is 16.1GB. [2024-12-06 04:18:38,377 INFO L158 Benchmark]: Witness Printer took 223.85ms. Allocated memory is still 872.4MB. Free memory was 251.5MB in the beginning and 222.2MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 04:18:38,378 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: 262.4s, OverallIterations: 53, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22223 SdHoareTripleChecker+Valid, 130.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20413 mSDsluCounter, 7406 SdHoareTripleChecker+Invalid, 118.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6560 mSDsCounter, 8028 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63011 IncrementalHoareTripleChecker+Invalid, 71039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8028 mSolverCounterUnsat, 846 mSDtfsCounter, 63011 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15037 GetRequests, 13027 SyntacticMatches, 758 SemanticMatches, 1252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038022 ImplicationChecksByTransitivity, 188.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 85.6s InterpolantComputationTime, 1563 NumberOfCodeBlocks, 1563 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1463 ConstructedInterpolants, 0 QuantifiedInterpolants, 14278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 12 PerfectInterpolantSequences, 227/955 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: 609]: 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] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L563] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND TRUE \read(r121) [L269] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND TRUE \read(r121) [L285] COND TRUE \read(ep23) [L286] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND TRUE \read(r211) [L295] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND TRUE \read(r231) [L308] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND TRUE \read(r311) [L321] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND FALSE !(\read(r321)) [L336] COND TRUE \read(r311) [L337] COND TRUE \read(ep12) [L338] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=126, m2=127, m3=125, max1=0, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=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=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 1 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND TRUE \read(newmax2) [L171] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=126, m2=127, m3=125, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=126, m2=127, m3=125, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=126, m2=127, m3=125, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=126, m2=127, m3=125, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=126, m2=127, m3=125, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=126, m2=127, m3=125, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=126, m2=127, m3=125, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=126, m2=127, m3=125, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=126, m2=127, m3=125, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=126, m2=127, m3=125, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=126, m2=127, m3=125, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=126, m2=127, m3=125, max1=0, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=0, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=256, r3=0, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND TRUE (int )m1 > (int )max1 [L92] max1 = m1 [L93] newmax = (_Bool)1 [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND TRUE (int )m1 > (int )max1 [L100] max1 = m1 [L101] newmax = (_Bool)1 [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=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] [L596] RET assert(c1) [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND FALSE !((int )r1 < 1) [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND TRUE \read(ep21) [L170] COND FALSE !(\read(newmax2)) [L174] COND TRUE \read(ep23) [L175] COND FALSE !(\read(newmax2)) [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND FALSE !(\read(newmax3)) [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L484] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=127, m2=0, m3=126, max1=127, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=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] [L596] RET assert(c1) [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND TRUE \read(ep21) [L89] m1 = p21_old [L90] p21_old = nomsg [L91] COND FALSE !((int )m1 > (int )max1) [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] nl1 = (char)1 [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (char)1 [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=-1, m2=-1, m3=-1, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=-1, m2=-1, m3=-1, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=-1, m2=-1, m3=-1, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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] [L609] reach_error() VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=0, id2=126, id3=127, m1=-1, m2=-1, m3=-1, max1=127, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=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.30ms. Allocated memory is still 117.4MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.75ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 75.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.21ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 71.7MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.66ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 69.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1224.66ms. Allocated memory is still 117.4MB. Free memory was 69.2MB in the beginning and 39.0MB in the end (delta: 30.2MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. * CodeCheck took 262472.34ms. Allocated memory was 117.4MB in the beginning and 872.4MB in the end (delta: 755.0MB). Free memory was 39.0MB in the beginning and 251.5MB in the end (delta: -212.6MB). Peak memory consumption was 543.7MB. Max. memory is 16.1GB. * Witness Printer took 223.85ms. Allocated memory is still 872.4MB. Free memory was 251.5MB in the beginning and 222.2MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 04:18:38,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3bd152e-e0a4-47f7-92f4-bed03314aaf0/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