./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk --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 9315395d0a8f14500c92b8c06710daa9c3f1878481e9b5bb1bf2cb8cc368eb3d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:17:54,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:17:54,706 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:17:54,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:17:54,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:17:54,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:17:54,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:17:54,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:17:54,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:17:54,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:17:54,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:17:54,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:17:54,760 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:17:54,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:17:54,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:17:54,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:17:54,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:17:54,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:17:54,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:17:54,762 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:17:54,763 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:17:54,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:17:54,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:17:54,767 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:17:54,768 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:17:54,768 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:17:54,768 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:17:54,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:17:54,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:17:54,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:17:54,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:17:54,770 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:17:54,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:17:54,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk 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 -> 9315395d0a8f14500c92b8c06710daa9c3f1878481e9b5bb1bf2cb8cc368eb3d [2024-11-08 23:17:55,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:17:55,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:17:55,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:17:55,109 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:17:55,111 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:17:55,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c Unable to find full path for "g++" [2024-11-08 23:17:57,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:17:57,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:17:57,395 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2024-11-08 23:17:57,410 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/data/f7ef7ba84/ee11f313c83647db814c9beb191a48bb/FLAG23ced37ca [2024-11-08 23:17:57,425 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/data/f7ef7ba84/ee11f313c83647db814c9beb191a48bb [2024-11-08 23:17:57,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:17:57,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:17:57,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:17:57,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:17:57,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:17:57,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:17:57" (1/1) ... [2024-11-08 23:17:57,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19dc1c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:17:57, skipping insertion in model container [2024-11-08 23:17:57,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:17:57" (1/1) ... [2024-11-08 23:17:57,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:17:57,776 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_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c[14373,14386] [2024-11-08 23:17:57,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:17:57,795 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:17:57,874 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_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c[14373,14386] [2024-11-08 23:17:57,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:17:57,899 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:17:57,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:17:57 WrapperNode [2024-11-08 23:17:57,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:17:57,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:17:57,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:17:57,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:17:57,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:17:57" (1/1) ... [2024-11-08 23:17:57,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:17:57" (1/1) ... [2024-11-08 23:17:57,982 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 495 [2024-11-08 23:17:57,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:17:57,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:17:57,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:17:57,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:17:57,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:17:57" (1/1) ... [2024-11-08 23:17:57,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:17:57" (1/1) ... [2024-11-08 23:17:58,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:17:57" (1/1) ... [2024-11-08 23:17:58,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:17:57" (1/1) ... [2024-11-08 23:17:58,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:17:57" (1/1) ... [2024-11-08 23:17:58,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:17:57" (1/1) ... [2024-11-08 23:17:58,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:17:57" (1/1) ... [2024-11-08 23:17:58,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:17:57" (1/1) ... [2024-11-08 23:17:58,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:17:58,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:17:58,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:17:58,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:17:58,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:17:57" (1/1) ... [2024-11-08 23:17:58,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:17:58,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:17:58,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:17:58,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:17:58,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:17:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:17:58,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:17:58,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:17:58,292 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:17:58,295 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:17:59,029 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-08 23:17:59,029 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:17:59,821 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:17:59,822 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 23:17:59,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:17:59 BoogieIcfgContainer [2024-11-08 23:17:59,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:17:59,824 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:17:59,824 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:17:59,835 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:17:59,836 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:17:59" (1/1) ... [2024-11-08 23:17:59,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:17:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:17:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2024-11-08 23:17:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2024-11-08 23:17:59,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 23:17:59,921 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:17:59,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 24 states and 39 transitions. [2024-11-08 23:18:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2024-11-08 23:18:03,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 23:18:03,077 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:03,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 28 states and 48 transitions. [2024-11-08 23:18:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2024-11-08 23:18:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 23:18:05,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:05,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 33 states and 59 transitions. [2024-11-08 23:18:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 59 transitions. [2024-11-08 23:18:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 23:18:07,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:07,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:09,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:09,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 39 states and 72 transitions. [2024-11-08 23:18:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 72 transitions. [2024-11-08 23:18:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 23:18:09,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:09,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 47 states and 88 transitions. [2024-11-08 23:18:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 88 transitions. [2024-11-08 23:18:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 23:18:12,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 54 states and 102 transitions. [2024-11-08 23:18:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 102 transitions. [2024-11-08 23:18:14,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 23:18:14,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:14,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:16,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 63 states and 119 transitions. [2024-11-08 23:18:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 119 transitions. [2024-11-08 23:18:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:18:17,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:17,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 64 states and 120 transitions. [2024-11-08 23:18:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 120 transitions. [2024-11-08 23:18:17,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 23:18:17,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:17,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 75 states and 140 transitions. [2024-11-08 23:18:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 140 transitions. [2024-11-08 23:18:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 23:18:21,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:21,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 80 states and 148 transitions. [2024-11-08 23:18:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 148 transitions. [2024-11-08 23:18:23,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 23:18:23,284 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:23,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 98 states and 187 transitions. [2024-11-08 23:18:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 187 transitions. [2024-11-08 23:18:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:18:31,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:31,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 113 states and 212 transitions. [2024-11-08 23:18:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 212 transitions. [2024-11-08 23:18:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 23:18:37,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:37,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:39,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 126 states and 241 transitions. [2024-11-08 23:18:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 241 transitions. [2024-11-08 23:18:43,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 23:18:43,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:43,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 141 states and 270 transitions. [2024-11-08 23:18:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 270 transitions. [2024-11-08 23:18:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 23:18:49,126 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:49,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 142 states and 273 transitions. [2024-11-08 23:18:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 273 transitions. [2024-11-08 23:18:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 23:18:50,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:50,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 145 states and 281 transitions. [2024-11-08 23:18:53,717 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 281 transitions. [2024-11-08 23:18:53,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:18:53,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:53,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:18:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:18:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:18:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 160 states and 314 transitions. [2024-11-08 23:18:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 314 transitions. [2024-11-08 23:18:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:18:59,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:18:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:18:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:19:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 168 states and 347 transitions. [2024-11-08 23:19:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 347 transitions. [2024-11-08 23:19:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:19:05,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:19:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 170 states and 354 transitions. [2024-11-08 23:19:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 354 transitions. [2024-11-08 23:19:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:19:07,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:07,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:19:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 172 states and 361 transitions. [2024-11-08 23:19:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 361 transitions. [2024-11-08 23:19:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 23:19:11,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:11,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:19:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 173 states and 362 transitions. [2024-11-08 23:19:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 362 transitions. [2024-11-08 23:19:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:19:12,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:12,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:19:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 179 states and 382 transitions. [2024-11-08 23:19:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 382 transitions. [2024-11-08 23:19:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:19:19,018 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:19:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 183 states and 395 transitions. [2024-11-08 23:19:24,192 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 395 transitions. [2024-11-08 23:19:24,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 23:19:24,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:24,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:19:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 185 states and 400 transitions. [2024-11-08 23:19:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 400 transitions. [2024-11-08 23:19:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 23:19:27,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:27,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:19:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 194 states and 421 transitions. [2024-11-08 23:19:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 421 transitions. [2024-11-08 23:19:33,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 23:19:33,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:19:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 203 states and 439 transitions. [2024-11-08 23:19:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 439 transitions. [2024-11-08 23:19:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 23:19:37,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:37,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 23:19:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 204 states and 441 transitions. [2024-11-08 23:19:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 441 transitions. [2024-11-08 23:19:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 23:19:38,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:38,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:19:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 215 states and 462 transitions. [2024-11-08 23:19:46,380 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 462 transitions. [2024-11-08 23:19:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 23:19:46,381 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:46,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 23:19:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:19:46,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 216 states and 467 transitions. [2024-11-08 23:19:46,960 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 467 transitions. [2024-11-08 23:19:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 23:19:46,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:19:46,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:19:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:19:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:20:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:20:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 232 states and 519 transitions. [2024-11-08 23:20:01,428 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 519 transitions. [2024-11-08 23:20:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 23:20:01,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:20:01,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:20:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:20:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:20:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 242 states and 545 transitions. [2024-11-08 23:20:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 545 transitions. [2024-11-08 23:20:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 23:20:11,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:20:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:20:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:20:18,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:20:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 249 states and 565 transitions. [2024-11-08 23:20:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 565 transitions. [2024-11-08 23:20:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:20:18,985 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:20:18,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:20:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:20:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:20:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 266 states and 605 transitions. [2024-11-08 23:20:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 605 transitions. [2024-11-08 23:20:30,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 23:20:30,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:20:30,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:20:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:20:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:20:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 269 states and 613 transitions. [2024-11-08 23:20:33,552 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 613 transitions. [2024-11-08 23:20:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:20:33,552 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:20:33,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:20:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:20:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:20:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 279 states and 638 transitions. [2024-11-08 23:20:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 638 transitions. [2024-11-08 23:20:44,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:20:44,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:20:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:20:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:46,941 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:20:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:20:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 283 states and 651 transitions. [2024-11-08 23:20:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 651 transitions. [2024-11-08 23:20:50,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:20:50,550 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:20:50,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:20:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:20:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:20:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:20:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 285 states and 653 transitions. [2024-11-08 23:20:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 653 transitions. [2024-11-08 23:20:56,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:20:56,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:20:56,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:20:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:21:08,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:21:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 294 states and 677 transitions. [2024-11-08 23:21:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 677 transitions. [2024-11-08 23:21:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 23:21:08,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:21:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:21:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:21:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:21:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 297 states and 684 transitions. [2024-11-08 23:21:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 684 transitions. [2024-11-08 23:21:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:21:14,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:21:14,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:21:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:21:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:21:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 311 states and 729 transitions. [2024-11-08 23:21:33,150 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 729 transitions. [2024-11-08 23:21:33,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:21:33,152 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:21:33,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:21:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:21:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:21:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 319 states and 753 transitions. [2024-11-08 23:21:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 753 transitions. [2024-11-08 23:21:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 23:21:45,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:21:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:21:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:21:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:21:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 320 states and 756 transitions. [2024-11-08 23:21:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 756 transitions. [2024-11-08 23:21:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:21:51,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:21:51,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:21:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:21:58,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:21:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 324 states and 768 transitions. [2024-11-08 23:21:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 768 transitions. [2024-11-08 23:21:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:21:58,481 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:21:58,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:21:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:21:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:04,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 330 states and 785 transitions. [2024-11-08 23:22:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 785 transitions. [2024-11-08 23:22:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:22:04,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:04,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 332 states and 788 transitions. [2024-11-08 23:22:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 788 transitions. [2024-11-08 23:22:08,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:22:08,531 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:08,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 335 states and 795 transitions. [2024-11-08 23:22:12,662 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 795 transitions. [2024-11-08 23:22:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 23:22:12,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 336 states and 796 transitions. [2024-11-08 23:22:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 796 transitions. [2024-11-08 23:22:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 23:22:15,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:15,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:22:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 336 states and 795 transitions. [2024-11-08 23:22:15,695 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 795 transitions. [2024-11-08 23:22:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 23:22:15,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:15,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:15,950 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:22:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 336 states and 794 transitions. [2024-11-08 23:22:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 794 transitions. [2024-11-08 23:22:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 23:22:16,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 23:22:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 336 states and 793 transitions. [2024-11-08 23:22:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 793 transitions. [2024-11-08 23:22:16,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:22:16,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:16,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 348 states and 823 transitions. [2024-11-08 23:22:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 823 transitions. [2024-11-08 23:22:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:22:31,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:31,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 354 states and 843 transitions. [2024-11-08 23:22:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 843 transitions. [2024-11-08 23:22:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:22:39,520 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 359 states and 853 transitions. [2024-11-08 23:22:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 853 transitions. [2024-11-08 23:22:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:22:46,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:46,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 360 states and 854 transitions. [2024-11-08 23:22:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 854 transitions. [2024-11-08 23:22:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:22:49,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:22:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:22:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 364 states and 861 transitions. [2024-11-08 23:22:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 861 transitions. [2024-11-08 23:22:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:22:55,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:22:55,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:22:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:22:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:23:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 367 states and 869 transitions. [2024-11-08 23:23:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 869 transitions. [2024-11-08 23:23:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 23:23:00,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:23:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:23:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:23:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 369 states and 871 transitions. [2024-11-08 23:23:03,556 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 871 transitions. [2024-11-08 23:23:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 23:23:03,557 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:23:03,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:23:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:23:04,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:23:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:23:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:23:06,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:23:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:23:07,855 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 58 iterations. [2024-11-08 23:23:08,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 11:23:08 ImpRootNode [2024-11-08 23:23:08,017 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 23:23:08,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:23:08,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:23:08,018 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:23:08,019 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:17:59" (3/4) ... [2024-11-08 23:23:08,020 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 23:23:08,230 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 23:23:08,230 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:23:08,231 INFO L158 Benchmark]: Toolchain (without parser) took 310801.87ms. Allocated memory was 136.3MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 99.3MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 630.6MB. Max. memory is 16.1GB. [2024-11-08 23:23:08,231 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 136.3MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:23:08,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.17ms. Allocated memory is still 136.3MB. Free memory was 98.8MB in the beginning and 79.5MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:23:08,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.55ms. Allocated memory is still 136.3MB. Free memory was 79.5MB in the beginning and 75.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:23:08,232 INFO L158 Benchmark]: Boogie Preprocessor took 69.92ms. Allocated memory is still 136.3MB. Free memory was 75.8MB in the beginning and 73.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:23:08,232 INFO L158 Benchmark]: RCFGBuilder took 1766.64ms. Allocated memory was 136.3MB in the beginning and 174.1MB in the end (delta: 37.7MB). Free memory was 73.2MB in the beginning and 82.8MB in the end (delta: -9.6MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-11-08 23:23:08,233 INFO L158 Benchmark]: CodeCheck took 308193.35ms. Allocated memory was 174.1MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 82.8MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 552.2MB. Max. memory is 16.1GB. [2024-11-08 23:23:08,233 INFO L158 Benchmark]: Witness Printer took 212.28ms. Allocated memory is still 4.5GB. Free memory was 3.9GB in the beginning and 3.9GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 23:23:08,235 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 308.0s, OverallIterations: 58, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27998 SdHoareTripleChecker+Valid, 198.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26075 mSDsluCounter, 16475 SdHoareTripleChecker+Invalid, 179.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11030 mSDsCounter, 9709 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73388 IncrementalHoareTripleChecker+Invalid, 83097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9709 mSolverCounterUnsat, 5445 mSDtfsCounter, 73388 mSolverCounterSat, 1.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18919 GetRequests, 16897 SyntacticMatches, 838 SemanticMatches, 1184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838706 ImplicationChecksByTransitivity, 204.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 108.6s InterpolantComputationTime, 1842 NumberOfCodeBlocks, 1842 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1733 ConstructedInterpolants, 0 QuantifiedInterpolants, 15058 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 57 InterpolantComputations, 15 PerfectInterpolantSequences, 318/1136 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 600]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] msg_t nomsg = (msg_t )-1; [L28] port_t p12 ; [L29] char p12_old ; [L30] char p12_new ; [L31] _Bool ep12 ; [L32] port_t p13 ; [L33] char p13_old ; [L34] char p13_new ; [L35] _Bool ep13 ; [L36] port_t p21 ; [L37] char p21_old ; [L38] char p21_new ; [L39] _Bool ep21 ; [L40] port_t p23 ; [L41] char p23_old ; [L42] char p23_new ; [L43] _Bool ep23 ; [L44] port_t p31 ; [L45] char p31_old ; [L46] char p31_new ; [L47] _Bool ep31 ; [L48] port_t p32 ; [L49] char p32_old ; [L50] char p32_new ; [L51] _Bool ep32 ; [L52] char id1 ; [L53] char r1 ; [L54] char st1 ; [L55] char nl1 ; [L56] char m1 ; [L57] char max1 ; [L58] _Bool mode1 ; [L59] _Bool newmax1 ; [L60] char id2 ; [L61] char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] _Bool newmax2 ; [L68] char id3 ; [L69] char r3 ; [L70] char st3 ; [L71] char nl3 ; [L72] char m3 ; [L73] char max3 ; [L74] _Bool mode3 ; [L75] _Bool newmax3 ; [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] ep12 = __VERIFIER_nondet_bool() [L524] ep13 = __VERIFIER_nondet_bool() [L525] ep21 = __VERIFIER_nondet_bool() [L526] ep23 = __VERIFIER_nondet_bool() [L527] ep31 = __VERIFIER_nondet_bool() [L528] ep32 = __VERIFIER_nondet_bool() [L529] id1 = __VERIFIER_nondet_char() [L530] r1 = __VERIFIER_nondet_char() [L531] st1 = __VERIFIER_nondet_char() [L532] nl1 = __VERIFIER_nondet_char() [L533] m1 = __VERIFIER_nondet_char() [L534] max1 = __VERIFIER_nondet_char() [L535] mode1 = __VERIFIER_nondet_bool() [L536] newmax1 = __VERIFIER_nondet_bool() [L537] id2 = __VERIFIER_nondet_char() [L538] r2 = __VERIFIER_nondet_char() [L539] st2 = __VERIFIER_nondet_char() [L540] nl2 = __VERIFIER_nondet_char() [L541] m2 = __VERIFIER_nondet_char() [L542] max2 = __VERIFIER_nondet_char() [L543] mode2 = __VERIFIER_nondet_bool() [L544] newmax2 = __VERIFIER_nondet_bool() [L545] id3 = __VERIFIER_nondet_char() [L546] r3 = __VERIFIER_nondet_char() [L547] st3 = __VERIFIER_nondet_char() [L548] nl3 = __VERIFIER_nondet_char() [L549] m3 = __VERIFIER_nondet_char() [L550] max3 = __VERIFIER_nondet_char() [L551] mode3 = __VERIFIER_nondet_bool() [L552] newmax3 = __VERIFIER_nondet_bool() [L553] CALL, EXPR init() [L231] _Bool r121 ; [L232] _Bool r131 ; [L233] _Bool r211 ; [L234] _Bool r231 ; [L235] _Bool r311 ; [L236] _Bool r321 ; [L237] _Bool r122 ; [L238] int tmp ; [L239] _Bool r132 ; [L240] int tmp___0 ; [L241] _Bool r212 ; [L242] int tmp___1 ; [L243] _Bool r232 ; [L244] int tmp___2 ; [L245] _Bool r312 ; [L246] int tmp___3 ; [L247] _Bool r322 ; [L248] int tmp___4 ; [L249] int tmp___5 ; [L252] r121 = ep12 [L253] r131 = ep13 [L254] r211 = ep21 [L255] r231 = ep23 [L256] r311 = ep31 [L257] r321 = ep32 [L258] COND TRUE \read(r121) [L259] tmp = 1 [L270] r122 = (_Bool )tmp [L271] COND FALSE !(\read(r131)) [L274] COND TRUE \read(r121) [L275] COND TRUE \read(ep23) [L276] tmp___0 = 1 [L283] r132 = (_Bool )tmp___0 [L284] COND TRUE \read(r211) [L285] tmp___1 = 1 [L296] r212 = (_Bool )tmp___1 [L297] COND TRUE \read(r231) [L298] tmp___2 = 1 [L309] r232 = (_Bool )tmp___2 [L310] COND TRUE \read(r311) [L311] tmp___3 = 1 [L322] r312 = (_Bool )tmp___3 [L323] COND FALSE !(\read(r321)) [L326] COND TRUE \read(r311) [L327] COND TRUE \read(ep12) [L328] tmp___4 = 1 [L335] r322 = (_Bool )tmp___4 [L336] COND TRUE (int )id1 != (int )id2 [L337] COND TRUE (int )id1 != (int )id3 [L338] COND TRUE (int )id2 != (int )id3 [L339] COND TRUE (int )id1 >= 0 [L340] COND TRUE (int )id2 >= 0 [L341] COND TRUE (int )id3 >= 0 [L342] COND TRUE (int )r1 == 0 [L343] COND TRUE (int )r2 == 0 [L344] COND TRUE (int )r3 == 0 [L345] COND TRUE \read(r122) [L346] COND TRUE \read(r132) [L347] COND TRUE \read(r212) [L348] COND TRUE \read(r232) [L349] COND TRUE \read(r312) [L350] COND TRUE \read(r322) [L351] COND TRUE (int )max1 == (int )id1 [L352] COND TRUE (int )max2 == (int )id2 [L353] COND TRUE (int )max3 == (int )id3 [L354] COND TRUE (int )st1 == 0 [L355] COND TRUE (int )st2 == 0 [L356] COND TRUE (int )st3 == 0 [L357] COND TRUE (int )nl1 == 0 [L358] COND TRUE (int )nl2 == 0 [L359] COND TRUE (int )nl3 == 0 [L360] COND TRUE (int )mode1 == 0 [L361] COND TRUE (int )mode2 == 0 [L362] COND TRUE (int )mode3 == 0 [L363] COND TRUE \read(newmax1) [L364] COND TRUE \read(newmax2) [L365] COND TRUE \read(newmax3) [L366] tmp___5 = 1 [L457] return (tmp___5); [L553] RET, EXPR init() [L553] i2 = init() [L554] CALL assume_abort_if_not(i2) [L21] COND FALSE !(!cond) [L554] RET assume_abort_if_not(i2) [L555] p12_old = nomsg [L556] p12_new = nomsg [L557] p13_old = nomsg [L558] p13_new = nomsg [L559] p21_old = nomsg [L560] p21_new = nomsg [L561] p23_old = nomsg [L562] p23_new = nomsg [L563] p31_old = nomsg [L564] p31_new = nomsg [L565] p32_old = nomsg [L566] p32_new = nomsg [L567] i2 = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, i2=0, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=0, r3=0, st1=0, st2=0, st3=0] [L568] COND FALSE !(i2 < 6) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, i2=0, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND FALSE !(\read(ep13)) [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND TRUE \read(newmax2) [L164] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L167] COND TRUE \read(ep23) [L168] COND TRUE \read(newmax2) [L169] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND TRUE \read(newmax3) [L215] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, 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=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, i2=1, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND FALSE !(i2 < 6) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, i2=1, id1=2, id2=0, id3=127, m1=0, m2=0, m3=1, max1=2, max2=0, 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=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=0, p23=0, p23_new=-1, p23_old=0, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND TRUE (int )m1 > (int )max1 [L96] max1 = m1 [L97] newmax = (_Bool)1 [L100] newmax1 = newmax [L101] COND FALSE !((int )r1 == 2) [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND TRUE (int )m2 > (int )max2 [L139] max2 = m2 [L140] newmax = (_Bool)1 [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND FALSE !((int )r2 == 2) [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND FALSE !(\read(ep13)) [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND FALSE !((int )m3 > (int )max3) [L202] newmax3 = newmax [L203] COND FALSE !((int )r3 == 2) [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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 [L485] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, i2=2, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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] [L568] COND FALSE !(i2 < 6) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, i2=2, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, 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] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND FALSE !(\read(ep13)) [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND TRUE \read(newmax2) [L164] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L167] COND TRUE \read(ep23) [L168] COND TRUE \read(newmax2) [L169] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND FALSE !(\read(newmax3)) [L218] COND FALSE !(\read(ep32)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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 [L485] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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] [L586] RET assert(c1) [L587] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, i2=3, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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] [L568] COND FALSE !(i2 < 6) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, i2=3, id1=2, id2=0, id3=127, m1=127, m2=2, m3=0, max1=127, max2=2, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=127, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=2, 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] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND FALSE !((int )m1 > (int )max1) [L100] newmax1 = newmax [L101] COND TRUE (int )r1 == 2 [L102] COND FALSE !((int )max1 == (int )id1) [L105] st1 = (char)1 [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND TRUE (int )m2 > (int )max2 [L139] max2 = m2 [L140] newmax = (_Bool)1 [L143] COND FALSE !(\read(ep32)) [L151] newmax2 = newmax [L152] COND TRUE (int )r2 == 2 [L153] COND FALSE !((int )max2 == (int )id2) [L156] nl2 = (char)1 [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND FALSE !(\read(ep13)) [L194] COND TRUE \read(ep23) [L195] m3 = p23_old [L196] p23_old = nomsg [L197] COND FALSE !((int )m3 > (int )max3) [L202] newmax3 = newmax [L203] COND TRUE (int )r3 == 2 [L204] COND TRUE (int )max3 == (int )id3 [L205] st3 = (char)1 [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=-1, m2=127, m3=2, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=1, 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=1, st2=0, st3=1] [L465] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L511] tmp = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=-1, m2=127, m3=2, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=1, 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=1, st2=0, st3=1, tmp=0] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=-1, m2=127, m3=2, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=1, 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=1, st2=0, st3=1] [L600] reach_error() VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=0, id1=2, id2=0, id3=127, m1=-1, m2=127, m3=2, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=1, 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=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 136.3MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.17ms. Allocated memory is still 136.3MB. Free memory was 98.8MB in the beginning and 79.5MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.55ms. Allocated memory is still 136.3MB. Free memory was 79.5MB in the beginning and 75.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.92ms. Allocated memory is still 136.3MB. Free memory was 75.8MB in the beginning and 73.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1766.64ms. Allocated memory was 136.3MB in the beginning and 174.1MB in the end (delta: 37.7MB). Free memory was 73.2MB in the beginning and 82.8MB in the end (delta: -9.6MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * CodeCheck took 308193.35ms. Allocated memory was 174.1MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 82.8MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 552.2MB. Max. memory is 16.1GB. * Witness Printer took 212.28ms. Allocated memory is still 4.5GB. Free memory was 3.9GB in the beginning and 3.9GB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-08 23:23:08,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4371cc57-f4bc-46b1-bdbd-e438cb8a2f1a/bin/ukojak-verify-ImItNfHLgk/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