./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/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_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk --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.2.5-dev-a016563 [2024-11-08 22:25:28,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:25:29,033 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-11-08 22:25:29,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:25:29,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 22:25:29,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:25:29,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:25:29,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:25:29,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:25:29,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:25:29,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:25:29,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:25:29,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:25:29,067 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 22:25:29,067 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 22:25:29,068 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 22:25:29,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:25:29,069 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:25:29,069 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 22:25:29,069 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:25:29,070 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:25:29,071 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 22:25:29,071 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 22:25:29,071 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 22:25:29,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:25:29,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:25:29,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:25:29,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:25:29,074 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 22:25:29,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:25:29,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2024-11-08 22:25:29,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:25:29,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:25:29,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:25:29,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:25:29,458 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:25:29,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i Unable to find full path for "g++" [2024-11-08 22:25:31,714 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:25:32,087 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:25:32,087 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-11-08 22:25:32,103 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/data/461ffbb3b/1b402a69d2be4ef987fd2330b9f1fb0b/FLAGb1047ee0c [2024-11-08 22:25:32,119 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/data/461ffbb3b/1b402a69d2be4ef987fd2330b9f1fb0b [2024-11-08 22:25:32,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:25:32,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:25:32,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:25:32,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:25:32,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:25:32,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:25:32" (1/1) ... [2024-11-08 22:25:32,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f23357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:25:32, skipping insertion in model container [2024-11-08 22:25:32,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:25:32" (1/1) ... [2024-11-08 22:25:32,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:25:32,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:25:32,710 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:25:32,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:25:32,830 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:25:32,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:25:32 WrapperNode [2024-11-08 22:25:32,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:25:32,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:25:32,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:25:32,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:25:32,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:25:32" (1/1) ... [2024-11-08 22:25:32,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:25:32" (1/1) ... [2024-11-08 22:25:32,953 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2024-11-08 22:25:32,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:25:32,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:25:32,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:25:32,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:25:32,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:25:32" (1/1) ... [2024-11-08 22:25:32,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:25:32" (1/1) ... [2024-11-08 22:25:32,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:25:32" (1/1) ... [2024-11-08 22:25:32,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:25:32" (1/1) ... [2024-11-08 22:25:33,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:25:32" (1/1) ... [2024-11-08 22:25:33,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:25:32" (1/1) ... [2024-11-08 22:25:33,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:25:32" (1/1) ... [2024-11-08 22:25:33,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:25:32" (1/1) ... [2024-11-08 22:25:33,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:25:33,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:25:33,049 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:25:33,049 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:25:33,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:25:32" (1/1) ... [2024-11-08 22:25:33,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 22:25:33,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 22:25:33,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 22:25:33,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 22:25:33,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 22:25:33,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-08 22:25:33,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-08 22:25:33,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 22:25:33,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:25:33,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:25:33,236 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:25:33,238 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:25:33,668 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-08 22:25:33,668 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:25:33,748 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:25:33,748 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 22:25:33,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:25:33 BoogieIcfgContainer [2024-11-08 22:25:33,749 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:25:33,749 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 22:25:33,750 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 22:25:33,777 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 22:25:33,777 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:25:33" (1/1) ... [2024-11-08 22:25:33,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:25:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 130 states and 138 transitions. [2024-11-08 22:25:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2024-11-08 22:25:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 22:25:33,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:33,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 129 states and 137 transitions. [2024-11-08 22:25:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2024-11-08 22:25:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-08 22:25:34,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:34,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 128 states and 136 transitions. [2024-11-08 22:25:34,541 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2024-11-08 22:25:34,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 22:25:34,541 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:34,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:34,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 127 states and 135 transitions. [2024-11-08 22:25:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2024-11-08 22:25:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 22:25:34,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:34,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:35,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 126 states and 134 transitions. [2024-11-08 22:25:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2024-11-08 22:25:35,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-08 22:25:35,048 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:35,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 127 states and 136 transitions. [2024-11-08 22:25:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2024-11-08 22:25:35,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 22:25:35,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:35,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:35,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 128 states and 137 transitions. [2024-11-08 22:25:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2024-11-08 22:25:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 22:25:35,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:35,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 127 states and 136 transitions. [2024-11-08 22:25:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2024-11-08 22:25:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 22:25:35,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:35,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:36,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 126 states and 135 transitions. [2024-11-08 22:25:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2024-11-08 22:25:36,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 22:25:36,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 131 states and 144 transitions. [2024-11-08 22:25:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2024-11-08 22:25:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 22:25:36,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 136 states and 156 transitions. [2024-11-08 22:25:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2024-11-08 22:25:37,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 22:25:37,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 140 states and 161 transitions. [2024-11-08 22:25:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2024-11-08 22:25:38,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-08 22:25:38,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:38,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 22:25:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 140 states and 160 transitions. [2024-11-08 22:25:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 160 transitions. [2024-11-08 22:25:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:25:38,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:38,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 142 states and 163 transitions. [2024-11-08 22:25:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2024-11-08 22:25:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:25:39,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 142 states and 162 transitions. [2024-11-08 22:25:39,968 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 162 transitions. [2024-11-08 22:25:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 22:25:39,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:39,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 128 states and 136 transitions. [2024-11-08 22:25:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2024-11-08 22:25:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:25:40,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:40,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 22:25:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:42,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 140 states and 155 transitions. [2024-11-08 22:25:42,911 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 155 transitions. [2024-11-08 22:25:42,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 22:25:42,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:42,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:46,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 152 states and 174 transitions. [2024-11-08 22:25:46,132 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2024-11-08 22:25:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 22:25:46,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:46,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:25:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 153 states and 177 transitions. [2024-11-08 22:25:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2024-11-08 22:25:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 22:25:47,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:47,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 22:25:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 154 states and 178 transitions. [2024-11-08 22:25:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2024-11-08 22:25:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 22:25:48,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:48,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 22:25:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 153 states and 177 transitions. [2024-11-08 22:25:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2024-11-08 22:25:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 22:25:48,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:48,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:25:49,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 154 states and 178 transitions. [2024-11-08 22:25:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2024-11-08 22:25:49,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 22:25:49,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:49,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 22:25:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 153 states and 177 transitions. [2024-11-08 22:25:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2024-11-08 22:25:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 22:25:49,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:49,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:50,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:25:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 154 states and 179 transitions. [2024-11-08 22:25:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2024-11-08 22:25:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:25:51,381 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:51,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:25:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:53,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 120 states and 127 transitions. [2024-11-08 22:25:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2024-11-08 22:25:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 22:25:53,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:53,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:25:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:25:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 119 states and 126 transitions. [2024-11-08 22:25:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2024-11-08 22:25:53,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:25:53,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:25:53,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:25:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:25:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:26:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 118 states and 125 transitions. [2024-11-08 22:26:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2024-11-08 22:26:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:26:01,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:01,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:26:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 117 states and 124 transitions. [2024-11-08 22:26:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2024-11-08 22:26:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 22:26:06,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:06,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:26:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 116 states and 123 transitions. [2024-11-08 22:26:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2024-11-08 22:26:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:26:14,992 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:14,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:26:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 115 states and 122 transitions. [2024-11-08 22:26:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2024-11-08 22:26:31,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:26:31,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:31,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:26:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 114 states and 121 transitions. [2024-11-08 22:26:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2024-11-08 22:26:50,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 22:26:50,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:50,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 22:26:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:26:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 113 states and 120 transitions. [2024-11-08 22:26:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2024-11-08 22:26:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:26:53,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:26:53,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:26:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:26:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 112 states and 119 transitions. [2024-11-08 22:27:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2024-11-08 22:27:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 22:27:10,876 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:10,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:27:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 111 states and 118 transitions. [2024-11-08 22:27:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2024-11-08 22:27:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 22:27:22,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:22,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:27:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 110 states and 117 transitions. [2024-11-08 22:27:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2024-11-08 22:27:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 22:27:25,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:25,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 109 states and 116 transitions. [2024-11-08 22:27:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2024-11-08 22:27:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:27:29,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:29,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:27:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 108 states and 115 transitions. [2024-11-08 22:27:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2024-11-08 22:27:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:27:35,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:35,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:27:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 107 states and 114 transitions. [2024-11-08 22:27:39,628 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2024-11-08 22:27:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:27:39,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:39,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:43,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 106 states and 113 transitions. [2024-11-08 22:27:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2024-11-08 22:27:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:27:43,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:43,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:27:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 105 states and 112 transitions. [2024-11-08 22:27:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2024-11-08 22:27:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:27:47,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:47,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:27:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 104 states and 111 transitions. [2024-11-08 22:27:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2024-11-08 22:27:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 22:27:53,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:53,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:27:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:27:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 103 states and 110 transitions. [2024-11-08 22:27:58,605 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2024-11-08 22:27:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 22:27:58,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:27:58,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:27:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:27:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:28:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 102 states and 109 transitions. [2024-11-08 22:28:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2024-11-08 22:28:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 22:28:05,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:28:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 101 states and 108 transitions. [2024-11-08 22:28:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2024-11-08 22:28:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 22:28:11,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:11,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:28:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 100 states and 107 transitions. [2024-11-08 22:28:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2024-11-08 22:28:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 22:28:16,501 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:16,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:28:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 99 states and 106 transitions. [2024-11-08 22:28:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2024-11-08 22:28:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 22:28:21,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:21,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:28:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:38,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 98 states and 105 transitions. [2024-11-08 22:28:38,244 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-11-08 22:28:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 22:28:38,245 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:38,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:28:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:28:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 97 states and 104 transitions. [2024-11-08 22:28:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2024-11-08 22:28:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:28:56,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:28:56,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:28:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:28:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:29:07,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:29:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 96 states and 103 transitions. [2024-11-08 22:29:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2024-11-08 22:29:07,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:29:07,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:29:07,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:29:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:29:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:29:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:29:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 95 states and 102 transitions. [2024-11-08 22:29:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-08 22:29:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:29:40,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:29:40,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:29:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:29:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:29:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:29:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 94 states and 101 transitions. [2024-11-08 22:29:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2024-11-08 22:29:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:29:52,572 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:29:52,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:29:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:29:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:30:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 93 states and 100 transitions. [2024-11-08 22:30:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2024-11-08 22:30:04,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:30:04,544 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:04,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:30:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 92 states and 99 transitions. [2024-11-08 22:30:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2024-11-08 22:30:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 22:30:04,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:04,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:30:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 91 states and 98 transitions. [2024-11-08 22:30:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2024-11-08 22:30:10,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 22:30:10,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:10,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:30:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 90 states and 97 transitions. [2024-11-08 22:30:10,983 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2024-11-08 22:30:10,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 22:30:10,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:10,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:30:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 89 states and 96 transitions. [2024-11-08 22:30:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2024-11-08 22:30:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 22:30:15,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:15,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:30:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 88 states and 95 transitions. [2024-11-08 22:30:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-11-08 22:30:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 22:30:15,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:15,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:30:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 87 states and 94 transitions. [2024-11-08 22:30:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2024-11-08 22:30:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 22:30:19,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:19,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:30:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 86 states and 93 transitions. [2024-11-08 22:30:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-11-08 22:30:22,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 22:30:22,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:22,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:30:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 85 states and 92 transitions. [2024-11-08 22:30:27,785 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-11-08 22:30:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 22:30:27,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:30:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:31,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 84 states and 91 transitions. [2024-11-08 22:30:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-11-08 22:30:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 22:30:31,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:31,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:30:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 83 states and 90 transitions. [2024-11-08 22:30:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-11-08 22:30:35,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 22:30:35,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:35,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 22:30:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 82 states and 89 transitions. [2024-11-08 22:30:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2024-11-08 22:30:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 22:30:38,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:38,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:30:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 81 states and 88 transitions. [2024-11-08 22:30:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2024-11-08 22:30:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 22:30:42,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:30:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:30:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:30:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 80 states and 87 transitions. [2024-11-08 22:30:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-11-08 22:30:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 22:30:57,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:30:57,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:30:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:31:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:31:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:31:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 79 states and 86 transitions. [2024-11-08 22:31:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-08 22:31:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 22:31:10,260 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:31:10,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:31:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:31:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:31:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:31:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 78 states and 85 transitions. [2024-11-08 22:31:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-08 22:31:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 22:31:21,152 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:31:21,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:31:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:31:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:31:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:31:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 77 states and 84 transitions. [2024-11-08 22:31:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-11-08 22:31:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 22:31:32,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:31:32,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:31:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:31:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:31:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:31:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 76 states and 83 transitions. [2024-11-08 22:31:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-11-08 22:31:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 22:31:46,939 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:31:46,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:31:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:31:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:31:52,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:31:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 75 states and 82 transitions. [2024-11-08 22:31:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2024-11-08 22:31:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 22:31:52,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:31:52,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:31:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:32:02,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:32:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:32:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 77 states and 88 transitions. [2024-11-08 22:32:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2024-11-08 22:32:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 22:32:51,734 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:32:51,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:32:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:32:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:33:16,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:33:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 77 states and 87 transitions. [2024-11-08 22:33:16,193 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-11-08 22:33:16,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 22:33:16,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:33:16,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:33:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:33:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 77 states and 86 transitions. [2024-11-08 22:33:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2024-11-08 22:33:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 22:33:30,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:33:30,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:33:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:33:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 77 states and 85 transitions. [2024-11-08 22:33:50,321 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2024-11-08 22:33:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 22:33:50,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:33:50,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:33:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:33:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 77 states and 84 transitions. [2024-11-08 22:34:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-11-08 22:34:07,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 22:34:07,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 22:34:07,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:34:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:34:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 22:34:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 22:34:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 74 states and 81 transitions. [2024-11-08 22:34:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2024-11-08 22:34:17,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 22:34:17,034 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 76 iterations. [2024-11-08 22:34:17,043 INFO L729 CodeCheckObserver]: All specifications hold 62 specifications checked. All of them hold [2024-11-08 22:34:22,044 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE(line 589) no Hoare annotation was computed. [2024-11-08 22:34:22,044 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE(line 604) no Hoare annotation was computed. [2024-11-08 22:34:22,044 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,045 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 (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (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) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-08 22:34:22,045 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE(line 612) no Hoare annotation was computed. [2024-11-08 22:34:22,045 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,045 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 (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (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) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-08 22:34:22,046 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 (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (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|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-08 22:34:22,046 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 (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (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|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-08 22:34:22,046 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 617 623) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-08 22:34:22,046 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE(line 594) no Hoare annotation was computed. [2024-11-08 22:34:22,046 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 |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) .cse1 0) |ULTIMATE.start_main_old_#valid#1|)))) [2024-11-08 22:34:22,047 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE(line 598) no Hoare annotation was computed. [2024-11-08 22:34:22,047 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE(line 591) no Hoare annotation was computed. [2024-11-08 22:34:22,047 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,047 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)) (.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)) (.cse4 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse5 (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|)) (.cse6 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse8 (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse7 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse10 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse9 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and (= (store (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse3 .cse4 .cse5 .cse6 (= .cse7 8) .cse8 .cse9 .cse10 (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) (and .cse0 .cse1 .cse2 (< |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (store (store (store |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8) .cse3 .cse4 .cse5 (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) .cse6 .cse8 (<= 8 .cse7) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse10 (not .cse9)))) [2024-11-08 22:34:22,048 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE(line 601) no Hoare annotation was computed. [2024-11-08 22:34:22,048 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)) (.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)) (.cse4 (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse5 (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|)) (.cse6 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse8 (= (select |#length| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 8)) (.cse7 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse10 (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse9 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and (= (store (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse3 .cse4 .cse5 .cse6 (= .cse7 8) .cse8 .cse9 .cse10 (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) (and .cse0 .cse1 .cse2 (< |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (store (store (store |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8) .cse3 .cse4 .cse5 (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) .cse6 .cse8 (<= 8 .cse7) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse10 (not .cse9)))) [2024-11-08 22:34:22,048 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE(line 607) no Hoare annotation was computed. [2024-11-08 22:34:22,049 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 (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (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) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-08 22:34:22,049 INFO L77 FloydHoareUtils]: At program point L565(lines 565 567) the Hoare annotation is: (and (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8) (= (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) [2024-11-08 22:34:22,049 INFO L77 FloydHoareUtils]: At program point L598-1(line 598) the Hoare annotation is: (let ((.cse0 (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= |ULTIMATE.start_main_old_#valid#1| (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1))) [2024-11-08 22:34:22,050 INFO L77 FloydHoareUtils]: At program point L565-1(lines 565 567) the Hoare annotation is: (and (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8) (= (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) [2024-11-08 22:34:22,050 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,050 INFO L77 FloydHoareUtils]: At program point L598-2(line 598) the Hoare annotation is: (let ((.cse0 (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= |ULTIMATE.start_main_old_#valid#1| (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1))) [2024-11-08 22:34:22,050 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE(line 613) no Hoare annotation was computed. [2024-11-08 22:34:22,050 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,051 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) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~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|) (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)) [2024-11-08 22:34:22,051 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE(line 610) no Hoare annotation was computed. [2024-11-08 22:34:22,051 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE(line 600) no Hoare annotation was computed. [2024-11-08 22:34:22,051 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE(line 595) no Hoare annotation was computed. [2024-11-08 22:34:22,051 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE(line 591) no Hoare annotation was computed. [2024-11-08 22:34:22,052 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 (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (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) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-08 22:34:22,052 INFO L77 FloydHoareUtils]: At program point L607-1(line 607) the Hoare annotation is: (and (= (store (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-08 22:34:22,052 INFO L77 FloydHoareUtils]: At program point L607-2(line 607) the Hoare annotation is: (and (= (store (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-08 22:34:22,053 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE(line 607) no Hoare annotation was computed. [2024-11-08 22:34:22,053 INFO L77 FloydHoareUtils]: At program point L599(lines 599 605) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-11-08 22:34:22,053 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE(line 612) no Hoare annotation was computed. [2024-11-08 22:34:22,053 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,053 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) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~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|) (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)) [2024-11-08 22:34:22,054 INFO L77 FloydHoareUtils]: At program point L591-1(line 591) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,054 INFO L77 FloydHoareUtils]: At program point L591-2(line 591) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,054 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 22:34:22,054 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE(line 600) no Hoare annotation was computed. [2024-11-08 22:34:22,055 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE(line 594) no Hoare annotation was computed. [2024-11-08 22:34:22,055 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE(line 603) no Hoare annotation was computed. [2024-11-08 22:34:22,055 INFO L77 FloydHoareUtils]: At program point L608(lines 608 614) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,055 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE(line 592) no Hoare annotation was computed. [2024-11-08 22:34:22,055 INFO L77 FloydHoareUtils]: At program point L608-2(lines 585 616) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-08 22:34:22,055 INFO L77 FloydHoareUtils]: At program point L600(line 600) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-11-08 22:34:22,056 INFO L77 FloydHoareUtils]: At program point L600-1(line 600) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-11-08 22:34:22,056 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE(line 609) no Hoare annotation was computed. [2024-11-08 22:34:22,056 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,056 INFO L77 FloydHoareUtils]: At program point L600-2(line 600) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-11-08 22:34:22,056 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,056 INFO L77 FloydHoareUtils]: At program point L592(line 592) the Hoare annotation is: (and (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-08 22:34:22,057 INFO L77 FloydHoareUtils]: At program point L592-1(line 592) the Hoare annotation is: (and (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-08 22:34:22,057 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE(line 610) no Hoare annotation was computed. [2024-11-08 22:34:22,057 INFO L77 FloydHoareUtils]: At program point L592-2(line 592) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-08 22:34:22,057 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE(line 601) no Hoare annotation was computed. [2024-11-08 22:34:22,057 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE(line 595) no Hoare annotation was computed. [2024-11-08 22:34:22,057 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,057 INFO L77 FloydHoareUtils]: At program point L609(line 609) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,058 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)) (.cse3 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse4 (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)) (.cse9 (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse8 (= (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 (let ((.cse5 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (and .cse0 .cse1 .cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0) 0) (< |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) .cse3 .cse4 (<= (+ .cse5 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse5) .cse6 (not (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse5)) .cse7 .cse8 (<= 8 .cse9) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store |#valid| |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) .cse5 0)) (not (= |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|)) .cse10)) (and (= (store (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse3 .cse4 .cse6 .cse7 (= .cse9 8) .cse8 (= |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|)))) [2024-11-08 22:34:22,058 INFO L77 FloydHoareUtils]: At program point L609-1(line 609) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,058 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE(line 591) no Hoare annotation was computed. [2024-11-08 22:34:22,058 INFO L77 FloydHoareUtils]: At program point L609-2(line 609) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,059 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE(line 603) no Hoare annotation was computed. [2024-11-08 22:34:22,059 INFO L77 FloydHoareUtils]: At program point L601(line 601) the Hoare annotation is: (and (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-08 22:34:22,060 INFO L77 FloydHoareUtils]: At program point L568(line 568) the Hoare annotation is: (and (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8) (= (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) [2024-11-08 22:34:22,060 INFO L77 FloydHoareUtils]: At program point L601-1(line 601) the Hoare annotation is: (and (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-08 22:34:22,060 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE(line 607) no Hoare annotation was computed. [2024-11-08 22:34:22,060 INFO L77 FloydHoareUtils]: At program point L601-2(line 601) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0))) [2024-11-08 22:34:22,060 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,061 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE(line 613) no Hoare annotation was computed. [2024-11-08 22:34:22,061 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,061 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE(line 609) no Hoare annotation was computed. [2024-11-08 22:34:22,061 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE(line 601) no Hoare annotation was computed. [2024-11-08 22:34:22,061 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE(line 595) no Hoare annotation was computed. [2024-11-08 22:34:22,062 INFO L77 FloydHoareUtils]: At program point L610(line 610) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,062 INFO L77 FloydHoareUtils]: At program point L610-1(line 610) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,062 INFO L77 FloydHoareUtils]: At program point L610-2(line 610) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,062 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE(line 589) no Hoare annotation was computed. [2024-11-08 22:34:22,062 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE(line 604) no Hoare annotation was computed. [2024-11-08 22:34:22,063 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,063 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE(line 612) no Hoare annotation was computed. [2024-11-08 22:34:22,063 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) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~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|) (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)) [2024-11-08 22:34:22,063 INFO L77 FloydHoareUtils]: At program point L561(line 561) the Hoare annotation is: true [2024-11-08 22:34:22,063 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) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~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|) (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)) [2024-11-08 22:34:22,064 INFO L77 FloydHoareUtils]: At program point L561-1(line 561) the Hoare annotation is: true [2024-11-08 22:34:22,064 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) (= |ULTIMATE.start_main_old_#valid#1| (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 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)) [2024-11-08 22:34:22,064 INFO L77 FloydHoareUtils]: At program point L586(line 586) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (.cse4 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))) (let ((.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|)) (.cse1 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0)) (.cse2 (select .cse5 .cse4)) (.cse0 (select .cse5 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (and (= (select |#valid| .cse0) 1) (<= (+ .cse0 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (= (select .cse1 .cse2) 1) (= (select .cse3 .cse4) 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 |#length| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 8) (= (select .cse3 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0) (= (store (store .cse1 (select .cse5 4) 0) (select .cse5 0) 0) |ULTIMATE.start_main_old_#valid#1|) (< .cse2 |#StackHeapBarrier|) (not (= .cse2 .cse0)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| .cse0))))) [2024-11-08 22:34:22,064 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE(line 592) no Hoare annotation was computed. [2024-11-08 22:34:22,065 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE(line 598) no Hoare annotation was computed. [2024-11-08 22:34:22,065 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE(line 603) no Hoare annotation was computed. [2024-11-08 22:34:22,065 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 22:34:22,065 INFO L77 FloydHoareUtils]: At program point L603(line 603) the Hoare annotation is: (let ((.cse0 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|))) [2024-11-08 22:34:22,065 INFO L77 FloydHoareUtils]: At program point L603-1(line 603) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (< |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-08 22:34:22,066 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK(lines 617 623) no Hoare annotation was computed. [2024-11-08 22:34:22,066 INFO L77 FloydHoareUtils]: At program point L603-2(line 603) the Hoare annotation is: (and (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 1)) [2024-11-08 22:34:22,066 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,066 INFO L77 FloydHoareUtils]: At program point L595(line 595) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,067 INFO L77 FloydHoareUtils]: At program point L595-1(line 595) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,067 INFO L77 FloydHoareUtils]: At program point L595-2(line 595) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,067 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE(line 598) no Hoare annotation was computed. [2024-11-08 22:34:22,067 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE(line 610) no Hoare annotation was computed. [2024-11-08 22:34:22,067 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,068 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 ((.cse1 (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0)) (.cse0 (select .cse3 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (.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|)) (= (store (store .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) .cse2 0) |ULTIMATE.start_main_old_#valid#1|) (<= (+ .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)) (not (= .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|))))) [2024-11-08 22:34:22,068 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE(line 592) no Hoare annotation was computed. [2024-11-08 22:34:22,068 INFO L77 FloydHoareUtils]: At program point L612(line 612) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,068 INFO L77 FloydHoareUtils]: At program point L612-1(line 612) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,069 INFO L77 FloydHoareUtils]: At program point L612-2(line 612) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 1) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,069 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE(line 604) no Hoare annotation was computed. [2024-11-08 22:34:22,069 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE(line 589) no Hoare annotation was computed. [2024-11-08 22:34:22,069 INFO L77 FloydHoareUtils]: At program point L604(line 604) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,069 INFO L77 FloydHoareUtils]: At program point L604-1(line 604) the Hoare annotation is: (and (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,070 INFO L77 FloydHoareUtils]: At program point L571-1(lines 571 580) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse2 (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8)) (.cse3 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse1 (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (.cse4 (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|)) (.cse5 (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and .cse0 (<= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (< |ULTIMATE.start_dll_circular_create_~len#1| 3) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (store .cse1 |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_dll_circular_create_~head~0#1.base| 1) |#StackHeapBarrier|) .cse5 (= (select |#length| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 8) (not .cse6)) (and .cse0 (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse2 .cse3 (= .cse1 |ULTIMATE.start_main_old_#valid#1|) .cse4 .cse5 .cse6 (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)))) [2024-11-08 22:34:22,070 INFO L77 FloydHoareUtils]: At program point L604-2(line 604) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,070 INFO L77 FloydHoareUtils]: At program point L571-3(lines 571 580) the Hoare annotation is: (let ((.cse10 (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse2 (store |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (.cse0 (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0)) (.cse1 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1)) (.cse3 (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8)) (.cse4 (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)) (.cse5 (<= (+ |ULTIMATE.start_dll_circular_create_~last~0#1.base| 1) |#StackHeapBarrier|)) (.cse6 (<= (+ |ULTIMATE.start_dll_circular_create_~head~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 (not .cse10))) (or (and .cse0 (<= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (< |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse1 (= (store .cse2 |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (<= |ULTIMATE.start_dll_circular_create_~len#1| 3) .cse3 .cse4 (= .cse2 |ULTIMATE.start_main_old_#valid#1|) .cse5 .cse7 .cse10 (<= 3 |ULTIMATE.start_dll_circular_create_~len#1|)) (let ((.cse13 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse11 (select .cse13 |ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse12 (select .cse13 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| .cse11) 1) .cse3 (<= (+ 1 .cse11) |#StackHeapBarrier|) (< |ULTIMATE.start_dll_circular_create_~len#1| 2) .cse4 (not (= .cse12 |ULTIMATE.start_dll_circular_create_~last~0#1.base|)) .cse5 .cse6 (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse11)) .cse7 .cse8 (= (store (store (store |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) .cse12 0) |ULTIMATE.start_main_old_#valid#1|) .cse9)))))) [2024-11-08 22:34:22,070 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) (= (select |#length| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) 8) (<= (+ 1 .cse0) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (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) |ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) .cse1 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) [2024-11-08 22:34:22,071 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,071 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE(line 613) no Hoare annotation was computed. [2024-11-08 22:34:22,071 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-08 22:34:22,071 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE(line 609) no Hoare annotation was computed. [2024-11-08 22:34:22,071 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 (= (store (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (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) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|)) (not (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|)) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1))) [2024-11-08 22:34:22,072 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE(line 594) no Hoare annotation was computed. [2024-11-08 22:34:22,072 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE(line 600) no Hoare annotation was computed. [2024-11-08 22:34:22,072 INFO L77 FloydHoareUtils]: At program point L613(line 613) the Hoare annotation is: (and (= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,072 INFO L77 FloydHoareUtils]: At program point L613-1(line 613) the Hoare annotation is: (and (<= (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,072 INFO L77 FloydHoareUtils]: At program point L613-2(line 613) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 1) (= (store |#valid| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)) [2024-11-08 22:34:22,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 22:34:22,086 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:34:22,091 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-08 22:34:22,091 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-08 22:34:22,091 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-08 22:34:22,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 22:34:22,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:34:22,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 22:34:22,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:34:22,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 22:34:22,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-08 22:34:22,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-08 22:34:22,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 22:34:22,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-08 22:34:22,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-08 22:34:22,093 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-08 22:34:22,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 22:34:22,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-08 22:34:22,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-08 22:34:22,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-08 22:34:22,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-08 22:34:22,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-08 22:34:22,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-08 22:34:22,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-08 22:34:22,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-08 22:34:22,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 22:34:22,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-08 22:34:22,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 22:34:22,096 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 22:34:22,096 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 22:34:22,096 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayStoreExpression[IdentifierExpression[#valid,GLOBAL],[IdentifierExpression[~head~0!base,]],IntegerLiteral[0]] [2024-11-08 22:34:22,096 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 22:34:22,096 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 22:34:22,098 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-08 22:34:22,099 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:34:22,099 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 22:34:22,099 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 22:34:22,099 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 22:34:22,099 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 22:34:22,100 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 22:34:22,100 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:34:22,100 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 22:34:22,100 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-08 22:34:22,101 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-08 22:34:22,101 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-08 22:34:22,101 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-08 22:34:22,101 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-08 22:34:22,101 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 22:34:22,101 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 22:34:22,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-08 22:34:22,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-08 22:34:22,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-08 22:34:22,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 22:34:22,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 22:34:22,102 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:34:22,103 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 22:34:22,103 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 22:34:22,103 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 22:34:22,103 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-08 22:34:22,103 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-08 22:34:22,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-08 22:34:22,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-08 22:34:22,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-08 22:34:22,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-08 22:34:22,104 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.offset [2024-11-08 22:34:22,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.offset,GLOBAL] [2024-11-08 22:34:22,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 22:34:22,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:34:22,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 22:34:22,105 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:34:22,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 22:34:22,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 22:34:22,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 22:34:22,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-08 22:34:22,106 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-08 22:34:22,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 22:34:22,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-08 22:34:22,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-08 22:34:22,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-08 22:34:22,107 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-08 22:34:22,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-08 22:34:22,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 22:34:22,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-08 22:34:22,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-08 22:34:22,108 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-08 22:34:22,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-08 22:34:22,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-11-08 22:34:22,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-08 22:34:22,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$.base [2024-11-08 22:34:22,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$.base,GLOBAL] [2024-11-08 22:34:22,109 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-08 22:34:22,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2024-11-08 22:34:22,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 22:34:22,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 22:34:22,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-08 22:34:22,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-08 22:34:22,110 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-08 22:34:22,111 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2024-11-08 22:34:22,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 10:34:22 ImpRootNode [2024-11-08 22:34:22,116 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 22:34:22,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:34:22,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:34:22,117 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:34:22,117 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:25:33" (3/4) ... [2024-11-08 22:34:22,123 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 22:34:22,136 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-08 22:34:22,136 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 22:34:22,137 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-08 22:34:22,137 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 22:34:22,271 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 22:34:22,272 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 22:34:22,272 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:34:22,273 INFO L158 Benchmark]: Toolchain (without parser) took 530149.02ms. Allocated memory was 132.1MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 98.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 643.5MB. Max. memory is 16.1GB. [2024-11-08 22:34:22,274 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 132.1MB. Free memory was 101.3MB in the beginning and 101.1MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:34:22,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 707.17ms. Allocated memory is still 132.1MB. Free memory was 97.7MB in the beginning and 78.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 22:34:22,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.79ms. Allocated memory is still 132.1MB. Free memory was 78.8MB in the beginning and 76.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:34:22,275 INFO L158 Benchmark]: Boogie Preprocessor took 81.62ms. Allocated memory is still 132.1MB. Free memory was 76.6MB in the beginning and 74.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 22:34:22,276 INFO L158 Benchmark]: RCFGBuilder took 703.58ms. Allocated memory is still 132.1MB. Free memory was 74.1MB in the beginning and 99.0MB in the end (delta: -24.9MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2024-11-08 22:34:22,276 INFO L158 Benchmark]: CodeCheck took 528366.67ms. Allocated memory was 132.1MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 98.9MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 637.4MB. Max. memory is 16.1GB. [2024-11-08 22:34:22,276 INFO L158 Benchmark]: Witness Printer took 155.92ms. Allocated memory is still 3.4GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:34:22,278 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, 130 locations, 62 error locations. Started 1 CEGAR loops. OverallTime: 523.2s, OverallIterations: 76, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25245 SdHoareTripleChecker+Valid, 152.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24238 mSDsluCounter, 18090 SdHoareTripleChecker+Invalid, 133.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16478 mSDsCounter, 13899 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75321 IncrementalHoareTripleChecker+Invalid, 89220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13899 mSolverCounterUnsat, 1612 mSDtfsCounter, 75321 mSolverCounterSat, 2.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14704 GetRequests, 12521 SyntacticMatches, 683 SemanticMatches, 1500 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365594 ImplicationChecksByTransitivity, 498.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 90.5s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1701 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 1626 ConstructedInterpolants, 0 QuantifiedInterpolants, 14166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 75 InterpolantComputations, 40 PerfectInterpolantSequences, 224/449 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 - 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: ((((2 <= len) && (len < 3)) || ((len <= 3) && (3 <= len))) || (len < 2)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 132.1MB. Free memory was 101.3MB in the beginning and 101.1MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 707.17ms. Allocated memory is still 132.1MB. Free memory was 97.7MB in the beginning and 78.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.79ms. Allocated memory is still 132.1MB. Free memory was 78.8MB in the beginning and 76.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.62ms. Allocated memory is still 132.1MB. Free memory was 76.6MB in the beginning and 74.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 703.58ms. Allocated memory is still 132.1MB. Free memory was 74.1MB in the beginning and 99.0MB in the end (delta: -24.9MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * CodeCheck took 528366.67ms. Allocated memory was 132.1MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 98.9MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 637.4MB. Max. memory is 16.1GB. * Witness Printer took 155.92ms. Allocated memory is still 3.4GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: #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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,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: ~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: 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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,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: 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: ~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: #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: #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: #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: #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 RESULT: Ultimate proved your program to be correct! [2024-11-08 22:34:22,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75562f06-75d2-4a39-9d32-2282111b897b/bin/ukojak-verify-ImItNfHLgk/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