./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/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_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/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_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/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 c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-03 03:22:20,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-03 03:22:20,363 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-03 03:22:20,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-03 03:22:20,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-03 03:22:20,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-03 03:22:20,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-03 03:22:20,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-03 03:22:20,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-03 03:22:20,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-03 03:22:20,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-03 03:22:20,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-03 03:22:20,391 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-03 03:22:20,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-03 03:22:20,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-03 03:22:20,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-03 03:22:20,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-03 03:22:20,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-03 03:22:20,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-03 03:22:20,395 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-03 03:22:20,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-03 03:22:20,396 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-03 03:22:20,396 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-03 03:22:20,397 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-03 03:22:20,397 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-03 03:22:20,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-03 03:22:20,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 03:22:20,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-03 03:22:20,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-03 03:22:20,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-03 03:22:20,400 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-03 03:22:20,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-03 03:22:20,400 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-03 03:22:20,401 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_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/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_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/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 -> c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce [2023-12-03 03:22:20,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-03 03:22:20,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-03 03:22:20,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-03 03:22:20,634 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-03 03:22:20,634 INFO L274 PluginConnector]: CDTParser initialized [2023-12-03 03:22:20,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2023-12-03 03:22:23,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-03 03:22:23,623 INFO L384 CDTParser]: Found 1 translation units. [2023-12-03 03:22:23,624 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2023-12-03 03:22:23,634 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/bin/ukojak-verify-Qdu7aM0XO9/data/e813420a5/b721b98a06d148b69c10749d18308138/FLAGac24d6e74 [2023-12-03 03:22:23,646 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/bin/ukojak-verify-Qdu7aM0XO9/data/e813420a5/b721b98a06d148b69c10749d18308138 [2023-12-03 03:22:23,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-03 03:22:23,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-03 03:22:23,650 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-03 03:22:23,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-03 03:22:23,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-03 03:22:23,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:22:23" (1/1) ... [2023-12-03 03:22:23,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee15984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:22:23, skipping insertion in model container [2023-12-03 03:22:23,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:22:23" (1/1) ... [2023-12-03 03:22:23,703 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-03 03:22:23,917 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_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2023-12-03 03:22:23,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 03:22:23,934 INFO L202 MainTranslator]: Completed pre-run [2023-12-03 03:22:23,990 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_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2023-12-03 03:22:23,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 03:22:24,008 INFO L206 MainTranslator]: Completed translation [2023-12-03 03:22:24,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:22:24 WrapperNode [2023-12-03 03:22:24,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-03 03:22:24,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-03 03:22:24,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-03 03:22:24,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-03 03:22:24,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:22:24" (1/1) ... [2023-12-03 03:22:24,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:22:24" (1/1) ... [2023-12-03 03:22:24,064 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 470 [2023-12-03 03:22:24,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-03 03:22:24,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-03 03:22:24,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-03 03:22:24,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-03 03:22:24,075 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:22:24" (1/1) ... [2023-12-03 03:22:24,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:22:24" (1/1) ... [2023-12-03 03:22:24,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:22:24" (1/1) ... [2023-12-03 03:22:24,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:22:24" (1/1) ... [2023-12-03 03:22:24,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:22:24" (1/1) ... [2023-12-03 03:22:24,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:22:24" (1/1) ... [2023-12-03 03:22:24,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:22:24" (1/1) ... [2023-12-03 03:22:24,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:22:24" (1/1) ... [2023-12-03 03:22:24,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-03 03:22:24,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-03 03:22:24,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-03 03:22:24,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-03 03:22:24,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:22:24" (1/1) ... [2023-12-03 03:22:24,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 03:22:24,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-03 03:22:24,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-03 03:22:24,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-03 03:22:24,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-03 03:22:24,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-03 03:22:24,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-03 03:22:24,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-03 03:22:24,282 INFO L241 CfgBuilder]: Building ICFG [2023-12-03 03:22:24,284 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-03 03:22:24,723 INFO L282 CfgBuilder]: Performing block encoding [2023-12-03 03:22:25,310 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-03 03:22:25,310 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-03 03:22:25,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:22:25 BoogieIcfgContainer [2023-12-03 03:22:25,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-03 03:22:25,313 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-03 03:22:25,313 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-03 03:22:25,322 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-03 03:22:25,322 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:22:25" (1/1) ... [2023-12-03 03:22:25,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-03 03:22:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2023-12-03 03:22:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2023-12-03 03:22:25,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-03 03:22:25,385 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:25,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:26,700 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-03 03:22:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2023-12-03 03:22:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2023-12-03 03:22:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-03 03:22:26,801 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:26,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:27,570 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-03 03:22:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2023-12-03 03:22:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2023-12-03 03:22:27,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-03 03:22:27,881 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:27,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:28,609 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-03 03:22:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2023-12-03 03:22:29,071 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2023-12-03 03:22:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-03 03:22:29,073 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:29,652 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-03 03:22:30,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2023-12-03 03:22:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2023-12-03 03:22:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-03 03:22:30,337 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:30,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:31,131 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-03 03:22:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2023-12-03 03:22:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2023-12-03 03:22:31,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-03 03:22:31,916 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:31,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:32,345 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-03 03:22:33,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2023-12-03 03:22:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2023-12-03 03:22:33,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-03 03:22:33,178 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:33,265 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-03 03:22:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2023-12-03 03:22:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2023-12-03 03:22:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-03 03:22:33,427 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:33,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:33,478 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-03 03:22:33,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2023-12-03 03:22:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2023-12-03 03:22:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-03 03:22:33,491 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:33,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:34,411 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-03 03:22:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 58 states and 105 transitions. [2023-12-03 03:22:35,854 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2023-12-03 03:22:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-03 03:22:35,855 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:35,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:36,137 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-03 03:22:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 61 states and 111 transitions. [2023-12-03 03:22:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 111 transitions. [2023-12-03 03:22:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-03 03:22:36,373 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:36,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:38,013 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-03 03:22:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2023-12-03 03:22:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2023-12-03 03:22:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-03 03:22:42,104 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:42,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:43,307 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-03 03:22:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 91 states and 176 transitions. [2023-12-03 03:22:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 176 transitions. [2023-12-03 03:22:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-03 03:22:46,574 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:46,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:47,450 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-03 03:22:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 92 states and 177 transitions. [2023-12-03 03:22:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 177 transitions. [2023-12-03 03:22:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-03 03:22:47,804 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:48,789 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-03 03:22:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 100 states and 200 transitions. [2023-12-03 03:22:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 200 transitions. [2023-12-03 03:22:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-03 03:22:51,743 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:51,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:52,497 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-03 03:22:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 101 states and 203 transitions. [2023-12-03 03:22:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 203 transitions. [2023-12-03 03:22:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-03 03:22:52,964 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:52,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:53,770 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-03 03:22:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 102 states and 204 transitions. [2023-12-03 03:22:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 204 transitions. [2023-12-03 03:22:54,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-03 03:22:54,107 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:54,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:22:54,987 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-03 03:22:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:22:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 116 states and 236 transitions. [2023-12-03 03:22:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 236 transitions. [2023-12-03 03:22:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-03 03:22:59,463 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:22:59,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:22:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:23:00,047 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-03 03:23:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:23:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 117 states and 238 transitions. [2023-12-03 03:23:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 238 transitions. [2023-12-03 03:23:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-03 03:23:00,392 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:23:00,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:23:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:23:00,994 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-03 03:23:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:23:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 119 states and 244 transitions. [2023-12-03 03:23:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 244 transitions. [2023-12-03 03:23:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-03 03:23:01,844 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:23:01,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:23:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:23:02,465 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-03 03:23:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:23:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 120 states and 245 transitions. [2023-12-03 03:23:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 245 transitions. [2023-12-03 03:23:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-03 03:23:02,858 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:23:02,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:23:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:23:04,349 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-03 03:23:10,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:23:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 139 states and 282 transitions. [2023-12-03 03:23:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 282 transitions. [2023-12-03 03:23:10,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-03 03:23:10,354 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:23:10,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:23:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:23:11,637 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-03 03:23:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:23:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 143 states and 296 transitions. [2023-12-03 03:23:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 296 transitions. [2023-12-03 03:23:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-03 03:23:13,793 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:23:13,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:23:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:23:14,834 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-03 03:23:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:23:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 158 states and 323 transitions. [2023-12-03 03:23:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 323 transitions. [2023-12-03 03:23:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-03 03:23:19,204 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:23:19,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:23:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:23:20,413 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-03 03:23:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:23:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 159 states and 324 transitions. [2023-12-03 03:23:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 324 transitions. [2023-12-03 03:23:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-03 03:23:21,028 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:23:21,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:23:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:23:22,393 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-03 03:23:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:23:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 160 states and 327 transitions. [2023-12-03 03:23:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 327 transitions. [2023-12-03 03:23:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-03 03:23:23,175 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:23:23,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:23:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:23:24,520 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-03 03:23:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:23:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 161 states and 328 transitions. [2023-12-03 03:23:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 328 transitions. [2023-12-03 03:23:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-03 03:23:25,270 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:23:25,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:23:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:23:26,255 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-03 03:23:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:23:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 181 states and 367 transitions. [2023-12-03 03:23:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 367 transitions. [2023-12-03 03:23:32,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-03 03:23:32,095 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:23:32,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:23:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:23:34,000 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-03 03:23:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:23:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 189 states and 385 transitions. [2023-12-03 03:23:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 385 transitions. [2023-12-03 03:23:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-03 03:23:39,232 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:23:39,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:23:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:23:42,057 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-03 03:23:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:23:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 203 states and 434 transitions. [2023-12-03 03:23:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 434 transitions. [2023-12-03 03:23:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-03 03:23:49,696 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:23:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:23:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:23:51,646 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-03 03:24:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:24:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 217 states and 487 transitions. [2023-12-03 03:24:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 487 transitions. [2023-12-03 03:24:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-03 03:24:00,541 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:24:00,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:24:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:24:03,394 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-03 03:24:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:24:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 224 states and 506 transitions. [2023-12-03 03:24:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 506 transitions. [2023-12-03 03:24:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-03 03:24:09,130 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:24:09,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:24:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:24:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 03:24:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:24:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 236 states and 536 transitions. [2023-12-03 03:24:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 536 transitions. [2023-12-03 03:24:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-03 03:24:18,902 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:24:18,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:24:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:24:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 03:24:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:24:27,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 248 states and 558 transitions. [2023-12-03 03:24:27,682 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 558 transitions. [2023-12-03 03:24:27,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-03 03:24:27,683 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:24:27,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:24:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:24:29,593 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-03 03:24:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:24:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 256 states and 581 transitions. [2023-12-03 03:24:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 581 transitions. [2023-12-03 03:24:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-03 03:24:36,114 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:24:36,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:24:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:24:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 03:24:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:24:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 269 states and 606 transitions. [2023-12-03 03:24:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 606 transitions. [2023-12-03 03:24:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-03 03:24:45,127 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:24:45,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:24:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:24:45,973 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-03 03:24:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:24:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 270 states and 608 transitions. [2023-12-03 03:24:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 608 transitions. [2023-12-03 03:24:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-03 03:24:46,796 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:24:46,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:24:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:24:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 03:25:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:25:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 279 states and 633 transitions. [2023-12-03 03:25:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 633 transitions. [2023-12-03 03:25:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-03 03:25:00,647 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:25:00,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:25:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:25:02,260 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-03 03:25:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:25:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 285 states and 657 transitions. [2023-12-03 03:25:08,849 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 657 transitions. [2023-12-03 03:25:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-03 03:25:08,850 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:25:08,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:25:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:25:12,570 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-03 03:25:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:25:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 296 states and 673 transitions. [2023-12-03 03:25:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 673 transitions. [2023-12-03 03:25:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-03 03:25:22,834 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:25:22,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:25:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:25:26,424 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-03 03:25:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:25:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 301 states and 685 transitions. [2023-12-03 03:25:33,542 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 685 transitions. [2023-12-03 03:25:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-03 03:25:33,543 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:25:33,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:25:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:25:35,670 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-03 03:25:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:25:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 309 states and 701 transitions. [2023-12-03 03:25:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 701 transitions. [2023-12-03 03:25:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-03 03:25:41,231 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:25:41,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:25:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:25:42,748 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-03 03:25:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:25:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 314 states and 706 transitions. [2023-12-03 03:25:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 706 transitions. [2023-12-03 03:25:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-03 03:25:44,099 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:25:44,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:25:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:25:47,533 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-03 03:25:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:25:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 316 states and 709 transitions. [2023-12-03 03:25:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 709 transitions. [2023-12-03 03:25:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-03 03:25:52,960 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:25:52,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:25:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:25:53,986 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-03 03:25:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:25:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 319 states and 720 transitions. [2023-12-03 03:25:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 720 transitions. [2023-12-03 03:25:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-03 03:25:57,473 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:25:57,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:25:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:26:01,020 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-03 03:26:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:26:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 327 states and 740 transitions. [2023-12-03 03:26:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 740 transitions. [2023-12-03 03:26:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-03 03:26:10,524 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:26:10,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:26:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 03:26:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 03:26:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 03:26:17,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 328 states and 742 transitions. [2023-12-03 03:26:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 742 transitions. [2023-12-03 03:26:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-03 03:26:17,715 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 03:26:17,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 03:26:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 03:26:18,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 03:26:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 03:26:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 03:26:19,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 03:26:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 03:26:19,450 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 47 iterations. [2023-12-03 03:26:19,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 03.12 03:26:19 ImpRootNode [2023-12-03 03:26:19,571 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-03 03:26:19,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-03 03:26:19,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-03 03:26:19,572 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-03 03:26:19,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:22:25" (3/4) ... [2023-12-03 03:26:19,573 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-03 03:26:19,712 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-03 03:26:19,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-03 03:26:19,713 INFO L158 Benchmark]: Toolchain (without parser) took 236063.76ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 123.4MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 851.9MB. Max. memory is 16.1GB. [2023-12-03 03:26:19,713 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory was 55.3MB in the beginning and 55.2MB in the end (delta: 100.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-03 03:26:19,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.18ms. Allocated memory is still 155.2MB. Free memory was 123.4MB in the beginning and 106.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-03 03:26:19,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.72ms. Allocated memory is still 155.2MB. Free memory was 106.6MB in the beginning and 103.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-03 03:26:19,714 INFO L158 Benchmark]: Boogie Preprocessor took 44.85ms. Allocated memory is still 155.2MB. Free memory was 103.0MB in the beginning and 100.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-03 03:26:19,715 INFO L158 Benchmark]: RCFGBuilder took 1201.01ms. Allocated memory is still 155.2MB. Free memory was 100.9MB in the beginning and 83.5MB in the end (delta: 17.4MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2023-12-03 03:26:19,715 INFO L158 Benchmark]: CodeCheck took 234258.09ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 83.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 795.3MB. Max. memory is 16.1GB. [2023-12-03 03:26:19,715 INFO L158 Benchmark]: Witness Printer took 140.83ms. Allocated memory is still 2.0GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-03 03:26:19,717 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: 234.1s, OverallIterations: 47, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16130 SdHoareTripleChecker+Valid, 109.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14638 mSDsluCounter, 5351 SdHoareTripleChecker+Invalid, 99.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4607 mSDsCounter, 6200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47765 IncrementalHoareTripleChecker+Invalid, 53965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6200 mSolverCounterUnsat, 744 mSDtfsCounter, 47765 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13304 GetRequests, 11589 SyntacticMatches, 565 SemanticMatches, 1150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812752 ImplicationChecksByTransitivity, 179.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 67.7s InterpolantComputationTime, 1246 NumberOfCodeBlocks, 1246 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1152 ConstructedInterpolants, 0 QuantifiedInterpolants, 13909 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 10 PerfectInterpolantSequences, 118/635 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: 573]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t p12 ; [L26] char p12_old ; [L27] char p12_new ; [L28] _Bool ep12 ; [L29] port_t p13 ; [L30] char p13_old ; [L31] char p13_new ; [L32] _Bool ep13 ; [L33] port_t p21 ; [L34] char p21_old ; [L35] char p21_new ; [L36] _Bool ep21 ; [L37] port_t p23 ; [L38] char p23_old ; [L39] char p23_new ; [L40] _Bool ep23 ; [L41] port_t p31 ; [L42] char p31_old ; [L43] char p31_new ; [L44] _Bool ep31 ; [L45] port_t p32 ; [L46] char p32_old ; [L47] char p32_new ; [L48] _Bool ep32 ; [L49] char id1 ; [L50] char r1 ; [L51] char st1 ; [L52] char nl1 ; [L53] char m1 ; [L54] char max1 ; [L55] _Bool mode1 ; [L56] _Bool newmax1 ; [L57] char id2 ; [L58] char r2 ; [L59] char st2 ; [L60] char nl2 ; [L61] char m2 ; [L62] char max2 ; [L63] _Bool mode2 ; [L64] _Bool newmax2 ; [L65] char id3 ; [L66] char r3 ; [L67] char st3 ; [L68] char nl3 ; [L69] char m3 ; [L70] char max3 ; [L71] _Bool mode3 ; [L72] _Bool newmax3 ; [L491] int c1 ; [L492] int i2 ; [L495] c1 = 0 [L496] ep12 = __VERIFIER_nondet_bool() [L497] ep13 = __VERIFIER_nondet_bool() [L498] ep21 = __VERIFIER_nondet_bool() [L499] ep23 = __VERIFIER_nondet_bool() [L500] ep31 = __VERIFIER_nondet_bool() [L501] ep32 = __VERIFIER_nondet_bool() [L502] id1 = __VERIFIER_nondet_char() [L503] r1 = __VERIFIER_nondet_char() [L504] st1 = __VERIFIER_nondet_char() [L505] nl1 = __VERIFIER_nondet_char() [L506] m1 = __VERIFIER_nondet_char() [L507] max1 = __VERIFIER_nondet_char() [L508] mode1 = __VERIFIER_nondet_bool() [L509] newmax1 = __VERIFIER_nondet_bool() [L510] id2 = __VERIFIER_nondet_char() [L511] r2 = __VERIFIER_nondet_char() [L512] st2 = __VERIFIER_nondet_char() [L513] nl2 = __VERIFIER_nondet_char() [L514] m2 = __VERIFIER_nondet_char() [L515] max2 = __VERIFIER_nondet_char() [L516] mode2 = __VERIFIER_nondet_bool() [L517] newmax2 = __VERIFIER_nondet_bool() [L518] id3 = __VERIFIER_nondet_char() [L519] r3 = __VERIFIER_nondet_char() [L520] st3 = __VERIFIER_nondet_char() [L521] nl3 = __VERIFIER_nondet_char() [L522] m3 = __VERIFIER_nondet_char() [L523] max3 = __VERIFIER_nondet_char() [L524] mode3 = __VERIFIER_nondet_bool() [L525] newmax3 = __VERIFIER_nondet_bool() [L526] CALL, EXPR init() [L228] _Bool r121 ; [L229] _Bool r131 ; [L230] _Bool r211 ; [L231] _Bool r231 ; [L232] _Bool r311 ; [L233] _Bool r321 ; [L234] _Bool r122 ; [L235] int tmp ; [L236] _Bool r132 ; [L237] int tmp___0 ; [L238] _Bool r212 ; [L239] int tmp___1 ; [L240] _Bool r232 ; [L241] int tmp___2 ; [L242] _Bool r312 ; [L243] int tmp___3 ; [L244] _Bool r322 ; [L245] int tmp___4 ; [L246] int tmp___5 ; [L249] r121 = ep12 [L250] r131 = ep13 [L251] r211 = ep21 [L252] r231 = ep23 [L253] r311 = ep31 [L254] r321 = ep32 [L255] COND FALSE !(\read(r121)) [L258] COND TRUE \read(r131) [L259] COND FALSE !(\read(ep32)) [L262] tmp = 0 [L267] r122 = (_Bool )tmp [L268] COND TRUE \read(r131) [L269] tmp___0 = 1 [L280] r132 = (_Bool )tmp___0 [L281] COND FALSE !(\read(r211)) [L284] COND FALSE !(\read(r231)) [L291] tmp___1 = 0 [L293] r212 = (_Bool )tmp___1 [L294] COND FALSE !(\read(r231)) [L297] COND FALSE !(\read(r211)) [L304] tmp___2 = 0 [L306] r232 = (_Bool )tmp___2 [L307] COND FALSE !(\read(r311)) [L310] COND FALSE !(\read(r321)) [L317] tmp___3 = 0 [L319] r312 = (_Bool )tmp___3 [L320] COND FALSE !(\read(r321)) [L323] COND FALSE !(\read(r311)) [L330] tmp___4 = 0 [L332] r322 = (_Bool )tmp___4 [L333] COND TRUE (int )id1 != (int )id2 [L334] COND TRUE (int )id1 != (int )id3 [L335] COND TRUE (int )id2 != (int )id3 [L336] COND TRUE (int )id1 >= 0 [L337] COND TRUE (int )id2 >= 0 [L338] COND TRUE (int )id3 >= 0 [L339] COND TRUE (int )r1 == 0 [L340] COND TRUE (int )r2 == 0 [L341] COND TRUE (int )r3 == 0 [L342] COND TRUE (int )max1 == (int )id1 [L343] COND TRUE (int )max2 == (int )id2 [L344] COND TRUE (int )max3 == (int )id3 [L345] COND TRUE (int )st1 == 0 [L346] COND TRUE (int )st2 == 0 [L347] COND TRUE (int )st3 == 0 [L348] COND TRUE (int )nl1 == 0 [L349] COND TRUE (int )nl2 == 0 [L350] COND TRUE (int )nl3 == 0 [L351] COND TRUE (int )mode1 == 0 [L352] COND TRUE (int )mode2 == 0 [L353] COND TRUE (int )mode3 == 0 [L354] COND TRUE \read(newmax1) [L355] COND TRUE \read(newmax2) [L356] COND TRUE \read(newmax3) [L357] tmp___5 = 1 [L430] return (tmp___5); [L526] RET, EXPR init() [L526] i2 = init() [L527] COND FALSE !(!(i2)) [L528] p12_old = nomsg [L529] p12_new = nomsg [L530] p13_old = nomsg [L531] p13_new = nomsg [L532] p21_old = nomsg [L533] p21_new = nomsg [L534] p23_old = nomsg [L535] p23_new = nomsg [L536] p31_old = nomsg [L537] p31_new = nomsg [L538] p32_old = nomsg [L539] p32_new = nomsg [L540] i2 = 0 VAL [c1=0, ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, i2=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L113] COND TRUE \read(ep13) [L114] COND TRUE \read(newmax1) [L115] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L119] mode1 = (_Bool)1 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND FALSE !(\read(mode2)) [L158] COND TRUE (int )r2 < 2 [L159] COND FALSE !(\read(ep21)) [L164] COND FALSE !(\read(ep23)) [L170] mode2 = (_Bool)1 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND FALSE !(\read(mode3)) [L209] COND TRUE (int )r3 < 2 [L210] COND FALSE !(\read(ep31)) [L215] COND FALSE !(\read(ep32)) [L221] mode3 = (_Bool)1 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [c1=1, ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, i2=1, id1=1, id2=2, id3=0, m1=2, m2=3, m3=0, max1=1, max2=2, max3=0, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND TRUE \read(mode1) [L80] r1 = (char )((int )r1 + 1) [L81] COND FALSE !(\read(ep21)) [L89] COND FALSE !(\read(ep31)) [L97] newmax1 = newmax [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND TRUE \read(mode2) [L131] r2 = (char )((int )r2 + 1) [L132] COND FALSE !(\read(ep12)) [L140] COND FALSE !(\read(ep32)) [L148] newmax2 = newmax [L149] COND FALSE !((int )r2 == 2) [L156] mode2 = (_Bool)0 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND TRUE \read(mode3) [L182] r3 = (char )((int )r3 + 1) [L183] COND TRUE \read(ep13) [L184] m3 = p13_old [L185] p13_old = nomsg [L186] COND TRUE (int )m3 > (int )max3 [L187] max3 = m3 [L188] newmax = (_Bool)1 [L191] COND FALSE !(\read(ep23)) [L199] newmax3 = newmax [L200] COND FALSE !((int )r3 == 2) [L207] mode3 = (_Bool)0 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [c1=1, ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, i2=2, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND FALSE !(\read(ep12)) [L113] COND TRUE \read(ep13) [L114] COND FALSE !(\read(newmax1)) [L119] mode1 = (_Bool)1 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND FALSE !(\read(mode2)) [L158] COND TRUE (int )r2 < 2 [L159] COND FALSE !(\read(ep21)) [L164] COND FALSE !(\read(ep23)) [L170] mode2 = (_Bool)1 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND FALSE !(\read(mode3)) [L209] COND TRUE (int )r3 < 2 [L210] COND FALSE !(\read(ep31)) [L215] COND FALSE !(\read(ep32)) [L221] mode3 = (_Bool)1 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L441] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L442] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )r1 < 2 [L458] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L559] RET assert(c1) [L560] i2 ++ VAL [c1=1, ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, i2=3, id1=1, id2=2, id3=0, m1=2, m2=3, m3=1, max1=1, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L541] COND TRUE i2 < 6 [L543] CALL node1() [L75] _Bool newmax ; [L78] newmax = (_Bool)0 [L79] COND TRUE \read(mode1) [L80] r1 = (char )((int )r1 + 1) [L81] COND FALSE !(\read(ep21)) [L89] COND FALSE !(\read(ep31)) [L97] newmax1 = newmax [L98] COND TRUE (int )r1 == 2 [L99] COND TRUE (int )max1 == (int )id1 [L100] st1 = (char)1 [L105] mode1 = (_Bool)0 [L543] RET node1() [L544] CALL node2() [L126] _Bool newmax ; [L129] newmax = (_Bool)0 [L130] COND TRUE \read(mode2) [L131] r2 = (char )((int )r2 + 1) [L132] COND FALSE !(\read(ep12)) [L140] COND FALSE !(\read(ep32)) [L148] newmax2 = newmax [L149] COND TRUE (int )r2 == 2 [L150] COND TRUE (int )max2 == (int )id2 [L151] st2 = (char)1 [L156] mode2 = (_Bool)0 [L544] RET node2() [L545] CALL node3() [L177] _Bool newmax ; [L180] newmax = (_Bool)0 [L181] COND TRUE \read(mode3) [L182] r3 = (char )((int )r3 + 1) [L183] COND TRUE \read(ep13) [L184] m3 = p13_old [L185] p13_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L191] COND FALSE !(\read(ep23)) [L199] newmax3 = newmax [L200] COND TRUE (int )r3 == 2 [L201] COND FALSE !((int )max3 == (int )id3) [L204] nl3 = (char)1 [L207] mode3 = (_Bool)0 [L545] RET node3() [L546] p12_old = p12_new [L547] p12_new = nomsg [L548] p13_old = p13_new [L549] p13_new = nomsg [L550] p21_old = p21_new [L551] p21_new = nomsg [L552] p23_old = p23_new [L553] p23_new = nomsg [L554] p31_old = p31_new [L555] p31_new = nomsg [L556] p32_old = p32_new [L557] p32_new = nomsg [L558] CALL, EXPR check() [L435] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L438] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L484] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0, tmp=0] [L486] return (tmp); [L558] RET, EXPR check() [L558] c1 = check() [L559] CALL assert(c1) [L571] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L573] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=1, id2=2, id3=0, m1=2, m2=3, m3=-1, max1=1, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory was 55.3MB in the beginning and 55.2MB in the end (delta: 100.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.18ms. Allocated memory is still 155.2MB. Free memory was 123.4MB in the beginning and 106.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.72ms. Allocated memory is still 155.2MB. Free memory was 106.6MB in the beginning and 103.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.85ms. Allocated memory is still 155.2MB. Free memory was 103.0MB in the beginning and 100.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1201.01ms. Allocated memory is still 155.2MB. Free memory was 100.9MB in the beginning and 83.5MB in the end (delta: 17.4MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * CodeCheck took 234258.09ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 83.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 795.3MB. Max. memory is 16.1GB. * Witness Printer took 140.83ms. Allocated memory is still 2.0GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-03 03:26:19,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38b3e2b7-e6fe-4980-b5d9-f3ad246dde19/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