./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 22:51:54,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 22:51:54,856 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-02 22:51:54,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 22:51:54,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-02 22:51:54,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 22:51:54,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 22:51:54,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-02 22:51:54,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 22:51:54,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 22:51:54,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 22:51:54,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 22:51:54,893 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 22:51:54,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 22:51:54,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 22:51:54,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 22:51:54,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 22:51:54,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 22:51:54,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 22:51:54,898 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 22:51:54,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 22:51:54,899 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 22:51:54,900 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-02 22:51:54,901 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-02 22:51:54,901 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-02 22:51:54,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 22:51:54,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 22:51:54,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 22:51:54,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 22:51:54,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 22:51:54,904 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-02 22:51:54,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 22:51:54,905 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 22:51:54,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7a355896b8b65b5a2cb80c69f28000f566073d33b0003da7d28a637c6d5db6a [2023-12-02 22:51:55,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 22:51:55,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 22:51:55,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 22:51:55,205 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 22:51:55,206 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 22:51:55,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2023-12-02 22:51:58,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 22:51:58,628 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 22:51:58,629 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c [2023-12-02 22:51:58,644 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/data/471e09bd0/775564f033274ac8b6c70df2762b6ac0/FLAG3d855c0e7 [2023-12-02 22:51:58,662 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/data/471e09bd0/775564f033274ac8b6c70df2762b6ac0 [2023-12-02 22:51:58,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 22:51:58,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 22:51:58,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 22:51:58,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 22:51:58,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 22:51:58,676 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:51:58" (1/1) ... [2023-12-02 22:51:58,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20558eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:51:58, skipping insertion in model container [2023-12-02 22:51:58,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:51:58" (1/1) ... [2023-12-02 22:51:58,734 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 22:51:59,000 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2023-12-02 22:51:59,005 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 22:51:59,019 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 22:51:59,080 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c[12968,12981] [2023-12-02 22:51:59,081 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 22:51:59,101 INFO L206 MainTranslator]: Completed translation [2023-12-02 22:51:59,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:51:59 WrapperNode [2023-12-02 22:51:59,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 22:51:59,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 22:51:59,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 22:51:59,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 22:51:59,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:51:59" (1/1) ... [2023-12-02 22:51:59,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:51:59" (1/1) ... [2023-12-02 22:51:59,166 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 445 [2023-12-02 22:51:59,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 22:51:59,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 22:51:59,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 22:51:59,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 22:51:59,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:51:59" (1/1) ... [2023-12-02 22:51:59,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:51:59" (1/1) ... [2023-12-02 22:51:59,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:51:59" (1/1) ... [2023-12-02 22:51:59,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:51:59" (1/1) ... [2023-12-02 22:51:59,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:51:59" (1/1) ... [2023-12-02 22:51:59,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:51:59" (1/1) ... [2023-12-02 22:51:59,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:51:59" (1/1) ... [2023-12-02 22:51:59,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:51:59" (1/1) ... [2023-12-02 22:51:59,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 22:51:59,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 22:51:59,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 22:51:59,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 22:51:59,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:51:59" (1/1) ... [2023-12-02 22:51:59,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 22:51:59,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-02 22:51:59,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-02 22:51:59,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-02 22:51:59,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 22:51:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 22:51:59,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 22:51:59,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 22:51:59,403 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 22:51:59,405 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 22:51:59,961 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 22:52:00,724 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 22:52:00,724 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 22:52:00,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:52:00 BoogieIcfgContainer [2023-12-02 22:52:00,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 22:52:00,727 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-02 22:52:00,727 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-02 22:52:00,739 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-02 22:52:00,739 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:52:00" (1/1) ... [2023-12-02 22:52:00,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 22:52:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2023-12-02 22:52:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2023-12-02 22:52:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 22:52:00,821 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:00,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:02,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 20 states and 32 transitions. [2023-12-02 22:52:02,809 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2023-12-02 22:52:02,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 22:52:02,809 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:02,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 23 states and 38 transitions. [2023-12-02 22:52:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2023-12-02 22:52:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 22:52:04,115 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:05,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 27 states and 46 transitions. [2023-12-02 22:52:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2023-12-02 22:52:05,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 22:52:05,587 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:05,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 32 states and 56 transitions. [2023-12-02 22:52:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 56 transitions. [2023-12-02 22:52:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 22:52:07,117 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 39 states and 68 transitions. [2023-12-02 22:52:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 68 transitions. [2023-12-02 22:52:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 22:52:09,242 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:09,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 45 states and 79 transitions. [2023-12-02 22:52:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 79 transitions. [2023-12-02 22:52:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 22:52:11,302 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:11,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2023-12-02 22:52:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2023-12-02 22:52:11,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 22:52:11,707 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:11,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2023-12-02 22:52:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2023-12-02 22:52:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 22:52:11,800 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:11,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 57 states and 96 transitions. [2023-12-02 22:52:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 96 transitions. [2023-12-02 22:52:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 22:52:14,297 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:14,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 60 states and 101 transitions. [2023-12-02 22:52:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 101 transitions. [2023-12-02 22:52:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 22:52:14,950 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:22,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:22,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 76 states and 132 transitions. [2023-12-02 22:52:22,009 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2023-12-02 22:52:22,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 22:52:22,010 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:22,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 90 states and 161 transitions. [2023-12-02 22:52:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 161 transitions. [2023-12-02 22:52:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 22:52:26,390 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:26,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 91 states and 163 transitions. [2023-12-02 22:52:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2023-12-02 22:52:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 22:52:27,752 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:27,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:29,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 105 states and 187 transitions. [2023-12-02 22:52:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 187 transitions. [2023-12-02 22:52:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 22:52:33,037 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:33,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:35,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 107 states and 192 transitions. [2023-12-02 22:52:35,014 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 192 transitions. [2023-12-02 22:52:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 22:52:35,015 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:35,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 121 states and 223 transitions. [2023-12-02 22:52:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 223 transitions. [2023-12-02 22:52:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 22:52:41,068 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:41,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 125 states and 235 transitions. [2023-12-02 22:52:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 235 transitions. [2023-12-02 22:52:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 22:52:44,195 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:44,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 126 states and 241 transitions. [2023-12-02 22:52:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 241 transitions. [2023-12-02 22:52:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 22:52:46,532 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 128 states and 247 transitions. [2023-12-02 22:52:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 247 transitions. [2023-12-02 22:52:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 22:52:48,395 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:52:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:52:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 148 states and 280 transitions. [2023-12-02 22:52:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 280 transitions. [2023-12-02 22:52:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 22:52:57,503 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:52:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:52:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:52:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:53:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:53:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 153 states and 291 transitions. [2023-12-02 22:53:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 291 transitions. [2023-12-02 22:53:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 22:53:00,381 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:53:00,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:53:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:53:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:53:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:53:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 161 states and 307 transitions. [2023-12-02 22:53:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 307 transitions. [2023-12-02 22:53:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 22:53:08,369 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:53:08,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:53:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:53:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:53:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:53:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 176 states and 358 transitions. [2023-12-02 22:53:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 358 transitions. [2023-12-02 22:53:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:53:19,376 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:53:19,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:53:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:53:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:53:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:53:28,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 190 states and 399 transitions. [2023-12-02 22:53:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 399 transitions. [2023-12-02 22:53:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:53:28,967 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:53:28,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:53:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:53:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:53:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:53:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 199 states and 417 transitions. [2023-12-02 22:53:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 417 transitions. [2023-12-02 22:53:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 22:53:35,240 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:53:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:53:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:53:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:53:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:53:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 201 states and 422 transitions. [2023-12-02 22:53:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 422 transitions. [2023-12-02 22:53:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 22:53:38,816 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:53:38,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:53:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:53:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:53:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:53:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 211 states and 441 transitions. [2023-12-02 22:53:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 441 transitions. [2023-12-02 22:53:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 22:53:46,233 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:53:46,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:53:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:53:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:53:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:53:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 222 states and 470 transitions. [2023-12-02 22:53:56,718 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 470 transitions. [2023-12-02 22:53:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 22:53:56,719 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:53:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:53:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:53:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:53:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:53:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 224 states and 477 transitions. [2023-12-02 22:53:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 477 transitions. [2023-12-02 22:53:58,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 22:53:58,815 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:53:58,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:53:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:53:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:54:00,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:54:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 225 states and 479 transitions. [2023-12-02 22:54:00,418 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 479 transitions. [2023-12-02 22:54:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 22:54:00,419 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:54:00,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:54:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:54:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:54:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:54:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 240 states and 514 transitions. [2023-12-02 22:54:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 514 transitions. [2023-12-02 22:54:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 22:54:09,228 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:54:09,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:54:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:54:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:54:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:54:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 243 states and 525 transitions. [2023-12-02 22:54:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 525 transitions. [2023-12-02 22:54:12,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 22:54:12,506 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:54:12,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:54:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:54:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:54:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:54:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 246 states and 530 transitions. [2023-12-02 22:54:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 530 transitions. [2023-12-02 22:54:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 22:54:19,335 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:54:19,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:54:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:54:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:54:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:54:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 248 states and 540 transitions. [2023-12-02 22:54:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 540 transitions. [2023-12-02 22:54:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 22:54:24,694 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:54:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:54:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:54:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:54:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:54:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 252 states and 555 transitions. [2023-12-02 22:54:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 555 transitions. [2023-12-02 22:54:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 22:54:29,979 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:54:29,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:54:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:54:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:54:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:54:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 255 states and 565 transitions. [2023-12-02 22:54:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 565 transitions. [2023-12-02 22:54:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 22:54:35,877 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:54:35,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:54:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:54:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:54:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:54:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 268 states and 592 transitions. [2023-12-02 22:54:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 592 transitions. [2023-12-02 22:54:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 22:54:45,588 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:54:45,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:54:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:54:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:54:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:54:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 272 states and 605 transitions. [2023-12-02 22:54:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 605 transitions. [2023-12-02 22:54:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 22:54:50,171 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:54:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:54:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:54:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:54:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:54:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 280 states and 629 transitions. [2023-12-02 22:54:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 629 transitions. [2023-12-02 22:54:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 22:54:59,401 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:54:59,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:54:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:55:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:55:08,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:55:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 285 states and 647 transitions. [2023-12-02 22:55:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 647 transitions. [2023-12-02 22:55:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 22:55:08,832 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:55:08,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:55:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 22:55:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 22:55:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 22:55:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 289 states and 661 transitions. [2023-12-02 22:55:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 661 transitions. [2023-12-02 22:55:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 22:55:16,600 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 22:55:16,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 22:55:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:55:16,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 22:55:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:55:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:55:17,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 22:55:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 22:55:18,391 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 42 iterations. [2023-12-02 22:55:18,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 10:55:18 ImpRootNode [2023-12-02 22:55:18,513 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-02 22:55:18,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 22:55:18,513 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 22:55:18,514 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 22:55:18,514 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:52:00" (3/4) ... [2023-12-02 22:55:18,515 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 22:55:18,659 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-02 22:55:18,659 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 22:55:18,660 INFO L158 Benchmark]: Toolchain (without parser) took 199992.92ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 98.0MB in the beginning and 679.7MB in the end (delta: -581.7MB). Peak memory consumption was 861.8MB. Max. memory is 16.1GB. [2023-12-02 22:55:18,660 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 22:55:18,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.91ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 81.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-12-02 22:55:18,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.75ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 77.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 22:55:18,662 INFO L158 Benchmark]: Boogie Preprocessor took 52.13ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 75.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 22:55:18,662 INFO L158 Benchmark]: RCFGBuilder took 1506.17ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 75.0MB in the beginning and 90.1MB in the end (delta: -15.1MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2023-12-02 22:55:18,662 INFO L158 Benchmark]: CodeCheck took 197785.60ms. Allocated memory was 209.7MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 90.1MB in the beginning and 694.6MB in the end (delta: -604.5MB). Peak memory consumption was 770.2MB. Max. memory is 16.1GB. [2023-12-02 22:55:18,663 INFO L158 Benchmark]: Witness Printer took 146.39ms. Allocated memory is still 1.6GB. Free memory was 694.6MB in the beginning and 679.7MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 22:55:18,665 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: 197.6s, OverallIterations: 42, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13273 SdHoareTripleChecker+Valid, 105.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11909 mSDsluCounter, 4354 SdHoareTripleChecker+Invalid, 95.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3695 mSDsCounter, 4851 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37363 IncrementalHoareTripleChecker+Invalid, 42214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4851 mSolverCounterUnsat, 659 mSDtfsCounter, 37363 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11413 GetRequests, 9920 SyntacticMatches, 511 SemanticMatches, 982 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585731 ImplicationChecksByTransitivity, 140.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 60.8s InterpolantComputationTime, 1154 NumberOfCodeBlocks, 1154 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1065 ConstructedInterpolants, 0 QuantifiedInterpolants, 9796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 10 PerfectInterpolantSequences, 121/644 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 567]: 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] char id2 ; [L61] unsigned char r2 ; [L62] char st2 ; [L63] char nl2 ; [L64] char m2 ; [L65] char max2 ; [L66] _Bool mode2 ; [L67] char id3 ; [L68] unsigned char r3 ; [L69] char st3 ; [L70] char nl3 ; [L71] char m3 ; [L72] char max3 ; [L73] _Bool mode3 ; [L489] int c1 ; [L490] int i2 ; [L493] c1 = 0 [L494] ep12 = __VERIFIER_nondet_bool() [L495] ep13 = __VERIFIER_nondet_bool() [L496] ep21 = __VERIFIER_nondet_bool() [L497] ep23 = __VERIFIER_nondet_bool() [L498] ep31 = __VERIFIER_nondet_bool() [L499] ep32 = __VERIFIER_nondet_bool() [L500] id1 = __VERIFIER_nondet_char() [L501] r1 = __VERIFIER_nondet_uchar() [L502] st1 = __VERIFIER_nondet_char() [L503] nl1 = __VERIFIER_nondet_char() [L504] m1 = __VERIFIER_nondet_char() [L505] max1 = __VERIFIER_nondet_char() [L506] mode1 = __VERIFIER_nondet_bool() [L507] id2 = __VERIFIER_nondet_char() [L508] r2 = __VERIFIER_nondet_uchar() [L509] st2 = __VERIFIER_nondet_char() [L510] nl2 = __VERIFIER_nondet_char() [L511] m2 = __VERIFIER_nondet_char() [L512] max2 = __VERIFIER_nondet_char() [L513] mode2 = __VERIFIER_nondet_bool() [L514] id3 = __VERIFIER_nondet_char() [L515] r3 = __VERIFIER_nondet_uchar() [L516] st3 = __VERIFIER_nondet_char() [L517] nl3 = __VERIFIER_nondet_char() [L518] m3 = __VERIFIER_nondet_char() [L519] max3 = __VERIFIER_nondet_char() [L520] mode3 = __VERIFIER_nondet_bool() [L521] CALL, EXPR init() [L214] _Bool r121 ; [L215] _Bool r131 ; [L216] _Bool r211 ; [L217] _Bool r231 ; [L218] _Bool r311 ; [L219] _Bool r321 ; [L220] _Bool r122 ; [L221] int tmp ; [L222] _Bool r132 ; [L223] int tmp___0 ; [L224] _Bool r212 ; [L225] int tmp___1 ; [L226] _Bool r232 ; [L227] int tmp___2 ; [L228] _Bool r312 ; [L229] int tmp___3 ; [L230] _Bool r322 ; [L231] int tmp___4 ; [L232] int tmp___5 ; [L235] r121 = ep12 [L236] r131 = ep13 [L237] r211 = ep21 [L238] r231 = ep23 [L239] r311 = ep31 [L240] r321 = ep32 [L241] COND TRUE \read(r121) [L242] tmp = 1 [L253] r122 = (_Bool )tmp [L254] COND FALSE !(\read(r131)) [L257] COND TRUE \read(r121) [L258] COND TRUE \read(ep23) [L259] tmp___0 = 1 [L266] r132 = (_Bool )tmp___0 [L267] COND FALSE !(\read(r211)) [L270] COND TRUE \read(r231) [L271] COND TRUE \read(ep31) [L272] tmp___1 = 1 [L279] r212 = (_Bool )tmp___1 [L280] COND TRUE \read(r231) [L281] tmp___2 = 1 [L292] r232 = (_Bool )tmp___2 [L293] COND TRUE \read(r311) [L294] tmp___3 = 1 [L305] r312 = (_Bool )tmp___3 [L306] COND TRUE \read(r321) [L307] tmp___4 = 1 [L318] r322 = (_Bool )tmp___4 [L319] COND TRUE (int )id1 != (int )id2 [L320] COND TRUE (int )id1 != (int )id3 [L321] COND TRUE (int )id2 != (int )id3 [L322] COND TRUE (int )id1 >= 0 [L323] COND TRUE (int )id2 >= 0 [L324] COND TRUE (int )id3 >= 0 [L325] COND TRUE (int )r1 == 0 [L326] COND TRUE (int )r2 == 0 [L327] COND TRUE (int )r3 == 0 [L328] COND TRUE \read(r122) [L329] COND TRUE \read(r132) [L330] COND TRUE \read(r212) [L331] COND TRUE \read(r232) [L332] COND TRUE \read(r312) [L333] COND TRUE \read(r322) [L334] COND TRUE (int )max1 == (int )id1 [L335] COND TRUE (int )max2 == (int )id2 [L336] COND TRUE (int )max3 == (int )id3 [L337] COND TRUE (int )st1 == 0 [L338] COND TRUE (int )st2 == 0 [L339] COND TRUE (int )st3 == 0 [L340] COND TRUE (int )nl1 == 0 [L341] COND TRUE (int )nl2 == 0 [L342] COND TRUE (int )nl3 == 0 [L343] COND TRUE (int )mode1 == 0 [L344] COND TRUE (int )mode2 == 0 [L345] COND TRUE (int )mode3 == 0 [L346] tmp___5 = 1 [L428] return (tmp___5); [L521] RET, EXPR init() [L521] i2 = init() [L522] CALL assume_abort_if_not(i2) [L22] COND FALSE !(!cond) [L522] RET assume_abort_if_not(i2) [L523] p12_old = nomsg [L524] p12_new = nomsg [L525] p13_old = nomsg [L526] p13_new = nomsg [L527] p21_old = nomsg [L528] p21_new = nomsg [L529] p23_old = nomsg [L530] p23_new = nomsg [L531] p31_old = nomsg [L532] p31_new = nomsg [L533] p32_old = nomsg [L534] p32_new = nomsg [L535] i2 = 0 VAL [c1=0, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, i2=0, id1=1, id2=0, id3=3, m1=2, m2=4, m3=4, max1=1, max2=0, max3=3, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L536] COND TRUE 1 [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND TRUE \read(ep12) [L109] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND TRUE \read(ep32) [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=2, m2=4, m3=4, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=2, m2=4, m3=4, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=2, m2=4, m3=4, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=2, m2=4, m3=4, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=2, m2=4, m3=4, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=2, m2=4, m3=4, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=2, m2=4, m3=4, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=2, m2=4, m3=4, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=2, m2=4, m3=4, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=2, m2=4, m3=4, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=2, m2=4, m3=4, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=2, m2=4, m3=4, max1=1, max2=0, max3=3, mode1=1, mode2=1, mode3=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=0, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND TRUE (int )m1 > (int )max1 [L95] max1 = m1 [L98] COND FALSE !((int )r1 == 2) [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND TRUE (int )m2 > (int )max2 [L134] max2 = m2 [L137] COND TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND TRUE (int )m2 > (int )max2 [L141] max2 = m2 [L144] COND FALSE !((int )r2 == 2) [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND FALSE !((int )r3 == 2) [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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] [L445] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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 TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=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] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND FALSE !(\read(mode1)) [L107] COND TRUE (int )r1 < 2 [L108] COND TRUE \read(ep12) [L109] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L111] COND FALSE !(\read(ep13)) [L115] mode1 = (_Bool)1 [L538] RET node1() [L539] CALL node2() [L125] COND FALSE !(\read(mode2)) [L153] COND TRUE (int )r2 < 2 [L154] COND FALSE !(\read(ep21)) [L157] COND TRUE \read(ep23) [L158] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L161] mode2 = (_Bool)1 [L539] RET node2() [L540] CALL node3() [L171] COND FALSE !(\read(mode3)) [L199] COND TRUE (int )r3 < 2 [L200] COND TRUE \read(ep31) [L201] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L203] COND TRUE \read(ep32) [L204] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L207] mode3 = (_Bool)1 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L436] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L437] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L438] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L439] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L440] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L443] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE (int )r1 < 2 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L450] COND FALSE !((int )r1 >= 2) VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L453] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE (int )r1 < 2 [L456] tmp = 1 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0, tmp=1] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=0, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=3, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L554] RET assert(c1) [L536] COND TRUE 1 [L538] CALL node1() [L79] COND TRUE \read(mode1) [L80] COND FALSE !(r1 == 255) [L83] r1 = r1 + 1 [L84] COND FALSE !(\read(ep21)) [L91] COND TRUE \read(ep31) [L92] m1 = p31_old [L93] p31_old = nomsg [L94] COND FALSE !((int )m1 > (int )max1) [L98] COND TRUE (int )r1 == 2 [L99] COND FALSE !((int )max1 == (int )id1) [L102] st1 = (char)1 [L105] mode1 = (_Bool)0 [L538] RET node1() [L539] CALL node2() [L125] COND TRUE \read(mode2) [L126] COND FALSE !(r2 == 255) [L129] r2 = r2 + 1 [L130] COND TRUE \read(ep12) [L131] m2 = p12_old [L132] p12_old = nomsg [L133] COND FALSE !((int )m2 > (int )max2) [L137] COND TRUE \read(ep32) [L138] m2 = p32_old [L139] p32_old = nomsg [L140] COND FALSE !((int )m2 > (int )max2) [L144] COND TRUE (int )r2 == 2 [L145] COND FALSE !((int )max2 == (int )id2) [L148] nl2 = (char)1 [L151] mode2 = (_Bool)0 [L539] RET node2() [L540] CALL node3() [L171] COND TRUE \read(mode3) [L172] COND FALSE !(r3 == 255) [L175] r3 = r3 + 1 [L176] COND FALSE !(\read(ep13)) [L183] COND TRUE \read(ep23) [L184] m3 = p23_old [L185] p23_old = nomsg [L186] COND FALSE !((int )m3 > (int )max3) [L190] COND TRUE (int )r3 == 2 [L191] COND TRUE (int )max3 == (int )id3 [L192] st3 = (char)1 [L197] mode3 = (_Bool)0 [L540] RET node3() [L541] p12_old = p12_new [L542] p12_new = nomsg [L543] p13_old = p13_new [L544] p13_new = nomsg [L545] p21_old = p21_new [L546] p21_new = nomsg [L547] p23_old = p23_new [L548] p23_new = nomsg [L549] p31_old = p31_new [L550] p31_new = nomsg [L551] p32_old = p32_new [L552] p32_new = nomsg [L553] CALL, EXPR check() [L433] int tmp ; VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L436] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L482] tmp = 0 VAL [ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1, tmp=0] [L484] return (tmp); [L553] RET, EXPR check() [L553] c1 = check() [L554] CALL assert(c1) [L565] COND TRUE ! arg VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L567] reach_error() VAL [\old(arg)=0, arg=0, ep12=255, ep13=0, ep21=0, ep23=1, ep31=1, ep32=255, id1=1, id2=0, id3=3, m1=3, m2=3, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 93.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.91ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 81.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.75ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 77.4MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.13ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 75.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1506.17ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 75.0MB in the beginning and 90.1MB in the end (delta: -15.1MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. * CodeCheck took 197785.60ms. Allocated memory was 209.7MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 90.1MB in the beginning and 694.6MB in the end (delta: -604.5MB). Peak memory consumption was 770.2MB. Max. memory is 16.1GB. * Witness Printer took 146.39ms. Allocated memory is still 1.6GB. Free memory was 694.6MB in the beginning and 679.7MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-02 22:55:18,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0384bd6-39c9-44cb-88e6-2884f0b88dff/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE