./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/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_3231af40-d559-4140-add1-4c76056abb8c/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/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_3231af40-d559-4140-add1-4c76056abb8c/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 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 23:40:57,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 23:40:57,662 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-02 23:40:57,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 23:40:57,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-02 23:40:57,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 23:40:57,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 23:40:57,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-02 23:40:57,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 23:40:57,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 23:40:57,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 23:40:57,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 23:40:57,692 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 23:40:57,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 23:40:57,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 23:40:57,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 23:40:57,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 23:40:57,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 23:40:57,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 23:40:57,696 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 23:40:57,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 23:40:57,697 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 23:40:57,697 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-02 23:40:57,698 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-02 23:40:57,698 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-02 23:40:57,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 23:40:57,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 23:40:57,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 23:40:57,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 23:40:57,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 23:40:57,700 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-02 23:40:57,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 23:40:57,701 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 23:40:57,701 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_3231af40-d559-4140-add1-4c76056abb8c/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_3231af40-d559-4140-add1-4c76056abb8c/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 -> 588484d75150429774731f7aacf4daf77752c68fdc38fffa31465a5f910e2823 [2023-12-02 23:40:57,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 23:40:57,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 23:40:57,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 23:40:57,946 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 23:40:57,946 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 23:40:57,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2023-12-02 23:41:00,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 23:41:00,919 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 23:41:00,919 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c [2023-12-02 23:41:00,931 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/bin/ukojak-verify-Qdu7aM0XO9/data/2eca37b62/df38faabf70046cd9e92e672b34be1c1/FLAG4bbf184fe [2023-12-02 23:41:00,943 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/bin/ukojak-verify-Qdu7aM0XO9/data/2eca37b62/df38faabf70046cd9e92e672b34be1c1 [2023-12-02 23:41:00,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 23:41:00,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 23:41:00,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 23:41:00,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 23:41:00,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 23:41:00,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:41:00" (1/1) ... [2023-12-02 23:41:00,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5291aed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:41:00, skipping insertion in model container [2023-12-02 23:41:00,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:41:00" (1/1) ... [2023-12-02 23:41:00,998 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 23:41:01,192 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_3231af40-d559-4140-add1-4c76056abb8c/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2023-12-02 23:41:01,196 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 23:41:01,209 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 23:41:01,267 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_3231af40-d559-4140-add1-4c76056abb8c/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c[14511,14524] [2023-12-02 23:41:01,267 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 23:41:01,283 INFO L206 MainTranslator]: Completed translation [2023-12-02 23:41:01,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:41:01 WrapperNode [2023-12-02 23:41:01,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 23:41:01,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 23:41:01,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 23:41:01,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 23:41:01,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:41:01" (1/1) ... [2023-12-02 23:41:01,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:41:01" (1/1) ... [2023-12-02 23:41:01,338 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 484 [2023-12-02 23:41:01,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 23:41:01,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 23:41:01,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 23:41:01,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 23:41:01,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:41:01" (1/1) ... [2023-12-02 23:41:01,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:41:01" (1/1) ... [2023-12-02 23:41:01,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:41:01" (1/1) ... [2023-12-02 23:41:01,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:41:01" (1/1) ... [2023-12-02 23:41:01,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:41:01" (1/1) ... [2023-12-02 23:41:01,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:41:01" (1/1) ... [2023-12-02 23:41:01,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:41:01" (1/1) ... [2023-12-02 23:41:01,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:41:01" (1/1) ... [2023-12-02 23:41:01,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 23:41:01,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 23:41:01,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 23:41:01,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 23:41:01,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:41:01" (1/1) ... [2023-12-02 23:41:01,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 23:41:01,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-02 23:41:01,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-02 23:41:01,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-02 23:41:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 23:41:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 23:41:01,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 23:41:01,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 23:41:01,542 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 23:41:01,544 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 23:41:02,052 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 23:41:02,724 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 23:41:02,724 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 23:41:02,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:41:02 BoogieIcfgContainer [2023-12-02 23:41:02,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 23:41:02,727 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-02 23:41:02,727 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-02 23:41:02,737 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-02 23:41:02,737 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:41:02" (1/1) ... [2023-12-02 23:41:02,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 23:41:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2023-12-02 23:41:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2023-12-02 23:41:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 23:41:02,801 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:02,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2023-12-02 23:41:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2023-12-02 23:41:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 23:41:04,615 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:04,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2023-12-02 23:41:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2023-12-02 23:41:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 23:41:06,034 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:06,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2023-12-02 23:41:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2023-12-02 23:41:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 23:41:07,478 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:07,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:08,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:08,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2023-12-02 23:41:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2023-12-02 23:41:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 23:41:08,978 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:08,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2023-12-02 23:41:10,577 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2023-12-02 23:41:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 23:41:10,578 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:10,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:12,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:12,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2023-12-02 23:41:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2023-12-02 23:41:12,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 23:41:12,392 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:12,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2023-12-02 23:41:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2023-12-02 23:41:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 23:41:12,694 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2023-12-02 23:41:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2023-12-02 23:41:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 23:41:12,768 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 57 states and 97 transitions. [2023-12-02 23:41:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 97 transitions. [2023-12-02 23:41:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 23:41:15,545 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:15,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 60 states and 103 transitions. [2023-12-02 23:41:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2023-12-02 23:41:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 23:41:16,042 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:16,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 76 states and 135 transitions. [2023-12-02 23:41:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 135 transitions. [2023-12-02 23:41:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 23:41:22,561 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:22,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 90 states and 163 transitions. [2023-12-02 23:41:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 163 transitions. [2023-12-02 23:41:26,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 23:41:26,819 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 91 states and 166 transitions. [2023-12-02 23:41:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 166 transitions. [2023-12-02 23:41:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 23:41:28,147 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:28,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 105 states and 196 transitions. [2023-12-02 23:41:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 196 transitions. [2023-12-02 23:41:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 23:41:33,021 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:33,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 108 states and 204 transitions. [2023-12-02 23:41:35,221 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 204 transitions. [2023-12-02 23:41:35,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 23:41:35,222 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:35,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 109 states and 205 transitions. [2023-12-02 23:41:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 205 transitions. [2023-12-02 23:41:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 23:41:36,376 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:36,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 110 states and 209 transitions. [2023-12-02 23:41:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 209 transitions. [2023-12-02 23:41:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 23:41:37,692 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:37,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 124 states and 240 transitions. [2023-12-02 23:41:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 240 transitions. [2023-12-02 23:41:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 23:41:43,806 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:43,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:46,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 128 states and 256 transitions. [2023-12-02 23:41:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 256 transitions. [2023-12-02 23:41:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 23:41:46,775 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 129 states and 258 transitions. [2023-12-02 23:41:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 258 transitions. [2023-12-02 23:41:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 23:41:48,037 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 131 states and 262 transitions. [2023-12-02 23:41:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 262 transitions. [2023-12-02 23:41:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 23:41:49,770 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:49,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:51,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 132 states and 263 transitions. [2023-12-02 23:41:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 263 transitions. [2023-12-02 23:41:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 23:41:51,075 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:51,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 133 states and 264 transitions. [2023-12-02 23:41:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 264 transitions. [2023-12-02 23:41:52,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 23:41:52,464 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:52,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:53,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 134 states and 268 transitions. [2023-12-02 23:41:53,867 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 268 transitions. [2023-12-02 23:41:53,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 23:41:53,867 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:53,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:41:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:41:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 135 states and 273 transitions. [2023-12-02 23:41:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 273 transitions. [2023-12-02 23:41:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:41:55,225 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:41:55,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:41:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:41:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:42:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:42:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 149 states and 304 transitions. [2023-12-02 23:42:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 304 transitions. [2023-12-02 23:42:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:42:03,116 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:42:03,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:42:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:42:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:42:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:42:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 153 states and 316 transitions. [2023-12-02 23:42:07,168 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 316 transitions. [2023-12-02 23:42:07,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:42:07,168 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:42:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:42:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:42:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:42:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:42:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 154 states and 319 transitions. [2023-12-02 23:42:09,658 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 319 transitions. [2023-12-02 23:42:09,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:42:09,658 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:42:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:42:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:42:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:42:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:42:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 157 states and 324 transitions. [2023-12-02 23:42:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 324 transitions. [2023-12-02 23:42:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:42:12,840 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:42:12,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:42:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:42:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:42:17,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:42:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 159 states and 332 transitions. [2023-12-02 23:42:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 332 transitions. [2023-12-02 23:42:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:42:17,113 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:42:17,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:42:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:42:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:42:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:42:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 162 states and 348 transitions. [2023-12-02 23:42:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 348 transitions. [2023-12-02 23:42:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 23:42:22,174 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:42:22,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:42:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:42:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:42:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:42:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 163 states and 349 transitions. [2023-12-02 23:42:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 349 transitions. [2023-12-02 23:42:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 23:42:24,508 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:42:24,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:42:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:42:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:42:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:42:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 177 states and 374 transitions. [2023-12-02 23:42:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 374 transitions. [2023-12-02 23:42:29,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 23:42:29,775 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:42:29,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:42:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:42:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:42:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:42:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 182 states and 383 transitions. [2023-12-02 23:42:35,142 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 383 transitions. [2023-12-02 23:42:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 23:42:35,142 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:42:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:42:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:42:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:42:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:42:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 196 states and 438 transitions. [2023-12-02 23:42:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 438 transitions. [2023-12-02 23:42:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 23:42:46,065 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:42:46,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:42:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:42:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:42:56,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:42:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 205 states and 459 transitions. [2023-12-02 23:42:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 459 transitions. [2023-12-02 23:42:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 23:42:56,583 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:42:56,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:42:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:42:58,479 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-02 23:43:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 215 states and 478 transitions. [2023-12-02 23:43:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 478 transitions. [2023-12-02 23:43:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 23:43:05,599 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:05,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 226 states and 502 transitions. [2023-12-02 23:43:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 502 transitions. [2023-12-02 23:43:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 23:43:18,617 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:18,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:20,723 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-02 23:43:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 229 states and 511 transitions. [2023-12-02 23:43:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 511 transitions. [2023-12-02 23:43:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 23:43:24,006 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:24,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:25,603 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 230 states and 516 transitions. [2023-12-02 23:43:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 516 transitions. [2023-12-02 23:43:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 23:43:26,806 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:26,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:31,140 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-02 23:43:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 234 states and 526 transitions. [2023-12-02 23:43:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 526 transitions. [2023-12-02 23:43:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 23:43:37,744 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:37,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:39,491 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-02 23:43:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 236 states and 534 transitions. [2023-12-02 23:43:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 534 transitions. [2023-12-02 23:43:41,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 23:43:41,725 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:41,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 237 states and 539 transitions. [2023-12-02 23:43:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 539 transitions. [2023-12-02 23:43:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 23:43:43,735 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:43,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 241 states and 548 transitions. [2023-12-02 23:43:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 548 transitions. [2023-12-02 23:43:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 23:43:55,610 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:55,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 255 states and 579 transitions. [2023-12-02 23:44:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 579 transitions. [2023-12-02 23:44:05,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 23:44:05,783 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:05,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 264 states and 595 transitions. [2023-12-02 23:44:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 595 transitions. [2023-12-02 23:44:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 23:44:18,491 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:18,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 265 states and 600 transitions. [2023-12-02 23:44:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 600 transitions. [2023-12-02 23:44:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 23:44:20,843 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:20,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 266 states and 605 transitions. [2023-12-02 23:44:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 605 transitions. [2023-12-02 23:44:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 23:44:22,924 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:22,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 270 states and 621 transitions. [2023-12-02 23:44:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 621 transitions. [2023-12-02 23:44:33,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 23:44:33,918 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:33,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 273 states and 630 transitions. [2023-12-02 23:44:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 630 transitions. [2023-12-02 23:44:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 23:44:38,928 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:38,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 282 states and 650 transitions. [2023-12-02 23:44:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 650 transitions. [2023-12-02 23:44:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 23:44:52,726 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:52,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:56,821 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-02 23:45:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 285 states and 658 transitions. [2023-12-02 23:45:02,544 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 658 transitions. [2023-12-02 23:45:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 23:45:02,545 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:02,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:45:03,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 23:45:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:45:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:45:04,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 23:45:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:45:04,474 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 53 iterations. [2023-12-02 23:45:04,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 11:45:04 ImpRootNode [2023-12-02 23:45:04,592 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-02 23:45:04,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 23:45:04,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 23:45:04,593 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 23:45:04,594 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:41:02" (3/4) ... [2023-12-02 23:45:04,594 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 23:45:04,712 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-02 23:45:04,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 23:45:04,713 INFO L158 Benchmark]: Toolchain (without parser) took 243765.35ms. Allocated memory was 163.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 128.4MB in the beginning and 1.1GB in the end (delta: -943.6MB). Peak memory consumption was 506.3MB. Max. memory is 16.1GB. [2023-12-02 23:45:04,713 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 23:45:04,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.25ms. Allocated memory is still 163.6MB. Free memory was 128.0MB in the beginning and 110.7MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 23:45:04,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.09ms. Allocated memory is still 163.6MB. Free memory was 110.7MB in the beginning and 107.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 23:45:04,713 INFO L158 Benchmark]: Boogie Preprocessor took 39.57ms. Allocated memory is still 163.6MB. Free memory was 107.0MB in the beginning and 104.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 23:45:04,714 INFO L158 Benchmark]: RCFGBuilder took 1347.14ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 104.4MB in the beginning and 107.9MB in the end (delta: -3.5MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2023-12-02 23:45:04,714 INFO L158 Benchmark]: CodeCheck took 241865.06ms. Allocated memory was 197.1MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 107.9MB in the beginning and 1.1GB in the end (delta: -980.8MB). Peak memory consumption was 435.8MB. Max. memory is 16.1GB. [2023-12-02 23:45:04,714 INFO L158 Benchmark]: Witness Printer took 119.29ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 23:45:04,716 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: 241.7s, OverallIterations: 53, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17341 SdHoareTripleChecker+Valid, 131.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15581 mSDsluCounter, 4640 SdHoareTripleChecker+Invalid, 120.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3794 mSDsCounter, 6943 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50478 IncrementalHoareTripleChecker+Invalid, 57421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6943 mSolverCounterUnsat, 846 mSDtfsCounter, 50478 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13679 GetRequests, 11906 SyntacticMatches, 703 SemanticMatches, 1070 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700924 ImplicationChecksByTransitivity, 172.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 83.0s InterpolantComputationTime, 1387 NumberOfCodeBlocks, 1387 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1287 ConstructedInterpolants, 0 QuantifiedInterpolants, 15046 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 10 PerfectInterpolantSequences, 132/682 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: 609]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L528] int c1 ; [L529] int i2 ; [L532] c1 = 0 [L533] ep12 = __VERIFIER_nondet_bool() [L534] ep13 = __VERIFIER_nondet_bool() [L535] ep21 = __VERIFIER_nondet_bool() [L536] ep23 = __VERIFIER_nondet_bool() [L537] ep31 = __VERIFIER_nondet_bool() [L538] ep32 = __VERIFIER_nondet_bool() [L539] id1 = __VERIFIER_nondet_char() [L540] r1 = __VERIFIER_nondet_uchar() [L541] st1 = __VERIFIER_nondet_char() [L542] nl1 = __VERIFIER_nondet_char() [L543] m1 = __VERIFIER_nondet_char() [L544] max1 = __VERIFIER_nondet_char() [L545] mode1 = __VERIFIER_nondet_bool() [L546] newmax1 = __VERIFIER_nondet_bool() [L547] id2 = __VERIFIER_nondet_char() [L548] r2 = __VERIFIER_nondet_uchar() [L549] st2 = __VERIFIER_nondet_char() [L550] nl2 = __VERIFIER_nondet_char() [L551] m2 = __VERIFIER_nondet_char() [L552] max2 = __VERIFIER_nondet_char() [L553] mode2 = __VERIFIER_nondet_bool() [L554] newmax2 = __VERIFIER_nondet_bool() [L555] id3 = __VERIFIER_nondet_char() [L556] r3 = __VERIFIER_nondet_uchar() [L557] st3 = __VERIFIER_nondet_char() [L558] nl3 = __VERIFIER_nondet_char() [L559] m3 = __VERIFIER_nondet_char() [L560] max3 = __VERIFIER_nondet_char() [L561] mode3 = __VERIFIER_nondet_bool() [L562] newmax3 = __VERIFIER_nondet_bool() [L563] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND FALSE !(\read(r121)) [L271] COND TRUE \read(r131) [L272] COND TRUE \read(ep32) [L273] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND TRUE \read(r131) [L282] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND TRUE \read(r231) [L298] COND TRUE \read(ep31) [L299] tmp___1 = 1 [L306] r212 = (_Bool )tmp___1 [L307] COND TRUE \read(r231) [L308] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND TRUE \read(r311) [L321] tmp___3 = 1 [L332] r312 = (_Bool )tmp___3 [L333] COND TRUE \read(r321) [L334] tmp___4 = 1 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE \read(r122) [L356] COND TRUE \read(r132) [L357] COND TRUE \read(r212) [L358] COND TRUE \read(r232) [L359] COND TRUE \read(r312) [L360] COND TRUE \read(r322) [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] COND TRUE \read(newmax1) [L374] COND TRUE \read(newmax2) [L375] COND TRUE \read(newmax3) [L376] tmp___5 = 1 [L467] return (tmp___5); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) [L565] p12_old = nomsg [L566] p12_new = nomsg [L567] p13_old = nomsg [L568] p13_new = nomsg [L569] p21_old = nomsg [L570] p21_new = nomsg [L571] p23_old = nomsg [L572] p23_new = nomsg [L573] p31_old = nomsg [L574] p31_new = nomsg [L575] p32_old = nomsg [L576] p32_new = nomsg [L577] i2 = 0 VAL [c1=0, ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, i2=0, id1=125, id2=126, id3=127, m1=127, m2=126, m3=124, max1=125, max2=126, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND TRUE \read(newmax3) [L225] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L228] COND TRUE \read(ep32) [L229] COND TRUE \read(newmax3) [L230] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=126, m3=124, max1=125, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=126, m3=124, max1=125, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=126, m3=124, max1=125, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=126, m3=124, max1=125, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=126, m3=124, max1=125, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=126, m3=124, max1=125, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=126, m3=124, max1=125, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=126, m3=124, max1=125, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=126, m3=124, max1=125, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=126, m3=124, max1=125, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=126, m3=124, max1=125, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=126, m3=124, max1=125, max2=126, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=125, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=126, p31=0, p31_new=-1, p31_old=127, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND TRUE (int )m1 > (int )max1 [L100] max1 = m1 [L101] newmax = (_Bool)1 [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND TRUE (int )m2 > (int )max2 [L154] max2 = m2 [L155] newmax = (_Bool)1 [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND TRUE \read(ep13) [L121] COND TRUE \read(newmax1) [L122] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L126] mode1 = (_Bool)1 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND TRUE \read(ep23) [L175] COND TRUE \read(newmax2) [L176] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L180] mode2 = (_Bool)1 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND TRUE \read(ep31) [L224] COND FALSE !(\read(newmax3)) [L228] COND TRUE \read(ep32) [L229] COND FALSE !(\read(newmax3)) [L234] mode3 = (_Bool)1 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L475] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L477] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L489] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L492] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE (int )r1 < 2 [L495] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=127, m2=127, m3=126, max1=127, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L596] RET assert(c1) [L578] COND TRUE 1 [L580] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND TRUE \read(ep31) [L97] m1 = p31_old [L98] p31_old = nomsg [L99] COND FALSE !((int )m1 > (int )max1) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND FALSE !((int )max1 == (int )id1) [L109] st1 = (char)1 [L112] mode1 = (_Bool)0 [L580] RET node1() [L581] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND TRUE \read(ep32) [L151] m2 = p32_old [L152] p32_old = nomsg [L153] COND FALSE !((int )m2 > (int )max2) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND FALSE !((int )max2 == (int )id2) [L163] nl2 = (char)1 [L166] mode2 = (_Bool)0 [L581] RET node2() [L582] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND TRUE \read(ep13) [L197] m3 = p13_old [L198] p13_old = nomsg [L199] COND FALSE !((int )m3 > (int )max3) [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND FALSE !((int )m3 > (int )max3) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [L582] RET node3() [L583] p12_old = p12_new [L584] p12_new = nomsg [L585] p13_old = p13_new [L586] p13_new = nomsg [L587] p21_old = p21_new [L588] p21_new = nomsg [L589] p23_old = p23_new [L590] p23_new = nomsg [L591] p31_old = p31_new [L592] p31_new = nomsg [L593] p32_old = p32_new [L594] p32_new = nomsg [L595] CALL, EXPR check() [L472] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=-1, m2=-1, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L475] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L521] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=-1, m2=-1, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1, tmp=0] [L523] return (tmp); [L595] RET, EXPR check() [L595] c1 = check() [L596] CALL assert(c1) [L607] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=-1, m2=-1, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L609] reach_error() VAL [\old(arg)=0, arg=0, ep12=0, ep13=1, ep21=0, ep23=1, ep31=1, ep32=1, id1=125, id2=126, id3=127, m1=-1, m2=-1, m3=127, max1=127, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.25ms. Allocated memory is still 163.6MB. Free memory was 128.0MB in the beginning and 110.7MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.09ms. Allocated memory is still 163.6MB. Free memory was 110.7MB in the beginning and 107.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.57ms. Allocated memory is still 163.6MB. Free memory was 107.0MB in the beginning and 104.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1347.14ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 104.4MB in the beginning and 107.9MB in the end (delta: -3.5MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. * CodeCheck took 241865.06ms. Allocated memory was 197.1MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 107.9MB in the beginning and 1.1GB in the end (delta: -980.8MB). Peak memory consumption was 435.8MB. Max. memory is 16.1GB. * Witness Printer took 119.29ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-02 23:45:04,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3231af40-d559-4140-add1-4c76056abb8c/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