./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 05:38:04,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:38:04,339 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 05:38:04,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:38:04,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:38:04,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:38:04,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 05:38:04,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 05:38:04,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:38:04,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:38:04,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:38:04,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 05:38:04,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 05:38:04,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:38:04,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 05:38:04,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:38:04,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 05:38:04,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:38:04,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 05:38:04,366 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 05:38:04,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 05:38:04,366 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:38:04,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:38:04,367 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:38:04,367 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:38:04,367 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:38:04,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:38:04,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:38:04,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:38:04,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:38:04,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 05:38:04,367 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:38:04,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:38:04,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec [2024-12-06 05:38:04,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:38:04,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:38:04,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:38:04,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:38:04,593 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:38:04,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-12-06 05:38:07,186 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/data/d96302ea8/a87f76e1ebfd4e8a83593334e2289d6c/FLAGc237cb511 [2024-12-06 05:38:07,439 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:38:07,439 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2024-12-06 05:38:07,449 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/data/d96302ea8/a87f76e1ebfd4e8a83593334e2289d6c/FLAGc237cb511 [2024-12-06 05:38:07,785 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/data/d96302ea8/a87f76e1ebfd4e8a83593334e2289d6c [2024-12-06 05:38:07,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:38:07,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:38:07,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:38:07,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:38:07,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:38:07,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:38:07" (1/1) ... [2024-12-06 05:38:07,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29004d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:07, skipping insertion in model container [2024-12-06 05:38:07,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:38:07" (1/1) ... [2024-12-06 05:38:07,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:38:07,994 WARN L250 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_1475e594-dbe1-438c-a7fc-583acd93b263/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2024-12-06 05:38:07,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:38:08,007 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:38:08,057 WARN L250 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_1475e594-dbe1-438c-a7fc-583acd93b263/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2024-12-06 05:38:08,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:38:08,070 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:38:08,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:08 WrapperNode [2024-12-06 05:38:08,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:38:08,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:38:08,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:38:08,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:38:08,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:08" (1/1) ... [2024-12-06 05:38:08,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:08" (1/1) ... [2024-12-06 05:38:08,115 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 483 [2024-12-06 05:38:08,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:38:08,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:38:08,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:38:08,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:38:08,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:08" (1/1) ... [2024-12-06 05:38:08,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:08" (1/1) ... [2024-12-06 05:38:08,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:08" (1/1) ... [2024-12-06 05:38:08,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:08" (1/1) ... [2024-12-06 05:38:08,137 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:08" (1/1) ... [2024-12-06 05:38:08,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:08" (1/1) ... [2024-12-06 05:38:08,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:08" (1/1) ... [2024-12-06 05:38:08,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:08" (1/1) ... [2024-12-06 05:38:08,149 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:08" (1/1) ... [2024-12-06 05:38:08,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:38:08,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:38:08,153 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:38:08,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:38:08,154 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:38:08" (1/1) ... [2024-12-06 05:38:08,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:38:08,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:38:08,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:38:08,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:38:08,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 05:38:08,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 05:38:08,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:38:08,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:38:08,290 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:38:08,292 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:38:08,806 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-12-06 05:38:08,806 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:38:09,294 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:38:09,294 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 05:38:09,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:38:09 BoogieIcfgContainer [2024-12-06 05:38:09,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:38:09,295 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:38:09,295 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:38:09,322 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:38:09,322 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:38:09" (1/1) ... [2024-12-06 05:38:09,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:38:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2024-12-06 05:38:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2024-12-06 05:38:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 05:38:09,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:09,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2024-12-06 05:38:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2024-12-06 05:38:11,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 05:38:11,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2024-12-06 05:38:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2024-12-06 05:38:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 05:38:12,313 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:12,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2024-12-06 05:38:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2024-12-06 05:38:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 05:38:13,346 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:13,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2024-12-06 05:38:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2024-12-06 05:38:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 05:38:14,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:14,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2024-12-06 05:38:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2024-12-06 05:38:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 05:38:16,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2024-12-06 05:38:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2024-12-06 05:38:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 05:38:17,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2024-12-06 05:38:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2024-12-06 05:38:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:38:18,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:18,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 56 states and 97 transitions. [2024-12-06 05:38:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 97 transitions. [2024-12-06 05:38:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:38:19,993 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:19,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:20,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 57 states and 98 transitions. [2024-12-06 05:38:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 98 transitions. [2024-12-06 05:38:20,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 05:38:20,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:20,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 60 states and 104 transitions. [2024-12-06 05:38:20,660 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 104 transitions. [2024-12-06 05:38:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 05:38:20,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 76 states and 133 transitions. [2024-12-06 05:38:25,142 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 133 transitions. [2024-12-06 05:38:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 05:38:25,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 90 states and 163 transitions. [2024-12-06 05:38:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 163 transitions. [2024-12-06 05:38:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 05:38:28,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:28,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 92 states and 167 transitions. [2024-12-06 05:38:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 167 transitions. [2024-12-06 05:38:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 05:38:29,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:29,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 106 states and 201 transitions. [2024-12-06 05:38:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 201 transitions. [2024-12-06 05:38:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 05:38:34,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:34,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 109 states and 218 transitions. [2024-12-06 05:38:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 218 transitions. [2024-12-06 05:38:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 05:38:35,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:35,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:36,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:36,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 110 states and 219 transitions. [2024-12-06 05:38:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 219 transitions. [2024-12-06 05:38:36,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 05:38:36,723 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:36,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 112 states and 224 transitions. [2024-12-06 05:38:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 224 transitions. [2024-12-06 05:38:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:38:38,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:38,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 126 states and 264 transitions. [2024-12-06 05:38:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 264 transitions. [2024-12-06 05:38:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:38:42,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:42,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:45,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 130 states and 283 transitions. [2024-12-06 05:38:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 283 transitions. [2024-12-06 05:38:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:38:45,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:45,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 132 states and 288 transitions. [2024-12-06 05:38:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 288 transitions. [2024-12-06 05:38:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:38:46,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:46,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 133 states and 290 transitions. [2024-12-06 05:38:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 290 transitions. [2024-12-06 05:38:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:38:47,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:47,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 134 states and 292 transitions. [2024-12-06 05:38:48,450 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 292 transitions. [2024-12-06 05:38:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:38:48,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:48,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 135 states and 293 transitions. [2024-12-06 05:38:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 293 transitions. [2024-12-06 05:38:49,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:38:49,600 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:49,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 139 states and 309 transitions. [2024-12-06 05:38:52,861 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 309 transitions. [2024-12-06 05:38:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 05:38:52,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:52,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:38:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:38:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 140 states and 310 transitions. [2024-12-06 05:38:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 310 transitions. [2024-12-06 05:38:53,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 05:38:53,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:38:53,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:38:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:38:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:39:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:39:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 160 states and 344 transitions. [2024-12-06 05:39:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 344 transitions. [2024-12-06 05:39:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 05:39:01,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:39:01,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:39:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:39:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:39:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:39:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 165 states and 358 transitions. [2024-12-06 05:39:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 358 transitions. [2024-12-06 05:39:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 05:39:03,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:39:03,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:39:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:39:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:39:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:39:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 170 states and 369 transitions. [2024-12-06 05:39:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 369 transitions. [2024-12-06 05:39:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 05:39:08,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:39:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:39:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:39:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:39:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:39:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 184 states and 418 transitions. [2024-12-06 05:39:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 418 transitions. [2024-12-06 05:39:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 05:39:18,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:39:18,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:39:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:39:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:39:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:39:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 189 states and 443 transitions. [2024-12-06 05:39:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 443 transitions. [2024-12-06 05:39:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 05:39:22,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:39:22,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:39:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:39:25,078 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:39:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:39:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 200 states and 466 transitions. [2024-12-06 05:39:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 466 transitions. [2024-12-06 05:39:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 05:39:30,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:39:30,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:39:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:39:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:39:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:39:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 201 states and 469 transitions. [2024-12-06 05:39:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 469 transitions. [2024-12-06 05:39:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 05:39:35,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:39:35,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:39:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:39:38,524 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:39:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:39:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 211 states and 491 transitions. [2024-12-06 05:39:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 491 transitions. [2024-12-06 05:39:44,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 05:39:44,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:39:44,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:39:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:39:46,057 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:39:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:39:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 224 states and 513 transitions. [2024-12-06 05:39:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 513 transitions. [2024-12-06 05:39:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 05:39:50,358 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:39:50,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:39:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:39:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:39:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:39:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 226 states and 516 transitions. [2024-12-06 05:39:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 516 transitions. [2024-12-06 05:39:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 05:39:55,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:39:55,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:39:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:39:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:40:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:40:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 235 states and 532 transitions. [2024-12-06 05:40:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 532 transitions. [2024-12-06 05:40:00,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 05:40:00,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:40:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:40:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:40:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:40:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:40:10,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 247 states and 564 transitions. [2024-12-06 05:40:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 564 transitions. [2024-12-06 05:40:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 05:40:10,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:40:10,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:40:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:40:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 05:40:10,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:40:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 248 states and 565 transitions. [2024-12-06 05:40:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 565 transitions. [2024-12-06 05:40:10,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-06 05:40:10,937 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:40:10,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:40:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:40:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 05:40:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:40:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 248 states and 564 transitions. [2024-12-06 05:40:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 564 transitions. [2024-12-06 05:40:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 05:40:11,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:40:11,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:40:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 05:40:12,086 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 05:40:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 05:40:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 05:40:12,992 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-06 05:40:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-06 05:40:13,295 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 40 iterations. [2024-12-06 05:40:13,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 05:40:13 ImpRootNode [2024-12-06 05:40:13,380 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 05:40:13,381 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 05:40:13,381 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 05:40:13,382 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 05:40:13,382 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:38:09" (3/4) ... [2024-12-06 05:40:13,383 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-06 05:40:13,545 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 173. [2024-12-06 05:40:13,673 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 05:40:13,690 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 05:40:13,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 05:40:13,692 INFO L158 Benchmark]: Toolchain (without parser) took 125903.47ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 117.7MB in the beginning and 301.3MB in the end (delta: -183.7MB). Peak memory consumption was 378.7MB. Max. memory is 16.1GB. [2024-12-06 05:40:13,692 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:40:13,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.88ms. Allocated memory is still 142.6MB. Free memory was 117.7MB in the beginning and 100.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 05:40:13,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.61ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 97.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:40:13,693 INFO L158 Benchmark]: Boogie Preprocessor took 36.36ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:40:13,693 INFO L158 Benchmark]: RCFGBuilder took 1141.45ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 45.7MB in the end (delta: 49.0MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2024-12-06 05:40:13,693 INFO L158 Benchmark]: CodeCheck took 124085.38ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 45.1MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 300.0MB. Max. memory is 16.1GB. [2024-12-06 05:40:13,694 INFO L158 Benchmark]: Witness Printer took 309.02ms. Allocated memory was 1.9GB in the beginning and 453.0MB in the end (delta: -1.5GB). Free memory was 1.5GB in the beginning and 301.3MB in the end (delta: 1.2GB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-12-06 05:40:13,697 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: 124.0s, OverallIterations: 40, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10361 SdHoareTripleChecker+Valid, 62.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9010 mSDsluCounter, 3213 SdHoareTripleChecker+Invalid, 56.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2492 mSDsCounter, 3849 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30269 IncrementalHoareTripleChecker+Invalid, 34118 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3849 mSolverCounterUnsat, 721 mSDtfsCounter, 30269 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9531 GetRequests, 8208 SyntacticMatches, 511 SemanticMatches, 812 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430346 ImplicationChecksByTransitivity, 85.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 42.0s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 8231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 12 PerfectInterpolantSequences, 157/458 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, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 585]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] msg_t nomsg = (msg_t )-1; [L29] port_t p12 ; [L30] char p12_old ; [L31] char p12_new ; [L32] _Bool ep12 ; [L33] port_t p13 ; [L34] char p13_old ; [L35] char p13_new ; [L36] _Bool ep13 ; [L37] port_t p21 ; [L38] char p21_old ; [L39] char p21_new ; [L40] _Bool ep21 ; [L41] port_t p23 ; [L42] char p23_old ; [L43] char p23_new ; [L44] _Bool ep23 ; [L45] port_t p31 ; [L46] char p31_old ; [L47] char p31_new ; [L48] _Bool ep31 ; [L49] port_t p32 ; [L50] char p32_old ; [L51] char p32_new ; [L52] _Bool ep32 ; [L53] char id1 ; [L54] unsigned char r1 ; [L55] char st1 ; [L56] char nl1 ; [L57] char m1 ; [L58] char max1 ; [L59] _Bool mode1 ; [L60] _Bool newmax1 ; [L61] char id2 ; [L62] unsigned char r2 ; [L63] char st2 ; [L64] char nl2 ; [L65] char m2 ; [L66] char max2 ; [L67] _Bool mode2 ; [L68] _Bool newmax2 ; [L69] char id3 ; [L70] unsigned char r3 ; [L71] char st3 ; [L72] char nl3 ; [L73] char m3 ; [L74] char max3 ; [L75] _Bool mode3 ; [L76] _Bool newmax3 ; [L504] int c1 ; [L505] int i2 ; [L508] c1 = 0 [L509] ep12 = __VERIFIER_nondet_bool() [L510] ep13 = __VERIFIER_nondet_bool() [L511] ep21 = __VERIFIER_nondet_bool() [L512] ep23 = __VERIFIER_nondet_bool() [L513] ep31 = __VERIFIER_nondet_bool() [L514] ep32 = __VERIFIER_nondet_bool() [L515] id1 = __VERIFIER_nondet_char() [L516] r1 = __VERIFIER_nondet_uchar() [L517] st1 = __VERIFIER_nondet_char() [L518] nl1 = __VERIFIER_nondet_char() [L519] m1 = __VERIFIER_nondet_char() [L520] max1 = __VERIFIER_nondet_char() [L521] mode1 = __VERIFIER_nondet_bool() [L522] newmax1 = __VERIFIER_nondet_bool() [L523] id2 = __VERIFIER_nondet_char() [L524] r2 = __VERIFIER_nondet_uchar() [L525] st2 = __VERIFIER_nondet_char() [L526] nl2 = __VERIFIER_nondet_char() [L527] m2 = __VERIFIER_nondet_char() [L528] max2 = __VERIFIER_nondet_char() [L529] mode2 = __VERIFIER_nondet_bool() [L530] newmax2 = __VERIFIER_nondet_bool() [L531] id3 = __VERIFIER_nondet_char() [L532] r3 = __VERIFIER_nondet_uchar() [L533] st3 = __VERIFIER_nondet_char() [L534] nl3 = __VERIFIER_nondet_char() [L535] m3 = __VERIFIER_nondet_char() [L536] max3 = __VERIFIER_nondet_char() [L537] mode3 = __VERIFIER_nondet_bool() [L538] newmax3 = __VERIFIER_nondet_bool() [L539] CALL, EXPR init() [L241] _Bool r121 ; [L242] _Bool r131 ; [L243] _Bool r211 ; [L244] _Bool r231 ; [L245] _Bool r311 ; [L246] _Bool r321 ; [L247] _Bool r122 ; [L248] int tmp ; [L249] _Bool r132 ; [L250] int tmp___0 ; [L251] _Bool r212 ; [L252] int tmp___1 ; [L253] _Bool r232 ; [L254] int tmp___2 ; [L255] _Bool r312 ; [L256] int tmp___3 ; [L257] _Bool r322 ; [L258] int tmp___4 ; [L259] int tmp___5 ; [L262] r121 = ep12 [L263] r131 = ep13 [L264] r211 = ep21 [L265] r231 = ep23 [L266] r311 = ep31 [L267] r321 = ep32 [L268] COND FALSE !(\read(r121)) [L271] COND FALSE !(\read(r131)) [L278] tmp = 0 [L280] r122 = (_Bool )tmp [L281] COND FALSE !(\read(r131)) [L284] COND FALSE !(\read(r121)) [L291] tmp___0 = 0 [L293] r132 = (_Bool )tmp___0 [L294] COND FALSE !(\read(r211)) [L297] COND FALSE !(\read(r231)) [L304] tmp___1 = 0 [L306] r212 = (_Bool )tmp___1 [L307] COND FALSE !(\read(r231)) [L310] COND FALSE !(\read(r211)) [L317] tmp___2 = 0 [L319] r232 = (_Bool )tmp___2 [L320] COND FALSE !(\read(r311)) [L323] COND FALSE !(\read(r321)) [L330] tmp___3 = 0 [L332] r312 = (_Bool )tmp___3 [L333] COND FALSE !(\read(r321)) [L336] COND FALSE !(\read(r311)) [L343] tmp___4 = 0 [L345] r322 = (_Bool )tmp___4 [L346] COND TRUE (int )id1 != (int )id2 [L347] COND TRUE (int )id1 != (int )id3 [L348] COND TRUE (int )id2 != (int )id3 [L349] COND TRUE (int )id1 >= 0 [L350] COND TRUE (int )id2 >= 0 [L351] COND TRUE (int )id3 >= 0 [L352] COND TRUE (int )r1 == 0 [L353] COND TRUE (int )r2 == 0 [L354] COND TRUE (int )r3 == 0 [L355] COND TRUE (int )max1 == (int )id1 [L356] COND TRUE (int )max2 == (int )id2 [L357] COND TRUE (int )max3 == (int )id3 [L358] COND TRUE (int )st1 == 0 [L359] COND TRUE (int )st2 == 0 [L360] COND TRUE (int )st3 == 0 [L361] COND TRUE (int )nl1 == 0 [L362] COND TRUE (int )nl2 == 0 [L363] COND TRUE (int )nl3 == 0 [L364] COND TRUE (int )mode1 == 0 [L365] COND TRUE (int )mode2 == 0 [L366] COND TRUE (int )mode3 == 0 [L367] COND TRUE \read(newmax1) [L368] COND TRUE \read(newmax2) [L369] COND TRUE \read(newmax3) [L370] tmp___5 = 1 [L443] return (tmp___5); [L539] RET, EXPR init() [L539] i2 = init() [L540] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L540] RET assume_abort_if_not(i2) [L541] p12_old = nomsg [L542] p12_new = nomsg [L543] p13_old = nomsg [L544] p13_new = nomsg [L545] p21_old = nomsg [L546] p21_new = nomsg [L547] p23_old = nomsg [L548] p23_new = nomsg [L549] p31_old = nomsg [L550] p31_new = nomsg [L551] p32_old = nomsg [L552] p32_new = nomsg [L553] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L572] RET assert(c1) [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND FALSE !((int )r1 == 2) [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND FALSE !((int )r2 == 2) [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND FALSE !((int )r3 == 2) [L220] mode3 = (_Bool)0 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L572] RET assert(c1) [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND FALSE !(\read(mode1)) [L114] COND TRUE (int )r1 < 2 [L115] COND FALSE !(\read(ep12)) [L120] COND FALSE !(\read(ep13)) [L126] mode1 = (_Bool)1 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND FALSE !(\read(mode2)) [L168] COND TRUE (int )r2 < 2 [L169] COND FALSE !(\read(ep21)) [L174] COND FALSE !(\read(ep23)) [L180] mode2 = (_Bool)1 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND FALSE !(\read(mode3)) [L222] COND TRUE (int )r3 < 2 [L223] COND FALSE !(\read(ep31)) [L228] COND FALSE !(\read(ep32)) [L234] mode3 = (_Bool)1 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L451] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L454] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L460] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L465] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L468] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )r1 < 2 [L471] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L572] RET assert(c1) [L556] CALL node1() [L79] _Bool newmax ; [L82] newmax = (_Bool)0 [L83] COND TRUE \read(mode1) [L84] COND FALSE !(r1 == 255) [L87] r1 = r1 + 1 [L88] COND FALSE !(\read(ep21)) [L96] COND FALSE !(\read(ep31)) [L104] newmax1 = newmax [L105] COND TRUE (int )r1 == 2 [L106] COND TRUE (int )max1 == (int )id1 [L107] st1 = (char)1 [L112] mode1 = (_Bool)0 [L556] RET node1() [L557] CALL node2() [L133] _Bool newmax ; [L136] newmax = (_Bool)0 [L137] COND TRUE \read(mode2) [L138] COND FALSE !(r2 == 255) [L141] r2 = r2 + 1 [L142] COND FALSE !(\read(ep12)) [L150] COND FALSE !(\read(ep32)) [L158] newmax2 = newmax [L159] COND TRUE (int )r2 == 2 [L160] COND TRUE (int )max2 == (int )id2 [L161] st2 = (char)1 [L166] mode2 = (_Bool)0 [L557] RET node2() [L558] CALL node3() [L187] _Bool newmax ; [L190] newmax = (_Bool)0 [L191] COND TRUE \read(mode3) [L192] COND FALSE !(r3 == 255) [L195] r3 = r3 + 1 [L196] COND FALSE !(\read(ep13)) [L204] COND FALSE !(\read(ep23)) [L212] newmax3 = newmax [L213] COND TRUE (int )r3 == 2 [L214] COND TRUE (int )max3 == (int )id3 [L215] st3 = (char)1 [L220] mode3 = (_Bool)0 [L558] RET node3() [L559] p12_old = p12_new [L560] p12_new = nomsg [L561] p13_old = p13_new [L562] p13_new = nomsg [L563] p21_old = p21_new [L564] p21_new = nomsg [L565] p23_old = p23_new [L566] p23_new = nomsg [L567] p31_old = p31_new [L568] p31_new = nomsg [L569] p32_old = p32_new [L570] p32_new = nomsg [L571] CALL, EXPR check() [L448] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L451] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L497] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1, tmp=0] [L499] return (tmp); [L571] RET, EXPR check() [L571] c1 = check() [L572] CALL assert(c1) [L583] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L585] reach_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=0, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.88ms. Allocated memory is still 142.6MB. Free memory was 117.7MB in the beginning and 100.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.61ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 97.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.36ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1141.45ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 45.7MB in the end (delta: 49.0MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * CodeCheck took 124085.38ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 45.1MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 300.0MB. Max. memory is 16.1GB. * Witness Printer took 309.02ms. Allocated memory was 1.9GB in the beginning and 453.0MB in the end (delta: -1.5GB). Free memory was 1.5GB in the beginning and 301.3MB in the end (delta: 1.2GB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-06 05:40:13,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1475e594-dbe1-438c-a7fc-583acd93b263/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with 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