./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/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_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/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_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/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 9315395d0a8f14500c92b8c06710daa9c3f1878481e9b5bb1bf2cb8cc368eb3d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 22:27:30,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 22:27:30,217 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-02 22:27:30,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 22:27:30,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-02 22:27:30,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 22:27:30,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 22:27:30,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-02 22:27:30,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 22:27:30,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 22:27:30,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 22:27:30,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 22:27:30,249 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 22:27:30,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 22:27:30,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 22:27:30,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 22:27:30,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 22:27:30,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 22:27:30,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 22:27:30,253 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 22:27:30,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 22:27:30,254 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 22:27:30,254 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-02 22:27:30,255 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-02 22:27:30,255 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-02 22:27:30,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 22:27:30,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 22:27:30,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 22:27:30,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 22:27:30,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 22:27:30,258 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-02 22:27:30,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 22:27:30,259 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 22:27:30,259 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_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/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_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/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 -> 9315395d0a8f14500c92b8c06710daa9c3f1878481e9b5bb1bf2cb8cc368eb3d [2023-12-02 22:27:30,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 22:27:30,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 22:27:30,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 22:27:30,480 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 22:27:30,480 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 22:27:30,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2023-12-02 22:27:33,241 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 22:27:33,442 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 22:27:33,442 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2023-12-02 22:27:33,453 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/bin/ukojak-verify-Qdu7aM0XO9/data/6cb940f99/a4028d3c493b44d6b76d907c9db68210/FLAGd13c7f81d [2023-12-02 22:27:33,464 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/bin/ukojak-verify-Qdu7aM0XO9/data/6cb940f99/a4028d3c493b44d6b76d907c9db68210 [2023-12-02 22:27:33,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 22:27:33,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 22:27:33,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 22:27:33,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 22:27:33,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 22:27:33,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:27:33" (1/1) ... [2023-12-02 22:27:33,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758d97e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:27:33, skipping insertion in model container [2023-12-02 22:27:33,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:27:33" (1/1) ... [2023-12-02 22:27:33,519 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 22:27:33,737 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_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c[14373,14386] [2023-12-02 22:27:33,740 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 22:27:33,751 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 22:27:33,806 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_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c[14373,14386] [2023-12-02 22:27:33,807 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 22:27:33,821 INFO L206 MainTranslator]: Completed translation [2023-12-02 22:27:33,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:27:33 WrapperNode [2023-12-02 22:27:33,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 22:27:33,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 22:27:33,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 22:27:33,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 22:27:33,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:27:33" (1/1) ... [2023-12-02 22:27:33,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:27:33" (1/1) ... [2023-12-02 22:27:33,872 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 484 [2023-12-02 22:27:33,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 22:27:33,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 22:27:33,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 22:27:33,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 22:27:33,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:27:33" (1/1) ... [2023-12-02 22:27:33,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:27:33" (1/1) ... [2023-12-02 22:27:33,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:27:33" (1/1) ... [2023-12-02 22:27:33,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:27:33" (1/1) ... [2023-12-02 22:27:33,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:27:33" (1/1) ... [2023-12-02 22:27:33,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:27:33" (1/1) ... [2023-12-02 22:27:33,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:27:33" (1/1) ... [2023-12-02 22:27:33,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:27:33" (1/1) ... [2023-12-02 22:27:33,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 22:27:33,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 22:27:33,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 22:27:33,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 22:27:33,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:27:33" (1/1) ... [2023-12-02 22:27:33,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 22:27:33,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-02 22:27:33,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-02 22:27:33,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-02 22:27:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 22:27:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 22:27:33,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 22:27:33,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 22:27:34,084 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 22:27:34,086 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 22:27:34,562 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 22:27:35,096 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 22:27:35,096 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 22:27:35,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:27:35 BoogieIcfgContainer [2023-12-02 22:27:35,098 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 22:27:35,098 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-02 22:27:35,098 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-02 22:27:35,106 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-02 22:27:35,106 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:27:35" (1/1) ... [2023-12-02 22:27:35,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 22:27:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2023-12-02 22:27:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2023-12-02 22:27:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 22:27:35,158 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:35,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:27:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:27:36,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2023-12-02 22:27:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2023-12-02 22:27:36,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 22:27:36,832 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:36,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:27:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:27:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2023-12-02 22:27:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2023-12-02 22:27:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 22:27:38,032 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:38,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:27:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:27:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2023-12-02 22:27:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2023-12-02 22:27:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 22:27:39,329 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:27:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:27:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2023-12-02 22:27:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2023-12-02 22:27:40,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 22:27:40,861 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:40,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:27:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:27:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 38 states and 70 transitions. [2023-12-02 22:27:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 70 transitions. [2023-12-02 22:27:42,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 22:27:42,229 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:42,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:27:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:27:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 44 states and 83 transitions. [2023-12-02 22:27:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 83 transitions. [2023-12-02 22:27:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 22:27:43,967 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:43,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:27:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:27:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 45 states and 83 transitions. [2023-12-02 22:27:44,242 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 83 transitions. [2023-12-02 22:27:44,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 22:27:44,242 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:27:44,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 22:27:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 46 states and 84 transitions. [2023-12-02 22:27:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 84 transitions. [2023-12-02 22:27:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 22:27:44,311 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:44,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:27:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:27:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 56 states and 103 transitions. [2023-12-02 22:27:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 103 transitions. [2023-12-02 22:27:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 22:27:46,703 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:27:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:27:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 59 states and 109 transitions. [2023-12-02 22:27:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 109 transitions. [2023-12-02 22:27:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 22:27:47,145 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:47,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:27:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:27:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 75 states and 142 transitions. [2023-12-02 22:27:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 142 transitions. [2023-12-02 22:27:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 22:27:52,347 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:52,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:27:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:27:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 89 states and 164 transitions. [2023-12-02 22:27:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 164 transitions. [2023-12-02 22:27:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 22:27:55,480 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:55,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:27:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:27:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:27:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 104 states and 188 transitions. [2023-12-02 22:27:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2023-12-02 22:27:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 22:27:59,207 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:27:59,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:27:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 112 states and 210 transitions. [2023-12-02 22:28:02,623 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 210 transitions. [2023-12-02 22:28:02,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 22:28:02,625 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:02,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:03,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 113 states and 217 transitions. [2023-12-02 22:28:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 217 transitions. [2023-12-02 22:28:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 22:28:03,836 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:03,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 127 states and 246 transitions. [2023-12-02 22:28:07,600 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 246 transitions. [2023-12-02 22:28:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 22:28:07,601 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:07,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 128 states and 250 transitions. [2023-12-02 22:28:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 250 transitions. [2023-12-02 22:28:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 22:28:08,808 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:08,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 130 states and 254 transitions. [2023-12-02 22:28:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 254 transitions. [2023-12-02 22:28:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 22:28:10,236 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 131 states and 256 transitions. [2023-12-02 22:28:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 256 transitions. [2023-12-02 22:28:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 22:28:11,373 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:11,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 150 states and 290 transitions. [2023-12-02 22:28:17,390 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 290 transitions. [2023-12-02 22:28:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 22:28:17,391 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 155 states and 303 transitions. [2023-12-02 22:28:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 303 transitions. [2023-12-02 22:28:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 22:28:20,114 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:20,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 163 states and 323 transitions. [2023-12-02 22:28:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 323 transitions. [2023-12-02 22:28:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 22:28:26,079 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:26,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 178 states and 374 transitions. [2023-12-02 22:28:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 374 transitions. [2023-12-02 22:28:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:28:35,610 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:35,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:37,086 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 22:28:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 189 states and 394 transitions. [2023-12-02 22:28:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 394 transitions. [2023-12-02 22:28:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:28:42,063 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:42,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:43,172 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 22:28:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 190 states and 395 transitions. [2023-12-02 22:28:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 395 transitions. [2023-12-02 22:28:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:28:43,807 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:44,787 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 22:28:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 191 states and 398 transitions. [2023-12-02 22:28:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 398 transitions. [2023-12-02 22:28:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 22:28:45,456 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:45,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 204 states and 429 transitions. [2023-12-02 22:28:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 429 transitions. [2023-12-02 22:28:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 22:28:53,682 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:53,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 206 states and 436 transitions. [2023-12-02 22:28:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 436 transitions. [2023-12-02 22:28:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 22:28:55,785 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:55,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 207 states and 440 transitions. [2023-12-02 22:28:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 440 transitions. [2023-12-02 22:28:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 22:28:57,457 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:57,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:28:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:28:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:28:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 208 states and 441 transitions. [2023-12-02 22:28:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 441 transitions. [2023-12-02 22:28:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 22:28:59,216 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:28:59,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:28:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:29:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:29:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:29:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 209 states and 444 transitions. [2023-12-02 22:29:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 444 transitions. [2023-12-02 22:29:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 22:29:00,827 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:29:00,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:29:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:29:04,081 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 22:29:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:29:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 221 states and 466 transitions. [2023-12-02 22:29:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 466 transitions. [2023-12-02 22:29:11,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 22:29:11,573 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:29:11,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:29:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:29:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:29:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:29:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 235 states and 496 transitions. [2023-12-02 22:29:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 496 transitions. [2023-12-02 22:29:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 22:29:21,542 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:29:21,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:29:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:29:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:29:23,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:29:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 237 states and 507 transitions. [2023-12-02 22:29:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 507 transitions. [2023-12-02 22:29:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 22:29:23,936 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:29:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:29:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:29:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:29:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:29:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 243 states and 522 transitions. [2023-12-02 22:29:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 522 transitions. [2023-12-02 22:29:31,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 22:29:31,006 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:29:31,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:29:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:29:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:29:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:29:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 245 states and 525 transitions. [2023-12-02 22:29:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 525 transitions. [2023-12-02 22:29:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 22:29:33,483 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:29:33,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:29:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:29:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:29:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:29:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 258 states and 544 transitions. [2023-12-02 22:29:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 544 transitions. [2023-12-02 22:29:45,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 22:29:45,977 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:29:45,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:29:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:29:49,365 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 22:29:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:29:57,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 264 states and 580 transitions. [2023-12-02 22:29:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 580 transitions. [2023-12-02 22:29:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 22:29:57,008 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:29:57,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:29:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:29:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:30:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:30:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 267 states and 590 transitions. [2023-12-02 22:30:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 590 transitions. [2023-12-02 22:30:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 22:30:01,033 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:30:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:30:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:30:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:30:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:30:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 274 states and 604 transitions. [2023-12-02 22:30:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 604 transitions. [2023-12-02 22:30:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 22:30:09,355 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:30:09,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:30:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:30:09,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 22:30:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:30:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:30:10,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 22:30:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:30:11,424 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 41 iterations. [2023-12-02 22:30:11,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 10:30:11 ImpRootNode [2023-12-02 22:30:11,548 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-02 22:30:11,549 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 22:30:11,549 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 22:30:11,549 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 22:30:11,549 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:27:35" (3/4) ... [2023-12-02 22:30:11,550 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 22:30:11,698 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-02 22:30:11,698 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 22:30:11,699 INFO L158 Benchmark]: Toolchain (without parser) took 158231.14ms. Allocated memory was 211.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 170.7MB in the beginning and 880.0MB in the end (delta: -709.3MB). Peak memory consumption was 691.7MB. Max. memory is 16.1GB. [2023-12-02 22:30:11,699 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 113.2MB. Free memory is still 60.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 22:30:11,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.66ms. Allocated memory is still 211.8MB. Free memory was 170.7MB in the beginning and 153.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 22:30:11,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.71ms. Allocated memory is still 211.8MB. Free memory was 153.3MB in the beginning and 150.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 22:30:11,700 INFO L158 Benchmark]: Boogie Preprocessor took 42.76ms. Allocated memory is still 211.8MB. Free memory was 150.3MB in the beginning and 147.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 22:30:11,700 INFO L158 Benchmark]: RCFGBuilder took 1181.11ms. Allocated memory is still 211.8MB. Free memory was 147.6MB in the beginning and 134.8MB in the end (delta: 12.8MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. [2023-12-02 22:30:11,700 INFO L158 Benchmark]: CodeCheck took 156449.78ms. Allocated memory was 211.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 134.8MB in the beginning and 896.7MB in the end (delta: -762.0MB). Peak memory consumption was 636.8MB. Max. memory is 16.1GB. [2023-12-02 22:30:11,701 INFO L158 Benchmark]: Witness Printer took 149.55ms. Allocated memory is still 1.6GB. Free memory was 896.7MB in the beginning and 880.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 22:30:11,702 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: 156.3s, OverallIterations: 41, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12009 SdHoareTripleChecker+Valid, 71.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10689 mSDsluCounter, 3632 SdHoareTripleChecker+Invalid, 64.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2990 mSDsCounter, 4541 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34450 IncrementalHoareTripleChecker+Invalid, 38991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4541 mSolverCounterUnsat, 642 mSDtfsCounter, 34450 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11170 GetRequests, 9838 SyntacticMatches, 424 SemanticMatches, 908 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498870 ImplicationChecksByTransitivity, 107.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 52.6s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1007 ConstructedInterpolants, 0 QuantifiedInterpolants, 8934 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 10 PerfectInterpolantSequences, 113/576 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 600]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] msg_t nomsg = (msg_t )-1; [L28] port_t p12 ; [L29] char p12_old ; [L30] char p12_new ; [L31] _Bool ep12 ; [L32] port_t p13 ; [L33] char p13_old ; [L34] char p13_new ; [L35] _Bool ep13 ; [L36] port_t p21 ; [L37] char p21_old ; [L38] char p21_new ; [L39] _Bool ep21 ; [L40] port_t p23 ; [L41] char p23_old ; [L42] char p23_new ; [L43] _Bool ep23 ; [L44] port_t p31 ; [L45] char p31_old ; [L46] char p31_new ; [L47] _Bool ep31 ; [L48] port_t p32 ; [L49] char p32_old ; [L50] char p32_new ; [L51] _Bool ep32 ; [L52] char id1 ; [L53] char r1 ; [L54] char st1 ; [L55] char nl1 ; [L56] char m1 ; [L57] char max1 ; [L58] _Bool mode1 ; [L59] _Bool newmax1 ; [L60] char id2 ; [L61] char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] _Bool newmax2 ; [L68] char id3 ; [L69] char r3 ; [L70] char st3 ; [L71] char nl3 ; [L72] char m3 ; [L73] char max3 ; [L74] _Bool mode3 ; [L75] _Bool newmax3 ; [L518] int c1 ; [L519] int i2 ; [L522] c1 = 0 [L523] ep12 = __VERIFIER_nondet_bool() [L524] ep13 = __VERIFIER_nondet_bool() [L525] ep21 = __VERIFIER_nondet_bool() [L526] ep23 = __VERIFIER_nondet_bool() [L527] ep31 = __VERIFIER_nondet_bool() [L528] ep32 = __VERIFIER_nondet_bool() [L529] id1 = __VERIFIER_nondet_char() [L530] r1 = __VERIFIER_nondet_char() [L531] st1 = __VERIFIER_nondet_char() [L532] nl1 = __VERIFIER_nondet_char() [L533] m1 = __VERIFIER_nondet_char() [L534] max1 = __VERIFIER_nondet_char() [L535] mode1 = __VERIFIER_nondet_bool() [L536] newmax1 = __VERIFIER_nondet_bool() [L537] id2 = __VERIFIER_nondet_char() [L538] r2 = __VERIFIER_nondet_char() [L539] st2 = __VERIFIER_nondet_char() [L540] nl2 = __VERIFIER_nondet_char() [L541] m2 = __VERIFIER_nondet_char() [L542] max2 = __VERIFIER_nondet_char() [L543] mode2 = __VERIFIER_nondet_bool() [L544] newmax2 = __VERIFIER_nondet_bool() [L545] id3 = __VERIFIER_nondet_char() [L546] r3 = __VERIFIER_nondet_char() [L547] st3 = __VERIFIER_nondet_char() [L548] nl3 = __VERIFIER_nondet_char() [L549] m3 = __VERIFIER_nondet_char() [L550] max3 = __VERIFIER_nondet_char() [L551] mode3 = __VERIFIER_nondet_bool() [L552] newmax3 = __VERIFIER_nondet_bool() [L553] CALL, EXPR init() [L231] _Bool r121 ; [L232] _Bool r131 ; [L233] _Bool r211 ; [L234] _Bool r231 ; [L235] _Bool r311 ; [L236] _Bool r321 ; [L237] _Bool r122 ; [L238] int tmp ; [L239] _Bool r132 ; [L240] int tmp___0 ; [L241] _Bool r212 ; [L242] int tmp___1 ; [L243] _Bool r232 ; [L244] int tmp___2 ; [L245] _Bool r312 ; [L246] int tmp___3 ; [L247] _Bool r322 ; [L248] int tmp___4 ; [L249] int tmp___5 ; [L252] r121 = ep12 [L253] r131 = ep13 [L254] r211 = ep21 [L255] r231 = ep23 [L256] r311 = ep31 [L257] r321 = ep32 [L258] COND TRUE \read(r121) [L259] tmp = 1 [L270] r122 = (_Bool )tmp [L271] COND TRUE \read(r131) [L272] tmp___0 = 1 [L283] r132 = (_Bool )tmp___0 [L284] COND TRUE \read(r211) [L285] tmp___1 = 1 [L296] r212 = (_Bool )tmp___1 [L297] COND FALSE !(\read(r231)) [L300] COND TRUE \read(r211) [L301] COND TRUE \read(ep13) [L302] tmp___2 = 1 [L309] r232 = (_Bool )tmp___2 [L310] COND TRUE \read(r311) [L311] tmp___3 = 1 [L322] r312 = (_Bool )tmp___3 [L323] COND TRUE \read(r321) [L324] tmp___4 = 1 [L335] r322 = (_Bool )tmp___4 [L336] COND TRUE (int )id1 != (int )id2 [L337] COND TRUE (int )id1 != (int )id3 [L338] COND TRUE (int )id2 != (int )id3 [L339] COND TRUE (int )id1 >= 0 [L340] COND TRUE (int )id2 >= 0 [L341] COND TRUE (int )id3 >= 0 [L342] COND TRUE (int )r1 == 0 [L343] COND TRUE (int )r2 == 0 [L344] COND TRUE (int )r3 == 0 [L345] COND TRUE \read(r122) [L346] COND TRUE \read(r132) [L347] COND TRUE \read(r212) [L348] COND TRUE \read(r232) [L349] COND TRUE \read(r312) [L350] COND TRUE \read(r322) [L351] COND TRUE (int )max1 == (int )id1 [L352] COND TRUE (int )max2 == (int )id2 [L353] COND TRUE (int )max3 == (int )id3 [L354] COND TRUE (int )st1 == 0 [L355] COND TRUE (int )st2 == 0 [L356] COND TRUE (int )st3 == 0 [L357] COND TRUE (int )nl1 == 0 [L358] COND TRUE (int )nl2 == 0 [L359] COND TRUE (int )nl3 == 0 [L360] COND TRUE (int )mode1 == 0 [L361] COND TRUE (int )mode2 == 0 [L362] COND TRUE (int )mode3 == 0 [L363] COND TRUE \read(newmax1) [L364] COND TRUE \read(newmax2) [L365] COND TRUE \read(newmax3) [L366] tmp___5 = 1 [L457] return (tmp___5); [L553] RET, EXPR init() [L553] i2 = init() [L554] CALL assume_abort_if_not(i2) [L21] COND FALSE !(!cond) [L554] RET assume_abort_if_not(i2) [L555] p12_old = nomsg [L556] p12_new = nomsg [L557] p13_old = nomsg [L558] p13_new = nomsg [L559] p21_old = nomsg [L560] p21_new = nomsg [L561] p23_old = nomsg [L562] p23_new = nomsg [L563] p31_old = nomsg [L564] p31_new = nomsg [L565] p32_old = nomsg [L566] p32_new = nomsg [L567] i2 = 0 VAL [c1=0, ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, i2=0, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=0, mode2=0, mode3=0, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND TRUE \read(ep13) [L117] COND TRUE \read(newmax1) [L118] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND TRUE \read(newmax2) [L164] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L167] COND FALSE !(\read(ep23)) [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND TRUE \read(newmax3) [L215] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L218] COND TRUE \read(ep32) [L219] COND TRUE \read(newmax3) [L220] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, i2=1, id1=2, id2=1, id3=3, m1=4, m2=4, m3=4, max1=2, max2=1, max3=3, mode1=1, mode2=1, mode3=1, newmax1=255, newmax2=255, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND TRUE (int )m1 > (int )max1 [L96] max1 = m1 [L97] newmax = (_Bool)1 [L100] newmax1 = newmax [L101] COND FALSE !((int )r1 == 2) [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND TRUE (int )m2 > (int )max2 [L139] max2 = m2 [L140] newmax = (_Bool)1 [L143] COND TRUE \read(ep32) [L144] m2 = p32_old [L145] p32_old = nomsg [L146] COND TRUE (int )m2 > (int )max2 [L147] max2 = m2 [L148] newmax = (_Bool)1 [L151] newmax2 = newmax [L152] COND FALSE !((int )r2 == 2) [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND FALSE !((int )m3 > (int )max3) [L194] COND FALSE !(\read(ep23)) [L202] newmax3 = newmax [L203] COND FALSE !((int )r3 == 2) [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, i2=2, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND FALSE !(\read(mode1)) [L110] COND TRUE (int )r1 < 2 [L111] COND TRUE \read(ep12) [L112] COND TRUE \read(newmax1) [L113] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L116] COND TRUE \read(ep13) [L117] COND TRUE \read(newmax1) [L118] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L122] mode1 = (_Bool)1 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND FALSE !(\read(mode2)) [L161] COND TRUE (int )r2 < 2 [L162] COND TRUE \read(ep21) [L163] COND TRUE \read(newmax2) [L164] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L167] COND FALSE !(\read(ep23)) [L173] mode2 = (_Bool)1 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND FALSE !(\read(mode3)) [L212] COND TRUE (int )r3 < 2 [L213] COND TRUE \read(ep31) [L214] COND FALSE !(\read(newmax3)) [L218] COND TRUE \read(ep32) [L219] COND FALSE !(\read(newmax3)) [L224] mode3 = (_Bool)1 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, 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=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, 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=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L466] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, 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=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L467] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, 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=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, 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=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, 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=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, 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=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, 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=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L479] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, 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=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L482] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, 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=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE (int )r1 < 2 [L485] tmp = 1 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, 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=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, 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=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L586] RET assert(c1) [L587] i2 ++ VAL [c1=1, ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, i2=3, id1=2, id2=1, id3=3, m1=3, m2=3, m3=2, max1=3, max2=3, max3=3, 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=3, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L568] COND TRUE i2 < 6 [L570] CALL node1() [L78] _Bool newmax ; [L81] newmax = (_Bool)0 [L82] COND TRUE \read(mode1) [L83] r1 = (char )((int )r1 + 1) [L84] COND TRUE \read(ep21) [L85] m1 = p21_old [L86] p21_old = nomsg [L87] COND FALSE !((int )m1 > (int )max1) [L92] COND TRUE \read(ep31) [L93] m1 = p31_old [L94] p31_old = nomsg [L95] COND FALSE !((int )m1 > (int )max1) [L100] newmax1 = newmax [L101] COND TRUE (int )r1 == 2 [L102] COND FALSE !((int )max1 == (int )id1) [L105] st1 = (char)1 [L108] mode1 = (_Bool)0 [L570] RET node1() [L571] CALL node2() [L129] _Bool newmax ; [L132] newmax = (_Bool)0 [L133] COND TRUE \read(mode2) [L134] r2 = (char )((int )r2 + 1) [L135] COND TRUE \read(ep12) [L136] m2 = p12_old [L137] p12_old = nomsg [L138] COND FALSE !((int )m2 > (int )max2) [L143] COND TRUE \read(ep32) [L144] m2 = p32_old [L145] p32_old = nomsg [L146] COND FALSE !((int )m2 > (int )max2) [L151] newmax2 = newmax [L152] COND TRUE (int )r2 == 2 [L153] COND FALSE !((int )max2 == (int )id2) [L156] nl2 = (char)1 [L159] mode2 = (_Bool)0 [L571] RET node2() [L572] CALL node3() [L180] _Bool newmax ; [L183] newmax = (_Bool)0 [L184] COND TRUE \read(mode3) [L185] r3 = (char )((int )r3 + 1) [L186] COND TRUE \read(ep13) [L187] m3 = p13_old [L188] p13_old = nomsg [L189] COND FALSE !((int )m3 > (int )max3) [L194] COND FALSE !(\read(ep23)) [L202] newmax3 = newmax [L203] COND TRUE (int )r3 == 2 [L204] COND TRUE (int )max3 == (int )id3 [L205] st3 = (char)1 [L210] mode3 = (_Bool)0 [L572] RET node3() [L573] p12_old = p12_new [L574] p12_new = nomsg [L575] p13_old = p13_new [L576] p13_new = nomsg [L577] p21_old = p21_new [L578] p21_new = nomsg [L579] p23_old = p23_new [L580] p23_new = nomsg [L581] p31_old = p31_new [L582] p31_new = nomsg [L583] p32_old = p32_new [L584] p32_new = nomsg [L585] CALL, EXPR check() [L462] int tmp ; VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=-1, m2=-1, m3=3, max1=3, max2=3, max3=3, 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] [L465] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L511] tmp = 0 VAL [ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=-1, m2=-1, m3=3, max1=3, max2=3, max3=3, 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] [L513] return (tmp); [L585] RET, EXPR check() [L585] c1 = check() [L586] CALL assert(c1) [L598] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=-1, m2=-1, m3=3, max1=3, max2=3, max3=3, 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] [L600] reach_error() VAL [\old(arg)=0, arg=0, ep12=1, ep13=255, ep21=1, ep23=0, ep31=255, ep32=255, id1=2, id2=1, id3=3, m1=-1, m2=-1, m3=3, max1=3, max2=3, max3=3, 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.22ms. Allocated memory is still 113.2MB. Free memory is still 60.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.66ms. Allocated memory is still 211.8MB. Free memory was 170.7MB in the beginning and 153.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.71ms. Allocated memory is still 211.8MB. Free memory was 153.3MB in the beginning and 150.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.76ms. Allocated memory is still 211.8MB. Free memory was 150.3MB in the beginning and 147.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1181.11ms. Allocated memory is still 211.8MB. Free memory was 147.6MB in the beginning and 134.8MB in the end (delta: 12.8MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. * CodeCheck took 156449.78ms. Allocated memory was 211.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 134.8MB in the beginning and 896.7MB in the end (delta: -762.0MB). Peak memory consumption was 636.8MB. Max. memory is 16.1GB. * Witness Printer took 149.55ms. Allocated memory is still 1.6GB. Free memory was 896.7MB in the beginning and 880.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-02 22:30:11,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6df9fd48-10f2-4d47-87b4-39d17d3e21f5/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