./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_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/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_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b --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-12-05 21:26:48,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 21:26:48,638 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-12-05 21:26:48,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 21:26:48,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 21:26:48,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 21:26:48,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 21:26:48,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 21:26:48,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 21:26:48,664 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 21:26:48,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 21:26:48,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 21:26:48,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 21:26:48,664 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-05 21:26:48,664 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-05 21:26:48,664 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-05 21:26:48,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 21:26:48,664 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-05 21:26:48,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 21:26:48,665 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 21:26:48,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 21:26:48,665 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 21:26:48,665 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 21:26:48,665 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 21:26:48,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 21:26:48,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 21:26:48,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 21:26:48,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 21:26:48,666 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 21:26:48,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 21:26:48,666 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_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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-12-05 21:26:48,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 21:26:48,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 21:26:48,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 21:26:48,881 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 21:26:48,881 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 21:26:48,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-12-05 21:26:51,618 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/data/39d8feca6/52d8bcea38274df5b98b9ef122615e86/FLAG40647cb56 [2024-12-05 21:26:51,876 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 21:26:51,877 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-12-05 21:26:51,888 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/data/39d8feca6/52d8bcea38274df5b98b9ef122615e86/FLAG40647cb56 [2024-12-05 21:26:51,904 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/data/39d8feca6/52d8bcea38274df5b98b9ef122615e86 [2024-12-05 21:26:51,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 21:26:51,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 21:26:51,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 21:26:51,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 21:26:51,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 21:26:51,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:26:51" (1/1) ... [2024-12-05 21:26:51,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0b96b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:51, skipping insertion in model container [2024-12-05 21:26:51,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:26:51" (1/1) ... [2024-12-05 21:26:51,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 21:26:52,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 21:26:52,179 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 21:26:52,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 21:26:52,241 INFO L204 MainTranslator]: Completed translation [2024-12-05 21:26:52,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52 WrapperNode [2024-12-05 21:26:52,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 21:26:52,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 21:26:52,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 21:26:52,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 21:26:52,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,282 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2024-12-05 21:26:52,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 21:26:52,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 21:26:52,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 21:26:52,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 21:26:52,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 21:26:52,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 21:26:52,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 21:26:52,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 21:26:52,312 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 21:26:52,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 21:26:52,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 21:26:52,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 21:26:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-05 21:26:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-12-05 21:26:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-12-05 21:26:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-05 21:26:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 21:26:52,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 21:26:52,455 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 21:26:52,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 21:26:52,789 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-12-05 21:26:52,789 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 21:26:52,827 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 21:26:52,827 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-05 21:26:52,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:26:52 BoogieIcfgContainer [2024-12-05 21:26:52,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 21:26:52,828 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 21:26:52,829 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 21:26:52,838 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 21:26:52,839 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:26:52" (1/1) ... [2024-12-05 21:26:52,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 21:26:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 129 states and 136 transitions. [2024-12-05 21:26:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2024-12-05 21:26:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-05 21:26:52,890 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:52,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 128 states and 135 transitions. [2024-12-05 21:26:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2024-12-05 21:26:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-05 21:26:53,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:53,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:53,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 127 states and 134 transitions. [2024-12-05 21:26:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2024-12-05 21:26:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-05 21:26:53,271 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:53,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 126 states and 133 transitions. [2024-12-05 21:26:53,327 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 133 transitions. [2024-12-05 21:26:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-05 21:26:53,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:53,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 125 states and 132 transitions. [2024-12-05 21:26:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2024-12-05 21:26:53,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-05 21:26:53,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 126 states and 134 transitions. [2024-12-05 21:26:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2024-12-05 21:26:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 21:26:53,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:53,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:53,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 125 states and 133 transitions. [2024-12-05 21:26:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2024-12-05 21:26:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 21:26:53,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:54,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 124 states and 132 transitions. [2024-12-05 21:26:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2024-12-05 21:26:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-05 21:26:54,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:54,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 128 states and 140 transitions. [2024-12-05 21:26:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2024-12-05 21:26:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-05 21:26:54,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:54,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:54,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 132 states and 151 transitions. [2024-12-05 21:26:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2024-12-05 21:26:55,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-05 21:26:55,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:55,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 136 states and 156 transitions. [2024-12-05 21:26:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2024-12-05 21:26:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 21:26:55,795 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:55,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 136 states and 154 transitions. [2024-12-05 21:26:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2024-12-05 21:26:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 21:26:56,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 137 states and 157 transitions. [2024-12-05 21:26:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2024-12-05 21:26:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 21:26:56,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:56,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:26:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 126 states and 134 transitions. [2024-12-05 21:26:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2024-12-05 21:26:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 21:26:56,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:56,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:56,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:26:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:26:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 136 states and 151 transitions. [2024-12-05 21:26:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2024-12-05 21:26:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 21:26:58,023 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:26:58,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:26:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:26:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 146 states and 168 transitions. [2024-12-05 21:27:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 168 transitions. [2024-12-05 21:27:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 21:27:00,734 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:00,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-05 21:27:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 147 states and 170 transitions. [2024-12-05 21:27:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2024-12-05 21:27:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 21:27:01,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:27:02,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 148 states and 172 transitions. [2024-12-05 21:27:02,128 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2024-12-05 21:27:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-05 21:27:02,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 21:27:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 147 states and 171 transitions. [2024-12-05 21:27:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2024-12-05 21:27:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-05 21:27:02,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:27:02,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 148 states and 172 transitions. [2024-12-05 21:27:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 172 transitions. [2024-12-05 21:27:02,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-05 21:27:02,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:02,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 21:27:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 147 states and 171 transitions. [2024-12-05 21:27:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2024-12-05 21:27:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-05 21:27:02,908 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:02,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:27:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 148 states and 173 transitions. [2024-12-05 21:27:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2024-12-05 21:27:03,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-05 21:27:03,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:03,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 118 states and 125 transitions. [2024-12-05 21:27:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2024-12-05 21:27:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-05 21:27:04,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:27:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 117 states and 124 transitions. [2024-12-05 21:27:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2024-12-05 21:27:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-05 21:27:04,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:04,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:09,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 116 states and 123 transitions. [2024-12-05 21:27:09,720 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2024-12-05 21:27:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-05 21:27:09,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:09,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:27:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 115 states and 122 transitions. [2024-12-05 21:27:12,762 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2024-12-05 21:27:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-05 21:27:12,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:12,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:27:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 114 states and 121 transitions. [2024-12-05 21:27:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2024-12-05 21:27:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-05 21:27:18,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:18,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 113 states and 120 transitions. [2024-12-05 21:27:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2024-12-05 21:27:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-05 21:27:27,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:27,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:27:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 112 states and 119 transitions. [2024-12-05 21:27:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2024-12-05 21:27:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-05 21:27:39,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:39,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 21:27:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 111 states and 118 transitions. [2024-12-05 21:27:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2024-12-05 21:27:41,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-05 21:27:41,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:41,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:27:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:27:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 110 states and 117 transitions. [2024-12-05 21:27:53,827 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2024-12-05 21:27:53,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-05 21:27:53,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:27:53,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:27:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:27:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:28:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 109 states and 116 transitions. [2024-12-05 21:28:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2024-12-05 21:28:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 21:28:01,374 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:01,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:28:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 108 states and 115 transitions. [2024-12-05 21:28:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2024-12-05 21:28:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 21:28:04,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:04,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:28:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 107 states and 114 transitions. [2024-12-05 21:28:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2024-12-05 21:28:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-05 21:28:07,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:07,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:28:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 106 states and 113 transitions. [2024-12-05 21:28:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2024-12-05 21:28:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-05 21:28:09,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:09,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:28:12,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 105 states and 112 transitions. [2024-12-05 21:28:12,522 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2024-12-05 21:28:12,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-05 21:28:12,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:12,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:28:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 104 states and 111 transitions. [2024-12-05 21:28:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2024-12-05 21:28:14,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-05 21:28:14,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:14,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:28:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 103 states and 110 transitions. [2024-12-05 21:28:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2024-12-05 21:28:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-05 21:28:17,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:28:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 102 states and 109 transitions. [2024-12-05 21:28:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2024-12-05 21:28:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-05 21:28:21,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:21,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:28:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 101 states and 108 transitions. [2024-12-05 21:28:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2024-12-05 21:28:24,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-05 21:28:24,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:28:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 100 states and 107 transitions. [2024-12-05 21:28:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2024-12-05 21:28:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-05 21:28:28,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:28,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:28:31,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 99 states and 106 transitions. [2024-12-05 21:28:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2024-12-05 21:28:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-05 21:28:31,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:31,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:28:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 98 states and 105 transitions. [2024-12-05 21:28:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-12-05 21:28:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-05 21:28:35,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:35,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:35,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-12-05 21:28:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 97 states and 104 transitions. [2024-12-05 21:28:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2024-12-05 21:28:38,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-05 21:28:38,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:38,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:28:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:28:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 96 states and 103 transitions. [2024-12-05 21:28:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-12-05 21:28:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-05 21:28:50,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:28:50,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:28:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:28:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:29:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 95 states and 102 transitions. [2024-12-05 21:29:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-12-05 21:29:03,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-05 21:29:03,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:03,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:29:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 94 states and 101 transitions. [2024-12-05 21:29:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-12-05 21:29:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-05 21:29:12,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:12,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:29:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 93 states and 100 transitions. [2024-12-05 21:29:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-12-05 21:29:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-05 21:29:37,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:37,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:29:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 92 states and 99 transitions. [2024-12-05 21:29:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-12-05 21:29:46,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-05 21:29:46,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:46,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:29:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 91 states and 98 transitions. [2024-12-05 21:29:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2024-12-05 21:29:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-05 21:29:55,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:29:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 90 states and 97 transitions. [2024-12-05 21:29:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2024-12-05 21:29:56,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-05 21:29:56,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:56,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:29:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 89 states and 96 transitions. [2024-12-05 21:29:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-12-05 21:29:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-05 21:29:59,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:59,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:59,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-12-05 21:29:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:29:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 88 states and 95 transitions. [2024-12-05 21:29:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-12-05 21:29:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-05 21:29:59,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:29:59,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:29:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:29:59,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:30:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:30:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 87 states and 94 transitions. [2024-12-05 21:30:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-12-05 21:30:02,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-05 21:30:02,124 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:30:02,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:30:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:30:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:30:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:30:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 86 states and 93 transitions. [2024-12-05 21:30:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-12-05 21:30:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-05 21:30:02,183 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:30:02,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:30:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:30:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:30:05,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:30:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 85 states and 92 transitions. [2024-12-05 21:30:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-12-05 21:30:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-05 21:30:05,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:30:05,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:30:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:30:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:30:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:30:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 84 states and 91 transitions. [2024-12-05 21:30:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-12-05 21:30:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-05 21:30:07,807 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:30:07,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:30:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:30:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:30:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:30:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 83 states and 90 transitions. [2024-12-05 21:30:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-12-05 21:30:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-05 21:30:10,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:30:10,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:30:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:30:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:30:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:30:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 82 states and 89 transitions. [2024-12-05 21:30:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-12-05 21:30:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-05 21:30:13,272 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:30:13,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:30:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:30:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:30:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:30:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 81 states and 88 transitions. [2024-12-05 21:30:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2024-12-05 21:30:16,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-05 21:30:16,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:30:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:30:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:30:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 21:30:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:30:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 80 states and 87 transitions. [2024-12-05 21:30:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-12-05 21:30:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-05 21:30:18,771 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:30:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:30:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:30:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:30:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:30:22,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 79 states and 86 transitions. [2024-12-05 21:30:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-12-05 21:30:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-05 21:30:22,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:30:22,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:30:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:30:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:30:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:30:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 78 states and 85 transitions. [2024-12-05 21:30:33,273 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-12-05 21:30:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-05 21:30:33,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:30:33,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:30:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:30:37,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:30:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:30:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 77 states and 84 transitions. [2024-12-05 21:30:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-12-05 21:30:43,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-05 21:30:43,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:30:43,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:30:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:30:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:30:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:30:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 76 states and 83 transitions. [2024-12-05 21:30:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-12-05 21:30:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-05 21:30:50,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:30:50,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:30:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:30:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:30:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:30:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 75 states and 82 transitions. [2024-12-05 21:30:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-12-05 21:30:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-05 21:30:58,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:30:58,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:30:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:30:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:31:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:31:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 74 states and 81 transitions. [2024-12-05 21:31:07,072 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-12-05 21:31:07,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-05 21:31:07,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:31:07,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:31:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:31:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:31:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:31:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 73 states and 80 transitions. [2024-12-05 21:31:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-12-05 21:31:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-05 21:31:10,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:31:10,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:31:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:31:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:31:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:31:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 75 states and 86 transitions. [2024-12-05 21:31:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2024-12-05 21:31:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-05 21:31:55,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:31:55,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:31:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:32:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:32:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:32:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 75 states and 85 transitions. [2024-12-05 21:32:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-12-05 21:32:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-05 21:32:15,624 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:32:15,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:32:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:32:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:32:26,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:32:26,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 75 states and 84 transitions. [2024-12-05 21:32:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2024-12-05 21:32:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-05 21:32:26,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:32:26,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:32:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:32:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:32:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:32:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 75 states and 83 transitions. [2024-12-05 21:32:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2024-12-05 21:32:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-05 21:32:43,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:32:43,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:32:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:32:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:32:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:32:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 75 states and 82 transitions. [2024-12-05 21:32:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-12-05 21:32:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-05 21:32:54,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 21:32:54,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 21:32:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 21:32:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 21:33:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 21:33:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 72 states and 79 transitions. [2024-12-05 21:33:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-12-05 21:33:00,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-05 21:33:00,272 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 74 iterations. [2024-12-05 21:33:00,278 INFO L726 CodeCheckObserver]: All specifications hold 62 specifications checked. All of them hold [2024-12-05 21:33:03,889 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE(line 589) no Hoare annotation was computed. [2024-12-05 21:33:03,890 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE(line 604) no Hoare annotation was computed. [2024-12-05 21:33:03,890 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,890 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-12-05 21:33:03,890 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE(line 612) no Hoare annotation was computed. [2024-12-05 21:33:03,890 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,890 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-12-05 21:33:03,891 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-12-05 21:33:03,891 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-12-05 21:33:03,891 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 617 623) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-12-05 21:33:03,891 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE(line 594) no Hoare annotation was computed. [2024-12-05 21:33:03,891 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-12-05 21:33:03,891 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE(line 598) no Hoare annotation was computed. [2024-12-05 21:33:03,891 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE(line 591) no Hoare annotation was computed. [2024-12-05 21:33:03,891 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,892 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-12-05 21:33:03,892 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE(line 601) no Hoare annotation was computed. [2024-12-05 21:33:03,892 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-12-05 21:33:03,892 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE(line 607) no Hoare annotation was computed. [2024-12-05 21:33:03,892 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-12-05 21:33:03,893 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-12-05 21:33:03,893 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-12-05 21:33:03,893 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-12-05 21:33:03,893 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,893 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-12-05 21:33:03,893 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE(line 613) no Hoare annotation was computed. [2024-12-05 21:33:03,893 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,893 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-12-05 21:33:03,893 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE(line 610) no Hoare annotation was computed. [2024-12-05 21:33:03,893 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE(line 600) no Hoare annotation was computed. [2024-12-05 21:33:03,894 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE(line 595) no Hoare annotation was computed. [2024-12-05 21:33:03,894 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE(line 591) no Hoare annotation was computed. [2024-12-05 21:33:03,894 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-12-05 21:33:03,894 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-12-05 21:33:03,894 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-12-05 21:33:03,894 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE(line 607) no Hoare annotation was computed. [2024-12-05 21:33:03,894 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-12-05 21:33:03,894 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE(line 612) no Hoare annotation was computed. [2024-12-05 21:33:03,894 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,895 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-12-05 21:33:03,895 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-12-05 21:33:03,895 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-12-05 21:33:03,895 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-05 21:33:03,895 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE(line 600) no Hoare annotation was computed. [2024-12-05 21:33:03,895 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE(line 594) no Hoare annotation was computed. [2024-12-05 21:33:03,895 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE(line 603) no Hoare annotation was computed. [2024-12-05 21:33:03,895 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-12-05 21:33:03,895 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE(line 592) no Hoare annotation was computed. [2024-12-05 21:33:03,895 INFO L77 FloydHoareUtils]: At program point L608-2(lines 585 616) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-12-05 21:33:03,895 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-12-05 21:33:03,896 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-12-05 21:33:03,896 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE(line 609) no Hoare annotation was computed. [2024-12-05 21:33:03,896 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,896 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-12-05 21:33:03,896 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,896 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-12-05 21:33:03,896 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-12-05 21:33:03,896 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE(line 610) no Hoare annotation was computed. [2024-12-05 21:33:03,896 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-12-05 21:33:03,896 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE(line 601) no Hoare annotation was computed. [2024-12-05 21:33:03,896 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE(line 595) no Hoare annotation was computed. [2024-12-05 21:33:03,896 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,897 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-12-05 21:33:03,897 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-12-05 21:33:03,897 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-12-05 21:33:03,897 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE(line 591) no Hoare annotation was computed. [2024-12-05 21:33:03,897 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-12-05 21:33:03,897 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE(line 603) no Hoare annotation was computed. [2024-12-05 21:33:03,897 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-12-05 21:33:03,898 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-12-05 21:33:03,898 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-12-05 21:33:03,898 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE(line 607) no Hoare annotation was computed. [2024-12-05 21:33:03,898 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-12-05 21:33:03,898 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,898 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE(line 613) no Hoare annotation was computed. [2024-12-05 21:33:03,898 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,898 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE(line 609) no Hoare annotation was computed. [2024-12-05 21:33:03,898 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE(line 601) no Hoare annotation was computed. [2024-12-05 21:33:03,898 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE(line 595) no Hoare annotation was computed. [2024-12-05 21:33:03,898 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-12-05 21:33:03,898 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-12-05 21:33:03,899 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-12-05 21:33:03,899 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE(line 589) no Hoare annotation was computed. [2024-12-05 21:33:03,899 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE(line 604) no Hoare annotation was computed. [2024-12-05 21:33:03,899 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,899 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE(line 612) no Hoare annotation was computed. [2024-12-05 21:33:03,899 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-12-05 21:33:03,899 INFO L77 FloydHoareUtils]: At program point L561(line 561) the Hoare annotation is: true [2024-12-05 21:33:03,899 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-12-05 21:33:03,899 INFO L77 FloydHoareUtils]: At program point L561-1(line 561) the Hoare annotation is: true [2024-12-05 21:33:03,899 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-12-05 21:33:03,900 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-12-05 21:33:03,900 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE(line 592) no Hoare annotation was computed. [2024-12-05 21:33:03,900 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE(line 598) no Hoare annotation was computed. [2024-12-05 21:33:03,900 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE(line 603) no Hoare annotation was computed. [2024-12-05 21:33:03,901 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-05 21:33:03,901 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-12-05 21:33:03,901 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-12-05 21:33:03,901 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK(lines 617 623) no Hoare annotation was computed. [2024-12-05 21:33:03,901 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-12-05 21:33:03,901 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,901 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-12-05 21:33:03,901 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-12-05 21:33:03,901 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-12-05 21:33:03,901 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE(line 598) no Hoare annotation was computed. [2024-12-05 21:33:03,901 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE(line 610) no Hoare annotation was computed. [2024-12-05 21:33:03,902 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,902 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-12-05 21:33:03,902 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE(line 592) no Hoare annotation was computed. [2024-12-05 21:33:03,902 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-12-05 21:33:03,902 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-12-05 21:33:03,902 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-12-05 21:33:03,902 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE(line 604) no Hoare annotation was computed. [2024-12-05 21:33:03,902 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE(line 589) no Hoare annotation was computed. [2024-12-05 21:33:03,902 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-12-05 21:33:03,902 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-12-05 21:33:03,903 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-12-05 21:33:03,903 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-12-05 21:33:03,903 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-12-05 21:33:03,903 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,903 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE(line 613) no Hoare annotation was computed. [2024-12-05 21:33:03,903 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 21:33:03,903 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE(line 609) no Hoare annotation was computed. [2024-12-05 21:33:03,903 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-12-05 21:33:03,903 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE(line 594) no Hoare annotation was computed. [2024-12-05 21:33:03,904 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE(line 600) no Hoare annotation was computed. [2024-12-05 21:33:03,904 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-12-05 21:33:03,904 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-12-05 21:33:03,904 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-12-05 21:33:03,913 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-05 21:33:03,914 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:33:03,918 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-12-05 21:33:03,918 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-12-05 21:33:03,918 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-12-05 21:33:03,919 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayStoreExpression[IdentifierExpression[#valid,GLOBAL],[IdentifierExpression[~head~0!base,]],IntegerLiteral[0]] [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-05 21:33:03,920 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-05 21:33:03,922 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-12-05 21:33:03,922 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-12-05 21:33:03,922 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-12-05 21:33:03,922 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-12-05 21:33:03,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:33:03,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 21:33:03,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:33:03,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 21:33:03,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-12-05 21:33:03,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-12-05 21:33:03,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-12-05 21:33:03,923 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-12-05 21:33:03,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:33:03,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 21:33:03,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-05 21:33:03,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-05 21:33:03,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-12-05 21:33:03,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-12-05 21:33:03,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-12-05 21:33:03,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-12-05 21:33:03,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-12-05 21:33:03,924 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-12-05 21:33:03,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-12-05 21:33:03,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-12-05 21:33:03,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-12-05 21:33:03,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-12-05 21:33:03,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-12-05 21:33:03,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-12-05 21:33:03,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-12-05 21:33:03,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-05 21:33:03,925 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-05 21:33:03,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-05 21:33:03,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-05 21:33:03,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-12-05 21:33:03,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-12-05 21:33:03,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-12-05 21:33:03,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:33:03,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 21:33:03,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:33:03,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 21:33:03,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-05 21:33:03,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-05 21:33:03,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-12-05 21:33:03,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-12-05 21:33:03,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-12-05 21:33:03,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-12-05 21:33:03,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-12-05 21:33:03,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-05 21:33:03,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-05 21:33:03,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-05 21:33:03,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-05 21:33:03,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-12-05 21:33:03,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-12-05 21:33:03,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-12-05 21:33:03,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 21:33:03,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-12-05 21:33:03,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-05 21:33:03,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-05 21:33:03,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-12-05 21:33:03,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-12-05 21:33:03,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-12-05 21:33:03,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-12-05 21:33:03,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-12-05 21:33:03,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-12-05 21:33:03,928 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-12-05 21:33:03,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 09:33:03 ImpRootNode [2024-12-05 21:33:03,930 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 21:33:03,931 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 21:33:03,931 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 21:33:03,931 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 21:33:03,932 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:26:52" (3/4) ... [2024-12-05 21:33:03,934 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-05 21:33:03,941 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-12-05 21:33:03,942 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-12-05 21:33:03,942 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-12-05 21:33:03,942 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-05 21:33:04,018 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 21:33:04,018 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 21:33:04,018 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 21:33:04,019 INFO L158 Benchmark]: Toolchain (without parser) took 372111.01ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 92.2MB in the beginning and 1.1GB in the end (delta: -972.8MB). Peak memory consumption was 483.0MB. Max. memory is 16.1GB. [2024-12-05 21:33:04,019 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 21:33:04,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.09ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 75.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-05 21:33:04,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.26ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 73.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 21:33:04,019 INFO L158 Benchmark]: Boogie Preprocessor took 27.22ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 71.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 21:33:04,020 INFO L158 Benchmark]: RCFGBuilder took 516.96ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 47.0MB in the end (delta: 24.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-05 21:33:04,020 INFO L158 Benchmark]: CodeCheck took 371102.02ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 46.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 441.0MB. Max. memory is 16.1GB. [2024-12-05 21:33:04,020 INFO L158 Benchmark]: Witness Printer took 87.20ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 21:33:04,021 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: 367.4s, 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, 92.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22348 mSDsluCounter, 18013 SdHoareTripleChecker+Invalid, 81.6s 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.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13489 GetRequests, 11365 SyntacticMatches, 626 SemanticMatches, 1498 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350611 ImplicationChecksByTransitivity, 352.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 61.5s 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.32ms. Allocated memory is still 117.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.09ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 75.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.26ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 73.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.22ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 71.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 516.96ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 47.0MB in the end (delta: 24.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 371102.02ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 46.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 441.0MB. Max. memory is 16.1GB. * Witness Printer took 87.20ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB 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-12-05 21:33:04,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c1db35c0-43e5-4c15-aede-0f85b0bfebf1/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE