./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 05:21:50,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 05:21:50,985 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-11-25 05:21:50,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 05:21:50,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 05:21:51,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 05:21:51,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 05:21:51,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 05:21:51,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 05:21:51,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 05:21:51,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 05:21:51,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 05:21:51,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 05:21:51,032 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-25 05:21:51,033 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-25 05:21:51,033 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-25 05:21:51,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 05:21:51,033 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-25 05:21:51,033 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 05:21:51,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 05:21:51,034 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 05:21:51,034 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 05:21:51,034 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 05:21:51,034 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 05:21:51,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 05:21:51,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 05:21:51,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 05:21:51,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 05:21:51,035 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 05:21:51,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 05:21:51,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2024-11-25 05:21:51,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 05:21:51,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 05:21:51,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 05:21:51,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 05:21:51,424 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 05:21:51,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-11-25 05:21:54,449 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/data/88917a0a9/ca23e8989f9f4e6e86dc9cf1a0a14b76/FLAG1cbfd9d68 [2024-11-25 05:21:54,835 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 05:21:54,835 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-11-25 05:21:54,846 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/data/88917a0a9/ca23e8989f9f4e6e86dc9cf1a0a14b76/FLAG1cbfd9d68 [2024-11-25 05:21:55,027 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/data/88917a0a9/ca23e8989f9f4e6e86dc9cf1a0a14b76 [2024-11-25 05:21:55,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 05:21:55,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 05:21:55,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 05:21:55,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 05:21:55,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 05:21:55,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cbbca02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55, skipping insertion in model container [2024-11-25 05:21:55,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 05:21:55,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 05:21:55,370 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 05:21:55,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 05:21:55,476 INFO L204 MainTranslator]: Completed translation [2024-11-25 05:21:55,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55 WrapperNode [2024-11-25 05:21:55,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 05:21:55,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 05:21:55,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 05:21:55,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 05:21:55,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,533 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2024-11-25 05:21:55,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 05:21:55,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 05:21:55,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 05:21:55,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 05:21:55,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,568 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 05:21:55,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 05:21:55,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 05:21:55,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 05:21:55,593 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:21:55" (1/1) ... [2024-11-25 05:21:55,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 05:21:55,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 05:21:55,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 05:21:55,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 05:21:55,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-25 05:21:55,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-25 05:21:55,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-25 05:21:55,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-25 05:21:55,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 05:21:55,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 05:21:55,809 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 05:21:55,811 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 05:21:56,219 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-25 05:21:56,219 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 05:21:56,267 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 05:21:56,267 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-25 05:21:56,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:21:56 BoogieIcfgContainer [2024-11-25 05:21:56,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 05:21:56,268 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 05:21:56,268 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 05:21:56,279 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 05:21:56,279 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:21:56" (1/1) ... [2024-11-25 05:21:56,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 05:21:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:21:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 129 states and 136 transitions. [2024-11-25 05:21:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2024-11-25 05:21:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-25 05:21:56,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:21:56,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:21:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:21:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:21:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:21:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 128 states and 135 transitions. [2024-11-25 05:21:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2024-11-25 05:21:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-25 05:21:56,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:21:56,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:21:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:21:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:21:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:21:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 127 states and 134 transitions. [2024-11-25 05:21:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2024-11-25 05:21:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-25 05:21:56,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:21:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:21:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:21:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:21:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:21:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 126 states and 133 transitions. [2024-11-25 05:21:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2024-11-25 05:21:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-25 05:21:57,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:21:57,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:21:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:21:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:21:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:21:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 125 states and 132 transitions. [2024-11-25 05:21:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2024-11-25 05:21:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-25 05:21:57,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:21:57,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:21:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:21:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:21:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:21:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 126 states and 134 transitions. [2024-11-25 05:21:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2024-11-25 05:21:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 05:21:57,601 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:21:57,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:21:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:21:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:21:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:21:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 125 states and 133 transitions. [2024-11-25 05:21:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2024-11-25 05:21:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-25 05:21:57,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:21:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:21:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:21:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:21:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:21:58,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 124 states and 132 transitions. [2024-11-25 05:21:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2024-11-25 05:21:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 05:21:58,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:21:58,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:21:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:21:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:21:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:21:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 128 states and 140 transitions. [2024-11-25 05:21:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2024-11-25 05:21:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 05:21:58,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:21:58,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:21:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:21:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:21:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:21:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 132 states and 151 transitions. [2024-11-25 05:21:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2024-11-25 05:21:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 05:21:59,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:21:59,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:21:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:21:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:22:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 136 states and 156 transitions. [2024-11-25 05:22:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2024-11-25 05:22:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 05:22:00,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:00,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:22:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 136 states and 154 transitions. [2024-11-25 05:22:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2024-11-25 05:22:00,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 05:22:00,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:00,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:22:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 137 states and 157 transitions. [2024-11-25 05:22:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2024-11-25 05:22:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 05:22:01,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:01,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:22:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 126 states and 134 transitions. [2024-11-25 05:22:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2024-11-25 05:22:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 05:22:01,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:01,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:22:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 136 states and 151 transitions. [2024-11-25 05:22:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2024-11-25 05:22:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 05:22:03,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:03,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:22:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 146 states and 168 transitions. [2024-11-25 05:22:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 168 transitions. [2024-11-25 05:22:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 05:22:07,291 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:07,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 05:22:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 147 states and 170 transitions. [2024-11-25 05:22:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2024-11-25 05:22:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 05:22:08,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:08,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:22:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 148 states and 172 transitions. [2024-11-25 05:22:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2024-11-25 05:22:09,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 05:22:09,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:09,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 05:22:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 147 states and 171 transitions. [2024-11-25 05:22:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2024-11-25 05:22:09,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 05:22:09,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:22:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 148 states and 172 transitions. [2024-11-25 05:22:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2024-11-25 05:22:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 05:22:10,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:10,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 05:22:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 147 states and 171 transitions. [2024-11-25 05:22:10,234 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2024-11-25 05:22:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 05:22:10,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:22:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 148 states and 173 transitions. [2024-11-25 05:22:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2024-11-25 05:22:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 05:22:11,404 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:11,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:22:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 118 states and 125 transitions. [2024-11-25 05:22:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2024-11-25 05:22:12,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-25 05:22:12,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:12,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:22:12,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 117 states and 124 transitions. [2024-11-25 05:22:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2024-11-25 05:22:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-25 05:22:12,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:12,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:22:18,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 116 states and 123 transitions. [2024-11-25 05:22:18,852 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2024-11-25 05:22:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-25 05:22:18,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:22:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 115 states and 122 transitions. [2024-11-25 05:22:22,689 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2024-11-25 05:22:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-25 05:22:22,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:22:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 114 states and 121 transitions. [2024-11-25 05:22:29,217 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2024-11-25 05:22:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 05:22:29,217 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:29,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:22:42,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 113 states and 120 transitions. [2024-11-25 05:22:42,318 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2024-11-25 05:22:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 05:22:42,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:42,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:22:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:22:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 112 states and 119 transitions. [2024-11-25 05:22:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2024-11-25 05:22:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 05:22:57,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:22:57,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:22:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:22:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 05:23:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 111 states and 118 transitions. [2024-11-25 05:23:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2024-11-25 05:23:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 05:23:00,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:00,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 110 states and 117 transitions. [2024-11-25 05:23:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2024-11-25 05:23:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 05:23:16,136 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:16,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:23:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 109 states and 116 transitions. [2024-11-25 05:23:26,168 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2024-11-25 05:23:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 05:23:26,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:23:30,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 108 states and 115 transitions. [2024-11-25 05:23:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2024-11-25 05:23:30,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 05:23:30,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:30,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 107 states and 114 transitions. [2024-11-25 05:23:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2024-11-25 05:23:34,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 05:23:34,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:34,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:23:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 106 states and 113 transitions. [2024-11-25 05:23:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2024-11-25 05:23:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 05:23:38,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:23:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 105 states and 112 transitions. [2024-11-25 05:23:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2024-11-25 05:23:41,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 05:23:41,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:41,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 104 states and 111 transitions. [2024-11-25 05:23:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2024-11-25 05:23:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 05:23:44,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:23:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 103 states and 110 transitions. [2024-11-25 05:23:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2024-11-25 05:23:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 05:23:48,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:48,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:23:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 102 states and 109 transitions. [2024-11-25 05:23:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2024-11-25 05:23:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 05:23:54,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:54,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:23:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:23:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 101 states and 108 transitions. [2024-11-25 05:23:57,974 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2024-11-25 05:23:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 05:23:57,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:23:57,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:23:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:23:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:24:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 100 states and 107 transitions. [2024-11-25 05:24:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2024-11-25 05:24:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 05:24:03,305 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:03,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:24:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 99 states and 106 transitions. [2024-11-25 05:24:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2024-11-25 05:24:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 05:24:08,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:08,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:24:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 98 states and 105 transitions. [2024-11-25 05:24:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-11-25 05:24:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 05:24:13,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:13,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:24:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 97 states and 104 transitions. [2024-11-25 05:24:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2024-11-25 05:24:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 05:24:17,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:17,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:24:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 96 states and 103 transitions. [2024-11-25 05:24:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-11-25 05:24:33,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 05:24:33,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:33,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:24:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:24:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 95 states and 102 transitions. [2024-11-25 05:24:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-25 05:24:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 05:24:50,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:24:50,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:24:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:24:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:25:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 94 states and 101 transitions. [2024-11-25 05:25:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-11-25 05:25:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 05:25:02,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:02,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:25:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 93 states and 100 transitions. [2024-11-25 05:25:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-11-25 05:25:35,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 05:25:35,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:35,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:25:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 92 states and 99 transitions. [2024-11-25 05:25:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-11-25 05:25:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 05:25:47,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:47,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:25:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:25:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:25:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 91 states and 98 transitions. [2024-11-25 05:25:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2024-11-25 05:25:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 05:25:59,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:25:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:25:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:26:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:00,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 90 states and 97 transitions. [2024-11-25 05:26:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2024-11-25 05:26:00,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 05:26:00,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:00,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:26:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 89 states and 96 transitions. [2024-11-25 05:26:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-11-25 05:26:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 05:26:03,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:03,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:26:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 88 states and 95 transitions. [2024-11-25 05:26:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-11-25 05:26:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 05:26:04,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:04,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:26:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 87 states and 94 transitions. [2024-11-25 05:26:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-11-25 05:26:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 05:26:07,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:07,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:26:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 86 states and 93 transitions. [2024-11-25 05:26:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-11-25 05:26:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 05:26:07,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:07,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:26:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 85 states and 92 transitions. [2024-11-25 05:26:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-11-25 05:26:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 05:26:11,565 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:26:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 84 states and 91 transitions. [2024-11-25 05:26:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-11-25 05:26:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 05:26:14,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:14,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:26:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:18,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 83 states and 90 transitions. [2024-11-25 05:26:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-11-25 05:26:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 05:26:18,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:26:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 82 states and 89 transitions. [2024-11-25 05:26:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-11-25 05:26:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 05:26:22,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:22,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:26:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 81 states and 88 transitions. [2024-11-25 05:26:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2024-11-25 05:26:25,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 05:26:25,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:25,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 05:26:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 80 states and 87 transitions. [2024-11-25 05:26:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-11-25 05:26:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 05:26:28,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:28,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:26:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:32,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 79 states and 86 transitions. [2024-11-25 05:26:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-25 05:26:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 05:26:32,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:32,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:26:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:26:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 78 states and 85 transitions. [2024-11-25 05:26:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-25 05:26:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 05:26:46,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:26:46,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:26:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:26:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:27:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:27:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 77 states and 84 transitions. [2024-11-25 05:27:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-11-25 05:27:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 05:27:01,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:27:01,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:27:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:27:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:27:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:27:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 76 states and 83 transitions. [2024-11-25 05:27:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-11-25 05:27:12,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 05:27:12,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:27:12,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:27:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:27:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:27:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:27:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 75 states and 82 transitions. [2024-11-25 05:27:23,971 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-11-25 05:27:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 05:27:23,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:27:23,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:27:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:27:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:27:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:27:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 74 states and 81 transitions. [2024-11-25 05:27:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-11-25 05:27:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 05:27:34,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:27:34,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:27:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:27:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:27:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:27:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 73 states and 80 transitions. [2024-11-25 05:27:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-11-25 05:27:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-25 05:27:38,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:27:38,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:27:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:27:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:28:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:28:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 75 states and 86 transitions. [2024-11-25 05:28:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2024-11-25 05:28:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-25 05:28:32,870 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:28:32,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:28:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:28:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:28:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:28:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 75 states and 85 transitions. [2024-11-25 05:28:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-11-25 05:28:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-25 05:28:56,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:28:56,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:28:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:28:57,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:29:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:29:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 75 states and 84 transitions. [2024-11-25 05:29:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2024-11-25 05:29:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-25 05:29:10,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:29:10,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:29:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:29:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:29:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:29:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 75 states and 83 transitions. [2024-11-25 05:29:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-11-25 05:29:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-25 05:29:30,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:29:30,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:29:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:29:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:29:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:29:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 75 states and 82 transitions. [2024-11-25 05:29:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-11-25 05:29:45,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-25 05:29:45,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 05:29:45,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 05:29:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 05:29:48,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 05:29:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 05:29:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 72 states and 79 transitions. [2024-11-25 05:29:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-25 05:29:53,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 05:29:53,021 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 74 iterations. [2024-11-25 05:29:53,029 INFO L726 CodeCheckObserver]: All specifications hold 62 specifications checked. All of them hold [2024-11-25 05:29:57,345 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE(line 589) no Hoare annotation was computed. [2024-11-25 05:29:57,345 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE(line 604) no Hoare annotation was computed. [2024-11-25 05:29:57,345 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,345 INFO L77 FloydHoareUtils]: At program point L597(lines 597 615) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-25 05:29:57,346 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE(line 612) no Hoare annotation was computed. [2024-11-25 05:29:57,346 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,348 INFO L77 FloydHoareUtils]: At program point L589(line 589) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-25 05:29:57,348 INFO L77 FloydHoareUtils]: At program point L589-1(line 589) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-25 05:29:57,348 INFO L77 FloydHoareUtils]: At program point L589-2(line 589) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-25 05:29:57,348 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 617 623) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-25 05:29:57,348 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE(line 594) no Hoare annotation was computed. [2024-11-25 05:29:57,348 INFO L77 FloydHoareUtils]: At program point L581(line 581) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse3 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (store |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse1 (select .cse3 0))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= (select |#valid| .cse0) 1) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= .cse1 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (< .cse0 |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) (= (select .cse2 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (store (store .cse2 .cse1 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)))) [2024-11-25 05:29:57,349 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE(line 598) no Hoare annotation was computed. [2024-11-25 05:29:57,349 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE(line 591) no Hoare annotation was computed. [2024-11-25 05:29:57,349 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,349 INFO L77 FloydHoareUtils]: At program point L573(lines 573 575) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) (.cse4 (store |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (.cse1 (<= (+ |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse5 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse6 (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|)) (.cse7 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse8 (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)) (.cse9 (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse11 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse10 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse3 (= (store .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) (and .cse0 (< 7 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store .cse4 |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) .cse1 .cse2 (< |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) .cse3 .cse5 .cse6 (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) .cse7 .cse8 .cse9 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse11 (not .cse10)))) [2024-11-25 05:29:57,349 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE(line 601) no Hoare annotation was computed. [2024-11-25 05:29:57,349 INFO L77 FloydHoareUtils]: At program point L573-1(lines 573 575) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) (.cse4 (store |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (.cse1 (<= (+ |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse5 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse6 (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|)) (.cse7 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse8 (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)) (.cse9 (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse11 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse10 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse3 (= (store .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) (and .cse0 (< 7 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store .cse4 |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) .cse1 .cse2 (< |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) .cse3 .cse5 .cse6 (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) .cse7 .cse8 .cse9 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse11 (not .cse10)))) [2024-11-25 05:29:57,349 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE(line 607) no Hoare annotation was computed. [2024-11-25 05:29:57,350 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-25 05:29:57,350 INFO L77 FloydHoareUtils]: At program point L565(lines 565 567) the Hoare annotation is: (and (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8) (= (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) [2024-11-25 05:29:57,350 INFO L77 FloydHoareUtils]: At program point L598-1(line 598) the Hoare annotation is: (let ((.cse0 (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= |ULTIMATE.start_main_old_#valid#1| (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1))) [2024-11-25 05:29:57,350 INFO L77 FloydHoareUtils]: At program point L565-1(lines 565 567) the Hoare annotation is: (and (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8) (= (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) [2024-11-25 05:29:57,350 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,350 INFO L77 FloydHoareUtils]: At program point L598-2(line 598) the Hoare annotation is: (let ((.cse0 (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= |ULTIMATE.start_main_old_#valid#1| (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1))) [2024-11-25 05:29:57,350 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE(line 613) no Hoare annotation was computed. [2024-11-25 05:29:57,350 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,351 INFO L77 FloydHoareUtils]: At program point L590(lines 590 596) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,351 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE(line 610) no Hoare annotation was computed. [2024-11-25 05:29:57,351 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE(line 600) no Hoare annotation was computed. [2024-11-25 05:29:57,353 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE(line 595) no Hoare annotation was computed. [2024-11-25 05:29:57,353 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE(line 591) no Hoare annotation was computed. [2024-11-25 05:29:57,354 INFO L77 FloydHoareUtils]: At program point L607(line 607) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-25 05:29:57,354 INFO L77 FloydHoareUtils]: At program point L607-1(line 607) the Hoare annotation is: (and (= (store (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-25 05:29:57,354 INFO L77 FloydHoareUtils]: At program point L607-2(line 607) the Hoare annotation is: (and (= (store (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-25 05:29:57,354 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE(line 607) no Hoare annotation was computed. [2024-11-25 05:29:57,355 INFO L77 FloydHoareUtils]: At program point L599(lines 599 605) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-11-25 05:29:57,355 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE(line 612) no Hoare annotation was computed. [2024-11-25 05:29:57,355 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,355 INFO L77 FloydHoareUtils]: At program point L591(line 591) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,355 INFO L77 FloydHoareUtils]: At program point L591-1(line 591) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,355 INFO L77 FloydHoareUtils]: At program point L591-2(line 591) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,355 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 05:29:57,356 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE(line 600) no Hoare annotation was computed. [2024-11-25 05:29:57,356 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE(line 594) no Hoare annotation was computed. [2024-11-25 05:29:57,356 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE(line 603) no Hoare annotation was computed. [2024-11-25 05:29:57,356 INFO L77 FloydHoareUtils]: At program point L608(lines 608 614) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,356 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE(line 592) no Hoare annotation was computed. [2024-11-25 05:29:57,356 INFO L77 FloydHoareUtils]: At program point L608-2(lines 585 616) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-25 05:29:57,356 INFO L77 FloydHoareUtils]: At program point L600(line 600) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-11-25 05:29:57,357 INFO L77 FloydHoareUtils]: At program point L600-1(line 600) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-11-25 05:29:57,357 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE(line 609) no Hoare annotation was computed. [2024-11-25 05:29:57,357 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,357 INFO L77 FloydHoareUtils]: At program point L600-2(line 600) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-11-25 05:29:57,357 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,357 INFO L77 FloydHoareUtils]: At program point L592(line 592) the Hoare annotation is: (and (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-25 05:29:57,357 INFO L77 FloydHoareUtils]: At program point L592-1(line 592) the Hoare annotation is: (and (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-25 05:29:57,357 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE(line 610) no Hoare annotation was computed. [2024-11-25 05:29:57,358 INFO L77 FloydHoareUtils]: At program point L592-2(line 592) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-25 05:29:57,358 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE(line 601) no Hoare annotation was computed. [2024-11-25 05:29:57,358 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE(line 595) no Hoare annotation was computed. [2024-11-25 05:29:57,358 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,358 INFO L77 FloydHoareUtils]: At program point L609(line 609) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,358 INFO L77 FloydHoareUtils]: At program point L576(line 576) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1)) (.cse1 (<= (+ |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1) |#StackHeapBarrier|)) (.cse2 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse4 (store |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse5 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse6 (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|)) (.cse7 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse8 (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8)) (.cse9 (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse10 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse3 (= (store .cse4 |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) (let ((.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and .cse0 (< 7 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (= (store (store .cse4 .cse11 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (< |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) .cse3 .cse5 (<= (+ .cse11 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse11) .cse6 (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse11)) .cse7 .cse8 .cse9 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse10)))) [2024-11-25 05:29:57,358 INFO L77 FloydHoareUtils]: At program point L609-1(line 609) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,358 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE(line 591) no Hoare annotation was computed. [2024-11-25 05:29:57,359 INFO L77 FloydHoareUtils]: At program point L609-2(line 609) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,359 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE(line 603) no Hoare annotation was computed. [2024-11-25 05:29:57,359 INFO L77 FloydHoareUtils]: At program point L601(line 601) the Hoare annotation is: (and (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-25 05:29:57,359 INFO L77 FloydHoareUtils]: At program point L568(line 568) the Hoare annotation is: (and (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8) (= (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) [2024-11-25 05:29:57,359 INFO L77 FloydHoareUtils]: At program point L601-1(line 601) the Hoare annotation is: (and (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-25 05:29:57,359 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE(line 607) no Hoare annotation was computed. [2024-11-25 05:29:57,359 INFO L77 FloydHoareUtils]: At program point L601-2(line 601) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-25 05:29:57,359 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,359 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE(line 613) no Hoare annotation was computed. [2024-11-25 05:29:57,359 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,359 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE(line 609) no Hoare annotation was computed. [2024-11-25 05:29:57,359 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE(line 601) no Hoare annotation was computed. [2024-11-25 05:29:57,359 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE(line 595) no Hoare annotation was computed. [2024-11-25 05:29:57,360 INFO L77 FloydHoareUtils]: At program point L610(line 610) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,360 INFO L77 FloydHoareUtils]: At program point L610-1(line 610) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,360 INFO L77 FloydHoareUtils]: At program point L610-2(line 610) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,360 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE(line 589) no Hoare annotation was computed. [2024-11-25 05:29:57,360 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE(line 604) no Hoare annotation was computed. [2024-11-25 05:29:57,360 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,360 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE(line 612) no Hoare annotation was computed. [2024-11-25 05:29:57,360 INFO L77 FloydHoareUtils]: At program point L594(line 594) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,360 INFO L77 FloydHoareUtils]: At program point L561(line 561) the Hoare annotation is: true [2024-11-25 05:29:57,360 INFO L77 FloydHoareUtils]: At program point L594-1(line 594) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,360 INFO L77 FloydHoareUtils]: At program point L561-1(line 561) the Hoare annotation is: true [2024-11-25 05:29:57,360 INFO L77 FloydHoareUtils]: At program point L594-2(line 594) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,361 INFO L77 FloydHoareUtils]: At program point L586(line 586) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|))) (let ((.cse3 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0)) (.cse1 (select .cse6 0)) (.cse2 (select .cse6 4)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (.cse5 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (.cse0 (select .cse6 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (and (= (select |#valid| .cse0) 1) (not (= .cse1 .cse2)) (<= (+ .cse0 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (select .cse3 .cse2) 1) (= (select .cse4 .cse5) 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store .cse3 .cse1 0) .cse2 0) |ULTIMATE.start_main_old_#valid#1|) (= (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 8) (= (select .cse4 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0) (< (select .cse6 .cse5) |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| .cse0))))) [2024-11-25 05:29:57,366 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE(line 592) no Hoare annotation was computed. [2024-11-25 05:29:57,366 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE(line 598) no Hoare annotation was computed. [2024-11-25 05:29:57,366 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE(line 603) no Hoare annotation was computed. [2024-11-25 05:29:57,366 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 05:29:57,366 INFO L77 FloydHoareUtils]: At program point L603(line 603) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-11-25 05:29:57,367 INFO L77 FloydHoareUtils]: At program point L603-1(line 603) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-25 05:29:57,367 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK(lines 617 623) no Hoare annotation was computed. [2024-11-25 05:29:57,367 INFO L77 FloydHoareUtils]: At program point L603-2(line 603) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-25 05:29:57,367 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,367 INFO L77 FloydHoareUtils]: At program point L595(line 595) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,367 INFO L77 FloydHoareUtils]: At program point L595-1(line 595) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,367 INFO L77 FloydHoareUtils]: At program point L595-2(line 595) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,367 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE(line 598) no Hoare annotation was computed. [2024-11-25 05:29:57,367 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE(line 610) no Hoare annotation was computed. [2024-11-25 05:29:57,367 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,367 INFO L77 FloydHoareUtils]: At program point L587(line 587) the Hoare annotation is: (let ((.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|))) (let ((.cse0 (select .cse3 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (.cse1 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0)) (.cse2 (select .cse3 0))) (and (= (select |#valid| .cse0) 1) (= (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (<= (+ .cse0 1) |#StackHeapBarrier|) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| .cse0)) (= (store (store .cse1 .cse2 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|))))) [2024-11-25 05:29:57,367 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE(line 592) no Hoare annotation was computed. [2024-11-25 05:29:57,368 INFO L77 FloydHoareUtils]: At program point L612(line 612) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,368 INFO L77 FloydHoareUtils]: At program point L612-1(line 612) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,368 INFO L77 FloydHoareUtils]: At program point L612-2(line 612) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,368 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE(line 604) no Hoare annotation was computed. [2024-11-25 05:29:57,368 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE(line 589) no Hoare annotation was computed. [2024-11-25 05:29:57,368 INFO L77 FloydHoareUtils]: At program point L604(line 604) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,368 INFO L77 FloydHoareUtils]: At program point L604-1(line 604) the Hoare annotation is: (and (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,368 INFO L77 FloydHoareUtils]: At program point L604-2(line 604) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,369 INFO L77 FloydHoareUtils]: At program point L571-3(lines 571 580) the Hoare annotation is: (let ((.cse13 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse1 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (.cse4 (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse7 (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|)) (.cse10 (store |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse11 (not .cse13)) (.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse3 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse6 (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|)) (.cse8 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse9 (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8))) (or (let ((.cse12 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse12 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse5 (select .cse12 0))) (and .cse0 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) .cse1 (= (select |#valid| .cse2) 1) (<= (+ 1 .cse2) |#StackHeapBarrier|) (< |ULTIMATE.start_dll_circular_create_~len#1| 2) .cse3 .cse4 (not (= .cse5 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse6 .cse7 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) .cse8 .cse9 (= (store (store .cse10 .cse5 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse11))) (and .cse0 (<= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (< |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= (store .cse10 |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse11) (and .cse0 (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse3 (= (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse6 .cse8 .cse9 .cse13 (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|))))) [2024-11-25 05:29:57,369 INFO L77 FloydHoareUtils]: At program point L571-4(lines 571 580) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse2 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (select .cse2 0))) (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) |ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |#valid| .cse0) 1) (<= (+ 1 .cse0) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= 8 (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (not (= .cse1 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) (= (store (store (store |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) .cse1 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) [2024-11-25 05:29:57,369 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,369 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE(line 613) no Hoare annotation was computed. [2024-11-25 05:29:57,369 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-25 05:29:57,369 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE(line 609) no Hoare annotation was computed. [2024-11-25 05:29:57,369 INFO L77 FloydHoareUtils]: At program point L588(lines 588 615) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-25 05:29:57,369 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE(line 594) no Hoare annotation was computed. [2024-11-25 05:29:57,369 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE(line 600) no Hoare annotation was computed. [2024-11-25 05:29:57,369 INFO L77 FloydHoareUtils]: At program point L613(line 613) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,370 INFO L77 FloydHoareUtils]: At program point L613-1(line 613) the Hoare annotation is: (and (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,370 INFO L77 FloydHoareUtils]: At program point L613-2(line 613) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-25 05:29:57,390 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 05:29:57,391 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 05:29:57,395 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-25 05:29:57,396 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-25 05:29:57,396 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-25 05:29:57,397 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-25 05:29:57,397 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 05:29:57,397 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 05:29:57,397 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 05:29:57,398 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 05:29:57,398 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-25 05:29:57,398 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-25 05:29:57,398 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-25 05:29:57,398 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-25 05:29:57,398 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-25 05:29:57,398 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-25 05:29:57,398 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-25 05:29:57,399 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-25 05:29:57,399 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-25 05:29:57,399 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-25 05:29:57,399 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-25 05:29:57,399 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-25 05:29:57,399 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-25 05:29:57,399 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-25 05:29:57,399 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-25 05:29:57,400 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-25 05:29:57,400 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-25 05:29:57,400 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 05:29:57,400 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 05:29:57,400 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-25 05:29:57,400 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayStoreExpression[IdentifierExpression[#valid,GLOBAL],[IdentifierExpression[~head~0!base,]],IntegerLiteral[0]] [2024-11-25 05:29:57,401 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-25 05:29:57,401 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 05:29:57,403 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-25 05:29:57,405 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-25 05:29:57,406 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-25 05:29:57,406 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-25 05:29:57,406 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 05:29:57,406 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 05:29:57,406 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 05:29:57,406 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 05:29:57,406 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-25 05:29:57,406 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-25 05:29:57,406 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-25 05:29:57,406 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-25 05:29:57,407 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 05:29:57,407 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 05:29:57,407 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 05:29:57,407 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 05:29:57,407 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-25 05:29:57,407 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-25 05:29:57,407 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-25 05:29:57,407 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-25 05:29:57,407 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-25 05:29:57,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-25 05:29:57,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-25 05:29:57,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-25 05:29:57,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-25 05:29:57,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-25 05:29:57,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-25 05:29:57,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-25 05:29:57,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-25 05:29:57,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 05:29:57,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 05:29:57,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-25 05:29:57,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 05:29:57,408 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-25 05:29:57,409 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-25 05:29:57,409 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-25 05:29:57,410 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 05:29:57,411 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 05:29:57,411 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 05:29:57,411 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 05:29:57,411 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 05:29:57,412 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 05:29:57,412 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-25 05:29:57,412 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-25 05:29:57,412 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-25 05:29:57,412 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-25 05:29:57,412 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-25 05:29:57,412 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 05:29:57,412 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 05:29:57,413 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-25 05:29:57,413 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 05:29:57,413 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-25 05:29:57,413 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-25 05:29:57,413 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-25 05:29:57,414 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-25 05:29:57,414 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-25 05:29:57,414 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-25 05:29:57,414 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-25 05:29:57,415 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-25 05:29:57,415 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-25 05:29:57,415 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-25 05:29:57,415 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-25 05:29:57,415 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-25 05:29:57,415 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-25 05:29:57,415 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-25 05:29:57,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 05:29:57 ImpRootNode [2024-11-25 05:29:57,418 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 05:29:57,422 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 05:29:57,424 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 05:29:57,424 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 05:29:57,425 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:21:56" (3/4) ... [2024-11-25 05:29:57,428 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 05:29:57,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-25 05:29:57,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-25 05:29:57,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-25 05:29:57,441 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 05:29:57,536 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 05:29:57,536 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 05:29:57,536 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 05:29:57,537 INFO L158 Benchmark]: Toolchain (without parser) took 482506.67ms. Allocated memory was 117.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 92.3MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 324.9MB. Max. memory is 16.1GB. [2024-11-25 05:29:57,538 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 05:29:57,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.00ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 75.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 05:29:57,539 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.77ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 73.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 05:29:57,539 INFO L158 Benchmark]: Boogie Preprocessor took 53.69ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 71.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 05:29:57,539 INFO L158 Benchmark]: RCFGBuilder took 679.56ms. Allocated memory is still 117.4MB. Free memory was 71.9MB in the beginning and 46.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 05:29:57,540 INFO L158 Benchmark]: CodeCheck took 481150.14ms. Allocated memory was 117.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 46.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 274.6MB. Max. memory is 16.1GB. [2024-11-25 05:29:57,540 INFO L158 Benchmark]: Witness Printer took 114.32ms. Allocated memory is still 1.9GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 05:29:57,542 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, 129 locations, 62 error locations. Started 1 CEGAR loops. OverallTime: 476.7s, OverallIterations: 74, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23134 SdHoareTripleChecker+Valid, 117.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22348 mSDsluCounter, 18013 SdHoareTripleChecker+Invalid, 103.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16478 mSDsCounter, 13571 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69385 IncrementalHoareTripleChecker+Invalid, 82956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13571 mSolverCounterUnsat, 1535 mSDtfsCounter, 69385 mSolverCounterSat, 1.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13495 GetRequests, 11371 SyntacticMatches, 626 SemanticMatches, 1498 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350611 ImplicationChecksByTransitivity, 456.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 81.6s InterpolantComputationTime, 1550 NumberOfCodeBlocks, 1550 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 1477 ConstructedInterpolants, 0 QuantifiedInterpolants, 13343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 73 InterpolantComputations, 38 PerfectInterpolantSequences, 188/382 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 589]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 591]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 591]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 591]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 601]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 601]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 601]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 604]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 607]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 607]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 607]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 609]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 609]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 609]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 610]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 610]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 610]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 612]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 612]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 612]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 613]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 613]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 613]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 617]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 62 specifications checked. All of them hold - InvariantResult [Line: 571]: Loop Invariant Derived loop invariant: (((len < 2) || ((2 <= len) && (len < 3))) || ((len <= 3) && (3 <= len))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 167.8MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.00ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 75.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.77ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 73.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.69ms. Allocated memory is still 117.4MB. Free memory was 73.7MB in the beginning and 71.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 679.56ms. Allocated memory is still 117.4MB. Free memory was 71.9MB in the beginning and 46.8MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 481150.14ms. Allocated memory was 117.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 46.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 274.6MB. Max. memory is 16.1GB. * Witness Printer took 114.32ms. Allocated memory is still 1.9GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayStoreExpression[IdentifierExpression[#valid,GLOBAL],[IdentifierExpression[~head~0!base,]],IntegerLiteral[0]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base RESULT: Ultimate proved your program to be correct! [2024-11-25 05:29:57,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2678c13-ea69-4a7d-82bd-c03cca66ee3f/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE