./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/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_6f0a574d-55cb-4d1e-9166-594607524f8f/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/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_6f0a574d-55cb-4d1e-9166-594607524f8f/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 a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-03 02:05:36,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-03 02:05:36,868 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-03 02:05:36,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-03 02:05:36,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-03 02:05:36,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-03 02:05:36,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-03 02:05:36,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-03 02:05:36,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-03 02:05:36,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-03 02:05:36,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-03 02:05:36,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-03 02:05:36,903 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-03 02:05:36,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-03 02:05:36,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-03 02:05:36,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-03 02:05:36,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-03 02:05:36,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-03 02:05:36,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-03 02:05:36,906 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-03 02:05:36,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-03 02:05:36,912 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-03 02:05:36,913 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-03 02:05:36,913 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-03 02:05:36,913 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-03 02:05:36,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-03 02:05:36,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 02:05:36,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-03 02:05:36,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-03 02:05:36,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-03 02:05:36,916 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-03 02:05:36,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-03 02:05:36,917 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-03 02:05:36,917 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_6f0a574d-55cb-4d1e-9166-594607524f8f/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_6f0a574d-55cb-4d1e-9166-594607524f8f/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 -> a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec [2023-12-03 02:05:37,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-03 02:05:37,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-03 02:05:37,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-03 02:05:37,180 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-03 02:05:37,180 INFO L274 PluginConnector]: CDTParser initialized [2023-12-03 02:05:37,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2023-12-03 02:05:40,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-03 02:05:40,402 INFO L384 CDTParser]: Found 1 translation units. [2023-12-03 02:05:40,403 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2023-12-03 02:05:40,417 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/bin/ukojak-verify-Qdu7aM0XO9/data/8a3fd5a8d/3c0133077ac5496596082a16c275101d/FLAG41dbbe467 [2023-12-03 02:05:40,734 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/bin/ukojak-verify-Qdu7aM0XO9/data/8a3fd5a8d/3c0133077ac5496596082a16c275101d [2023-12-03 02:05:40,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-03 02:05:40,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-03 02:05:40,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-03 02:05:40,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-03 02:05:40,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-03 02:05:40,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:05:40" (1/1) ... [2023-12-03 02:05:40,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f508dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:05:40, skipping insertion in model container [2023-12-03 02:05:40,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:05:40" (1/1) ... [2023-12-03 02:05:40,794 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-03 02:05:41,027 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_6f0a574d-55cb-4d1e-9166-594607524f8f/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2023-12-03 02:05:41,032 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 02:05:41,047 INFO L202 MainTranslator]: Completed pre-run [2023-12-03 02:05:41,112 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_6f0a574d-55cb-4d1e-9166-594607524f8f/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2023-12-03 02:05:41,113 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 02:05:41,132 INFO L206 MainTranslator]: Completed translation [2023-12-03 02:05:41,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:05:41 WrapperNode [2023-12-03 02:05:41,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-03 02:05:41,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-03 02:05:41,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-03 02:05:41,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-03 02:05:41,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:05:41" (1/1) ... [2023-12-03 02:05:41,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:05:41" (1/1) ... [2023-12-03 02:05:41,198 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 472 [2023-12-03 02:05:41,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-03 02:05:41,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-03 02:05:41,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-03 02:05:41,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-03 02:05:41,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:05:41" (1/1) ... [2023-12-03 02:05:41,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:05:41" (1/1) ... [2023-12-03 02:05:41,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:05:41" (1/1) ... [2023-12-03 02:05:41,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:05:41" (1/1) ... [2023-12-03 02:05:41,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:05:41" (1/1) ... [2023-12-03 02:05:41,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:05:41" (1/1) ... [2023-12-03 02:05:41,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:05:41" (1/1) ... [2023-12-03 02:05:41,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:05:41" (1/1) ... [2023-12-03 02:05:41,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-03 02:05:41,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-03 02:05:41,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-03 02:05:41,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-03 02:05:41,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:05:41" (1/1) ... [2023-12-03 02:05:41,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 02:05:41,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-03 02:05:41,291 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-03 02:05:41,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-03 02:05:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-03 02:05:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-03 02:05:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-03 02:05:41,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-03 02:05:41,462 INFO L241 CfgBuilder]: Building ICFG [2023-12-03 02:05:41,465 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-03 02:05:42,020 INFO L282 CfgBuilder]: Performing block encoding [2023-12-03 02:05:42,568 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-03 02:05:42,568 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-03 02:05:42,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:05:42 BoogieIcfgContainer [2023-12-03 02:05:42,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-03 02:05:42,571 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-03 02:05:42,571 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-03 02:05:42,580 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-03 02:05:42,580 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:05:42" (1/1) ... [2023-12-03 02:05:42,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-03 02:05:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:05:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2023-12-03 02:05:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2023-12-03 02:05:42,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-03 02:05:42,643 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:05:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:05:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:05:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:05:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:05:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2023-12-03 02:05:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2023-12-03 02:05:44,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-03 02:05:44,318 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:05:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:05:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:05:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:05:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:05:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2023-12-03 02:05:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2023-12-03 02:05:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-03 02:05:45,599 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:05:45,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:05:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:05:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:05:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:05:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2023-12-03 02:05:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2023-12-03 02:05:46,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-03 02:05:46,738 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:05:46,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:05:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:05:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:05:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:05:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 32 states and 55 transitions. [2023-12-03 02:05:48,071 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 55 transitions. [2023-12-03 02:05:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-03 02:05:48,072 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:05:48,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:05:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:05:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:05:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:05:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2023-12-03 02:05:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2023-12-03 02:05:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-03 02:05:49,826 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:05:49,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:05:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:05:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:05:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:05:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2023-12-03 02:05:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2023-12-03 02:05:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-03 02:05:51,761 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:05:51,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:05:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:05:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:05:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:05:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 46 states and 80 transitions. [2023-12-03 02:05:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 80 transitions. [2023-12-03 02:05:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-03 02:05:52,099 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:05:52,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:05:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:05:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:05:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:05:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 53 states and 93 transitions. [2023-12-03 02:05:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 93 transitions. [2023-12-03 02:05:54,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-03 02:05:54,180 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:05:54,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:05:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:05:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:05:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:05:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2023-12-03 02:05:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2023-12-03 02:05:54,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-03 02:05:54,317 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:05:54,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:05:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:05:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:05:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:05:54,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 57 states and 100 transitions. [2023-12-03 02:05:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 100 transitions. [2023-12-03 02:05:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-03 02:05:54,836 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:05:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:05:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:05:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 73 states and 131 transitions. [2023-12-03 02:06:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 131 transitions. [2023-12-03 02:06:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-03 02:06:01,497 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:01,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 87 states and 160 transitions. [2023-12-03 02:06:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 160 transitions. [2023-12-03 02:06:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-03 02:06:06,059 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 88 states and 161 transitions. [2023-12-03 02:06:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2023-12-03 02:06:07,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-03 02:06:07,726 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:07,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 96 states and 184 transitions. [2023-12-03 02:06:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 184 transitions. [2023-12-03 02:06:11,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-03 02:06:11,081 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 99 states and 195 transitions. [2023-12-03 02:06:13,236 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 195 transitions. [2023-12-03 02:06:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-03 02:06:13,237 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:13,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 102 states and 205 transitions. [2023-12-03 02:06:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 205 transitions. [2023-12-03 02:06:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-03 02:06:15,526 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:15,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 110 states and 232 transitions. [2023-12-03 02:06:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 232 transitions. [2023-12-03 02:06:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-03 02:06:19,704 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:19,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 113 states and 244 transitions. [2023-12-03 02:06:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 244 transitions. [2023-12-03 02:06:22,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-03 02:06:22,202 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 116 states and 256 transitions. [2023-12-03 02:06:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 256 transitions. [2023-12-03 02:06:24,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-03 02:06:24,435 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:24,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 124 states and 281 transitions. [2023-12-03 02:06:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 281 transitions. [2023-12-03 02:06:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-03 02:06:31,331 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:31,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 136 states and 306 transitions. [2023-12-03 02:06:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 306 transitions. [2023-12-03 02:06:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-03 02:06:37,826 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:37,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 138 states and 310 transitions. [2023-12-03 02:06:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 310 transitions. [2023-12-03 02:06:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-03 02:06:41,373 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:41,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:45,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 140 states and 316 transitions. [2023-12-03 02:06:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 316 transitions. [2023-12-03 02:06:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-03 02:06:45,937 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:51,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 154 states and 340 transitions. [2023-12-03 02:06:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 340 transitions. [2023-12-03 02:06:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-03 02:06:51,108 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:51,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:06:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:06:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 157 states and 344 transitions. [2023-12-03 02:06:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 344 transitions. [2023-12-03 02:06:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-03 02:06:55,222 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:06:55,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:06:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:06:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:07:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:07:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 172 states and 397 transitions. [2023-12-03 02:07:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 397 transitions. [2023-12-03 02:07:07,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-03 02:07:07,932 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:07:07,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:07:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:07:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:07:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:07:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 185 states and 437 transitions. [2023-12-03 02:07:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 437 transitions. [2023-12-03 02:07:16,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-03 02:07:16,587 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:07:16,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:07:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:07:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:07:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:07:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 188 states and 448 transitions. [2023-12-03 02:07:21,411 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 448 transitions. [2023-12-03 02:07:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-03 02:07:21,412 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:07:21,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:07:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:07:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:07:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:07:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 203 states and 479 transitions. [2023-12-03 02:07:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 479 transitions. [2023-12-03 02:07:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-03 02:07:38,211 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:07:38,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:07:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:07:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:07:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:07:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 211 states and 501 transitions. [2023-12-03 02:07:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 501 transitions. [2023-12-03 02:07:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-03 02:07:50,357 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:07:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:07:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:07:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:07:57,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:07:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 217 states and 509 transitions. [2023-12-03 02:07:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 509 transitions. [2023-12-03 02:07:57,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-03 02:07:57,198 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:07:57,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:07:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:08:00,069 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-03 02:08:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:08:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 224 states and 525 transitions. [2023-12-03 02:08:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 525 transitions. [2023-12-03 02:08:07,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-03 02:08:07,575 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:08:07,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:08:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:08:08,959 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-03 02:08:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:08:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 229 states and 542 transitions. [2023-12-03 02:08:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 542 transitions. [2023-12-03 02:08:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-03 02:08:14,079 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:08:14,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:08:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:08:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:08:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:08:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 239 states and 562 transitions. [2023-12-03 02:08:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 562 transitions. [2023-12-03 02:08:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-03 02:08:26,435 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:08:26,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:08:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:08:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:08:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:08:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 248 states and 575 transitions. [2023-12-03 02:08:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 575 transitions. [2023-12-03 02:08:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-03 02:08:32,119 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:08:32,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:08:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 02:08:32,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 02:08:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 02:08:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 02:08:33,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 02:08:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 02:08:33,751 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 36 iterations. [2023-12-03 02:08:33,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 03.12 02:08:33 ImpRootNode [2023-12-03 02:08:33,871 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-03 02:08:33,872 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-03 02:08:33,872 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-03 02:08:33,872 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-03 02:08:33,873 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:05:42" (3/4) ... [2023-12-03 02:08:33,874 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-03 02:08:34,014 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-03 02:08:34,014 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-03 02:08:34,014 INFO L158 Benchmark]: Toolchain (without parser) took 173275.65ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 78.5MB in the beginning and 969.2MB in the end (delta: -890.7MB). Peak memory consumption was 531.4MB. Max. memory is 16.1GB. [2023-12-03 02:08:34,015 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-03 02:08:34,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.33ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 61.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-03 02:08:34,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.04ms. Allocated memory is still 117.4MB. Free memory was 60.9MB in the beginning and 57.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-03 02:08:34,016 INFO L158 Benchmark]: Boogie Preprocessor took 54.46ms. Allocated memory is still 117.4MB. Free memory was 57.7MB in the beginning and 55.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-03 02:08:34,016 INFO L158 Benchmark]: RCFGBuilder took 1315.98ms. Allocated memory was 117.4MB in the beginning and 186.6MB in the end (delta: 69.2MB). Free memory was 54.9MB in the beginning and 88.8MB in the end (delta: -33.9MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2023-12-03 02:08:34,017 INFO L158 Benchmark]: CodeCheck took 171300.21ms. Allocated memory was 186.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 88.8MB in the beginning and 986.0MB in the end (delta: -897.2MB). Peak memory consumption was 456.5MB. Max. memory is 16.1GB. [2023-12-03 02:08:34,017 INFO L158 Benchmark]: Witness Printer took 141.91ms. Allocated memory is still 1.5GB. Free memory was 986.0MB in the beginning and 969.2MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-03 02:08:34,019 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: 171.2s, OverallIterations: 36, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8817 SdHoareTripleChecker+Valid, 70.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7588 mSDsluCounter, 2555 SdHoareTripleChecker+Invalid, 64.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1914 mSDsCounter, 3525 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26221 IncrementalHoareTripleChecker+Invalid, 29746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3525 mSolverCounterUnsat, 641 mSDtfsCounter, 26221 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8645 GetRequests, 7393 SyntacticMatches, 434 SemanticMatches, 818 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401433 ImplicationChecksByTransitivity, 120.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 56.7s InterpolantComputationTime, 876 NumberOfCodeBlocks, 876 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 793 ConstructedInterpolants, 0 QuantifiedInterpolants, 11940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 10 PerfectInterpolantSequences, 77/384 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: 585]: 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 ; [L504] int c1 ; [L505] int i2 ; [L508] c1 = 0 [L509] ep12 = __VERIFIER_nondet_bool() [L510] ep13 = __VERIFIER_nondet_bool() [L511] ep21 = __VERIFIER_nondet_bool() [L512] ep23 = __VERIFIER_nondet_bool() [L513] ep31 = __VERIFIER_nondet_bool() [L514] ep32 = __VERIFIER_nondet_bool() [L515] id1 = __VERIFIER_nondet_char() [L516] r1 = __VERIFIER_nondet_uchar() [L517] st1 = __VERIFIER_nondet_char() [L518] nl1 = __VERIFIER_nondet_char() [L519] m1 = __VERIFIER_nondet_char() [L520] max1 = __VERIFIER_nondet_char() [L521] mode1 = __VERIFIER_nondet_bool() [L522] newmax1 = __VERIFIER_nondet_bool() [L523] id2 = __VERIFIER_nondet_char() [L524] r2 = __VERIFIER_nondet_uchar() [L525] st2 = __VERIFIER_nondet_char() [L526] nl2 = __VERIFIER_nondet_char() [L527] m2 = __VERIFIER_nondet_char() [L528] max2 = __VERIFIER_nondet_char() [L529] mode2 = __VERIFIER_nondet_bool() [L530] newmax2 = __VERIFIER_nondet_bool() [L531] id3 = __VERIFIER_nondet_char() [L532] r3 = __VERIFIER_nondet_uchar() [L533] st3 = __VERIFIER_nondet_char() [L534] nl3 = __VERIFIER_nondet_char() [L535] m3 = __VERIFIER_nondet_char() [L536] max3 = __VERIFIER_nondet_char() [L537] mode3 = __VERIFIER_nondet_bool() [L538] newmax3 = __VERIFIER_nondet_bool() [L539] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND TRUE \read(r121) [L269] tmp = 1 [L280] r122 = (_Bool )tmp [L281] COND TRUE \read(r131) [L282] tmp___0 = 1 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND TRUE \read(r231) [L298] COND FALSE !(\read(ep31)) [L301] tmp___1 = 0 [L306] r212 = (_Bool )tmp___1 [L307] COND TRUE \read(r231) [L308] tmp___2 = 1 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND FALSE !(\read(r321)) [L330] tmp___3 = 0 [L332] r312 = (_Bool )tmp___3 [L333] COND FALSE !(\read(r321)) [L336] COND FALSE !(\read(r311)) [L343] tmp___4 = 0 [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 (int )max1 == (int )id1 [L356] COND TRUE (int )max2 == (int )id2 [L357] COND TRUE (int )max3 == (int )id3 [L358] COND TRUE (int )st1 == 0 [L359] COND TRUE (int )st2 == 0 [L360] COND TRUE (int )st3 == 0 [L361] COND TRUE (int )nl1 == 0 [L362] COND TRUE (int )nl2 == 0 [L363] COND TRUE (int )nl3 == 0 [L364] COND TRUE (int )mode1 == 0 [L365] COND TRUE (int )mode2 == 0 [L366] COND TRUE (int )mode3 == 0 [L367] COND TRUE \read(newmax1) [L368] COND TRUE \read(newmax2) [L369] COND TRUE \read(newmax3) [L370] tmp___5 = 1 [L443] return (tmp___5); [L539] RET, EXPR init() [L539] i2 = init() [L540] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L540] RET assume_abort_if_not(i2) [L541] p12_old = nomsg [L542] p12_new = nomsg [L543] p13_old = nomsg [L544] p13_new = nomsg [L545] p21_old = nomsg [L546] p21_new = nomsg [L547] p23_old = nomsg [L548] p23_new = nomsg [L549] p31_old = nomsg [L550] p31_new = nomsg [L551] p32_old = nomsg [L552] p32_new = nomsg [L553] i2 = 0 VAL [c1=0, ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, i2=0, id1=125, id2=127, id3=124, m1=126, m2=0, m3=-2, max1=125, max2=127, max3=124, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND TRUE \read(newmax1) [L117] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [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 [L556] RET node1() [L557] 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 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=0, m3=-2, max1=125, max2=127, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=0, m3=-2, max1=125, max2=127, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=0, m3=-2, max1=125, max2=127, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=0, m3=-2, max1=125, max2=127, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=0, m3=-2, max1=125, max2=127, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=0, m3=-2, max1=125, max2=127, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=0, m3=-2, max1=125, max2=127, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L460] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=0, m3=-2, max1=125, max2=127, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=0, m3=-2, max1=125, max2=127, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=0, m3=-2, max1=125, max2=127, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=0, m3=-2, max1=125, max2=127, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=0, m3=-2, max1=125, max2=127, max3=124, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=1, newmax3=255, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=125, p13=0, p13_new=-1, p13_old=125, 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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] 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 FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] 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 TRUE (int )m3 > (int )max3 [L200] max3 = m3 [L201] newmax = (_Bool)1 [L204] COND TRUE \read(ep23) [L205] m3 = p23_old [L206] p23_old = nomsg [L207] COND TRUE (int )m3 > (int )max3 [L208] max3 = m3 [L209] newmax = (_Bool)1 [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L460] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND TRUE \read(ep12) [L116] COND FALSE !(\read(newmax1)) [L120] COND TRUE \read(ep13) [L121] COND FALSE !(\read(newmax1)) [L126] mode1 = (_Bool)1 [L556] RET node1() [L557] 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 FALSE !(\read(newmax2)) [L180] mode2 = (_Bool)1 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L460] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=125, m3=127, max1=125, max2=127, max3=127, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L572] RET assert(c1) [L554] COND TRUE 1 [L556] 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 FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND TRUE (int )max1 == (int )id1 [L107] st1 = (char)1 [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND TRUE \read(ep12) [L143] m2 = p12_old [L144] p12_old = nomsg [L145] COND FALSE !((int )m2 > (int )max2) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (char)1 [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] 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 FALSE !((int )max3 == (int )id3) [L217] nl3 = (char)1 [L220] mode3 = (_Bool)0 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=-1, m3=-1, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L451] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L497] tmp = 0 VAL [ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=-1, m3=-1, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0, tmp=0] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=-1, m3=-1, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L585] reach_error() VAL [\old(arg)=0, arg=0, ep12=255, ep13=255, ep21=0, ep23=255, ep31=0, ep32=0, id1=125, id2=127, id3=124, m1=126, m2=-1, m3=-1, max1=125, max2=127, max3=127, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.33ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 61.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.04ms. Allocated memory is still 117.4MB. Free memory was 60.9MB in the beginning and 57.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.46ms. Allocated memory is still 117.4MB. Free memory was 57.7MB in the beginning and 55.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1315.98ms. Allocated memory was 117.4MB in the beginning and 186.6MB in the end (delta: 69.2MB). Free memory was 54.9MB in the beginning and 88.8MB in the end (delta: -33.9MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * CodeCheck took 171300.21ms. Allocated memory was 186.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 88.8MB in the beginning and 986.0MB in the end (delta: -897.2MB). Peak memory consumption was 456.5MB. Max. memory is 16.1GB. * Witness Printer took 141.91ms. Allocated memory is still 1.5GB. Free memory was 986.0MB in the beginning and 969.2MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-03 02:08:34,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f0a574d-55cb-4d1e-9166-594607524f8f/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