./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9 --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 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 22:14:17,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 22:14:17,070 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-02 22:14:17,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 22:14:17,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-02 22:14:17,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 22:14:17,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 22:14:17,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-02 22:14:17,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 22:14:17,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 22:14:17,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 22:14:17,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 22:14:17,105 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 22:14:17,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 22:14:17,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 22:14:17,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 22:14:17,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 22:14:17,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 22:14:17,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 22:14:17,109 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 22:14:17,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 22:14:17,112 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 22:14:17,112 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-02 22:14:17,112 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-02 22:14:17,113 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-02 22:14:17,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 22:14:17,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 22:14:17,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 22:14:17,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 22:14:17,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 22:14:17,115 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-02 22:14:17,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 22:14:17,116 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 22:14:17,116 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_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/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_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9 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 -> 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 [2023-12-02 22:14:17,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 22:14:17,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 22:14:17,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 22:14:17,362 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 22:14:17,362 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 22:14:17,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2023-12-02 22:14:20,127 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 22:14:20,321 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 22:14:20,321 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2023-12-02 22:14:20,332 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/data/d20d44958/795b63154d484d2cad5f2a79827d5855/FLAGc98c6abc8 [2023-12-02 22:14:20,343 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/data/d20d44958/795b63154d484d2cad5f2a79827d5855 [2023-12-02 22:14:20,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 22:14:20,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 22:14:20,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 22:14:20,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 22:14:20,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 22:14:20,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:14:20" (1/1) ... [2023-12-02 22:14:20,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@451ec1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:14:20, skipping insertion in model container [2023-12-02 22:14:20,353 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:14:20" (1/1) ... [2023-12-02 22:14:20,396 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 22:14:20,595 WARN L240 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_30a53e62-47c8-49fd-b860-803a230932b8/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2023-12-02 22:14:20,599 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 22:14:20,612 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 22:14:20,671 WARN L240 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_30a53e62-47c8-49fd-b860-803a230932b8/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2023-12-02 22:14:20,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 22:14:20,689 INFO L206 MainTranslator]: Completed translation [2023-12-02 22:14:20,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:14:20 WrapperNode [2023-12-02 22:14:20,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 22:14:20,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 22:14:20,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 22:14:20,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 22:14:20,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:14:20" (1/1) ... [2023-12-02 22:14:20,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:14:20" (1/1) ... [2023-12-02 22:14:20,748 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 484 [2023-12-02 22:14:20,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 22:14:20,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 22:14:20,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 22:14:20,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 22:14:20,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:14:20" (1/1) ... [2023-12-02 22:14:20,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:14:20" (1/1) ... [2023-12-02 22:14:20,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:14:20" (1/1) ... [2023-12-02 22:14:20,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:14:20" (1/1) ... [2023-12-02 22:14:20,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:14:20" (1/1) ... [2023-12-02 22:14:20,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:14:20" (1/1) ... [2023-12-02 22:14:20,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:14:20" (1/1) ... [2023-12-02 22:14:20,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:14:20" (1/1) ... [2023-12-02 22:14:20,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 22:14:20,797 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 22:14:20,797 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 22:14:20,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 22:14:20,798 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:14:20" (1/1) ... [2023-12-02 22:14:20,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 22:14:20,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-02 22:14:20,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-02 22:14:20,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-02 22:14:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 22:14:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 22:14:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 22:14:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 22:14:20,974 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 22:14:20,976 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 22:14:21,440 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 22:14:22,005 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 22:14:22,006 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 22:14:22,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:14:22 BoogieIcfgContainer [2023-12-02 22:14:22,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 22:14:22,008 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-02 22:14:22,008 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-02 22:14:22,017 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-02 22:14:22,017 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:14:22" (1/1) ... [2023-12-02 22:14:22,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 22:14:22,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2023-12-02 22:14:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2023-12-02 22:14:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 22:14:22,071 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:22,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:23,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2023-12-02 22:14:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2023-12-02 22:14:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 22:14:23,796 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:23,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:24,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2023-12-02 22:14:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2023-12-02 22:14:24,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 22:14:24,874 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:24,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2023-12-02 22:14:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2023-12-02 22:14:26,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 22:14:26,287 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:26,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2023-12-02 22:14:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2023-12-02 22:14:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 22:14:27,812 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:27,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 38 states and 70 transitions. [2023-12-02 22:14:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 70 transitions. [2023-12-02 22:14:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 22:14:29,147 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:29,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 44 states and 83 transitions. [2023-12-02 22:14:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 83 transitions. [2023-12-02 22:14:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 22:14:30,998 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 45 states and 83 transitions. [2023-12-02 22:14:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 83 transitions. [2023-12-02 22:14:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 22:14:31,287 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:31,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 46 states and 84 transitions. [2023-12-02 22:14:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 84 transitions. [2023-12-02 22:14:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 22:14:31,356 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:31,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 56 states and 103 transitions. [2023-12-02 22:14:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 103 transitions. [2023-12-02 22:14:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 22:14:33,733 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:33,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 59 states and 109 transitions. [2023-12-02 22:14:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 109 transitions. [2023-12-02 22:14:34,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 22:14:34,273 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:34,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 75 states and 142 transitions. [2023-12-02 22:14:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 142 transitions. [2023-12-02 22:14:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 22:14:39,298 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:42,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 89 states and 163 transitions. [2023-12-02 22:14:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 163 transitions. [2023-12-02 22:14:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 22:14:42,638 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:42,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:45,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 97 states and 181 transitions. [2023-12-02 22:14:45,903 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 181 transitions. [2023-12-02 22:14:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 22:14:45,904 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:45,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:49,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 104 states and 202 transitions. [2023-12-02 22:14:49,003 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 202 transitions. [2023-12-02 22:14:49,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 22:14:49,005 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:49,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 105 states and 207 transitions. [2023-12-02 22:14:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 207 transitions. [2023-12-02 22:14:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 22:14:50,173 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:50,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 119 states and 235 transitions. [2023-12-02 22:14:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 235 transitions. [2023-12-02 22:14:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 22:14:54,035 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:54,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 120 states and 237 transitions. [2023-12-02 22:14:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 237 transitions. [2023-12-02 22:14:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 22:14:55,170 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:55,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 121 states and 241 transitions. [2023-12-02 22:14:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 241 transitions. [2023-12-02 22:14:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 22:14:56,287 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 122 states and 243 transitions. [2023-12-02 22:14:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 243 transitions. [2023-12-02 22:14:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 22:14:57,323 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:57,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:14:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:14:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:14:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 123 states and 248 transitions. [2023-12-02 22:14:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 248 transitions. [2023-12-02 22:14:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 22:14:58,428 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:14:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:14:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:15:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:15:04,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:15:04,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 143 states and 286 transitions. [2023-12-02 22:15:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 286 transitions. [2023-12-02 22:15:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 22:15:04,623 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:15:04,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:15:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:15:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:15:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:15:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 148 states and 297 transitions. [2023-12-02 22:15:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 297 transitions. [2023-12-02 22:15:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 22:15:07,341 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:15:07,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:15:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:15:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:15:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:15:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 167 states and 327 transitions. [2023-12-02 22:15:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 327 transitions. [2023-12-02 22:15:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 22:15:13,824 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:15:13,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:15:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:15:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:15:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:15:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 182 states and 381 transitions. [2023-12-02 22:15:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 381 transitions. [2023-12-02 22:15:24,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:15:24,239 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:15:24,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:15:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:15:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 22:15:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:15:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 195 states and 407 transitions. [2023-12-02 22:15:31,074 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 407 transitions. [2023-12-02 22:15:31,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:15:31,075 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:15:31,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:15:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:15:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:15:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:15:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 224 states and 455 transitions. [2023-12-02 22:15:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 455 transitions. [2023-12-02 22:15:44,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 22:15:44,806 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:15:44,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:15:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:15:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:15:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:15:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 225 states and 459 transitions. [2023-12-02 22:15:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 459 transitions. [2023-12-02 22:15:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 22:15:47,959 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:15:47,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:15:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:15:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:15:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:15:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 226 states and 460 transitions. [2023-12-02 22:15:49,605 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 460 transitions. [2023-12-02 22:15:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 22:15:49,606 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:15:49,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:15:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:15:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:15:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:15:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 236 states and 479 transitions. [2023-12-02 22:15:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 479 transitions. [2023-12-02 22:15:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 22:15:57,255 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:15:57,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:15:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:15:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:15:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:15:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 237 states and 481 transitions. [2023-12-02 22:15:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 481 transitions. [2023-12-02 22:15:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 22:15:59,054 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:15:59,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:15:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:16:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:16:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:16:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 248 states and 504 transitions. [2023-12-02 22:16:07,111 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 504 transitions. [2023-12-02 22:16:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 22:16:07,112 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:16:07,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:16:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:16:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:16:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:16:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 255 states and 532 transitions. [2023-12-02 22:16:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 532 transitions. [2023-12-02 22:16:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 22:16:17,794 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:16:17,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:16:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:16:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:16:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:16:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 257 states and 537 transitions. [2023-12-02 22:16:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 537 transitions. [2023-12-02 22:16:23,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 22:16:23,389 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:16:23,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:16:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:16:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:16:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:16:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 264 states and 557 transitions. [2023-12-02 22:16:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 557 transitions. [2023-12-02 22:16:30,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 22:16:30,994 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:16:30,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:16:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:16:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:16:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:16:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 265 states and 562 transitions. [2023-12-02 22:16:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 562 transitions. [2023-12-02 22:16:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 22:16:32,739 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:16:32,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:16:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:16:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:16:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:16:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 274 states and 579 transitions. [2023-12-02 22:16:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 579 transitions. [2023-12-02 22:16:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 22:16:42,728 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:16:42,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:16:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:16:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:16:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:16:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 280 states and 596 transitions. [2023-12-02 22:16:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 596 transitions. [2023-12-02 22:16:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 22:16:48,893 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:16:48,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:16:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:16:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 22:16:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:16:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 278 states and 576 transitions. [2023-12-02 22:16:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 576 transitions. [2023-12-02 22:16:51,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 22:16:51,082 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:16:51,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:16:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:16:51,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 22:16:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:16:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:16:52,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 22:16:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:16:53,169 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 39 iterations. [2023-12-02 22:16:53,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 10:16:53 ImpRootNode [2023-12-02 22:16:53,292 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-02 22:16:53,292 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 22:16:53,292 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 22:16:53,293 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 22:16:53,293 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:14:22" (3/4) ... [2023-12-02 22:16:53,294 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 22:16:53,440 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-02 22:16:53,440 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 22:16:53,441 INFO L158 Benchmark]: Toolchain (without parser) took 153094.51ms. Allocated memory was 176.2MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 131.2MB in the beginning and 780.9MB in the end (delta: -649.6MB). Peak memory consumption was 872.3MB. Max. memory is 16.1GB. [2023-12-02 22:16:53,441 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 22:16:53,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.11ms. Allocated memory is still 176.2MB. Free memory was 130.8MB in the beginning and 113.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 22:16:53,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.55ms. Allocated memory is still 176.2MB. Free memory was 113.6MB in the beginning and 110.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 22:16:53,442 INFO L158 Benchmark]: Boogie Preprocessor took 47.19ms. Allocated memory is still 176.2MB. Free memory was 110.7MB in the beginning and 108.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 22:16:53,442 INFO L158 Benchmark]: RCFGBuilder took 1210.48ms. Allocated memory is still 176.2MB. Free memory was 107.7MB in the beginning and 70.4MB in the end (delta: 37.3MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2023-12-02 22:16:53,442 INFO L158 Benchmark]: CodeCheck took 151283.45ms. Allocated memory was 176.2MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 70.4MB in the beginning and 797.6MB in the end (delta: -727.2MB). Peak memory consumption was 793.2MB. Max. memory is 16.1GB. [2023-12-02 22:16:53,443 INFO L158 Benchmark]: Witness Printer took 147.61ms. Allocated memory is still 1.7GB. Free memory was 797.6MB in the beginning and 780.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 22:16:53,445 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 151.1s, OverallIterations: 39, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11473 SdHoareTripleChecker+Valid, 70.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10225 mSDsluCounter, 3322 SdHoareTripleChecker+Invalid, 63.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2714 mSDsCounter, 4234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32325 IncrementalHoareTripleChecker+Invalid, 36559 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4234 mSolverCounterUnsat, 608 mSDtfsCounter, 32325 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10377 GetRequests, 9076 SyntacticMatches, 419 SemanticMatches, 882 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461411 ImplicationChecksByTransitivity, 104.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 49.8s InterpolantComputationTime, 1030 NumberOfCodeBlocks, 1030 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 944 ConstructedInterpolants, 0 QuantifiedInterpolants, 8306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 11 PerfectInterpolantSequences, 144/542 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 TRUE \read(r131) [L272] tmp___0 = 1 [L283] r132 = (_Bool )tmp___0 [L284] COND TRUE \read(r211) [L285] tmp___1 = 1 [L296] r212 = (_Bool )tmp___1 [L297] COND FALSE !(\read(r231)) [L300] COND TRUE \read(r211) [L301] COND TRUE \read(ep13) [L302] tmp___2 = 1 [L309] r232 = (_Bool )tmp___2 [L310] COND TRUE \read(r311) [L311] tmp___3 = 1 [L322] r312 = (_Bool )tmp___3 [L323] COND TRUE \read(r321) [L324] 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 [c1=0, ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, i2=0, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=1, newmax3=255, 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 < 1 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND TRUE \read(ep13) [L117] COND TRUE \read(newmax1) [L118] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [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 FALSE !(\read(ep23)) [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 TRUE \read(ep32) [L219] COND TRUE \read(newmax3) [L220] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [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=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, 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=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, 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=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, 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=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, 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=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, 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 [\old(arg)=1, arg=1, ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, i2=1, id1=124, id2=126, id3=125, m1=127, m2=-2, m3=-2, max1=124, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=124, p13=0, p13_new=-1, p13_old=124, p21=0, p21_new=-1, p21_old=126, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=125, p32=0, p32_new=-1, p32_old=125, 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 TRUE (int )m1 > (int )max1 [L88] max1 = m1 [L89] newmax = (_Bool)1 [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 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 FALSE !((int )m2 > (int )max2) [L143] COND TRUE \read(ep32) [L144] m2 = p32_old [L145] p32_old = nomsg [L146] COND FALSE !((int )m2 > (int )max2) [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 TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND FALSE !((int )m3 > (int )max3) [L194] COND FALSE !(\read(ep23)) [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=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, i2=2, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND FALSE !((int )r1 < 1) [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 FALSE !(\read(newmax2)) [L167] COND FALSE !(\read(ep23)) [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 TRUE \read(ep32) [L219] COND FALSE !(\read(newmax3)) [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=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, i2=3, id1=124, id2=126, id3=125, m1=125, m2=125, m3=124, max1=126, max2=126, max3=125, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [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] nl1 = (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 FALSE !((int )m2 > (int )max2) [L143] COND TRUE \read(ep32) [L144] m2 = p32_old [L145] p32_old = nomsg [L146] COND FALSE !((int )m2 > (int )max2) [L151] newmax2 = newmax [L152] COND TRUE (int )r2 == 2 [L153] COND TRUE (int )max2 == (int )id2 [L154] st2 = (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 TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND FALSE !((int )m3 > (int )max3) [L194] COND FALSE !(\read(ep23)) [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=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=-1, m2=-1, m3=-1, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L465] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L511] tmp = 0 VAL [ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=-1, m2=-1, m3=-1, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1, tmp=0] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=-1, m2=-1, m3=-1, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L600] reach_error() VAL [\old(arg)=0, arg=0, ep12=1, ep13=255, ep21=255, ep23=0, ep31=1, ep32=255, id1=124, id2=126, id3=125, m1=-1, m2=-1, m3=-1, max1=126, max2=126, max3=125, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.11ms. Allocated memory is still 176.2MB. Free memory was 130.8MB in the beginning and 113.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.55ms. Allocated memory is still 176.2MB. Free memory was 113.6MB in the beginning and 110.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.19ms. Allocated memory is still 176.2MB. Free memory was 110.7MB in the beginning and 108.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1210.48ms. Allocated memory is still 176.2MB. Free memory was 107.7MB in the beginning and 70.4MB in the end (delta: 37.3MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. * CodeCheck took 151283.45ms. Allocated memory was 176.2MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 70.4MB in the beginning and 797.6MB in the end (delta: -727.2MB). Peak memory consumption was 793.2MB. Max. memory is 16.1GB. * Witness Printer took 147.61ms. Allocated memory is still 1.7GB. Free memory was 797.6MB in the beginning and 780.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-02 22:16:53,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30a53e62-47c8-49fd-b860-803a230932b8/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, 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