./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0019-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0019-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm --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 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:53:31,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:53:31,612 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-11-13 20:53:31,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:53:31,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:53:31,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:53:31,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:53:31,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:53:31,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:53:31,675 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:53:31,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:53:31,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:53:31,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:53:31,675 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 20:53:31,675 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 20:53:31,676 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 20:53:31,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:53:31,676 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:53:31,676 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 20:53:31,676 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:53:31,676 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:53:31,676 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:53:31,676 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:53:31,676 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:53:31,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:53:31,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:53:31,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:53:31,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:53:31,680 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:53:31,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:53:31,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm 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 -> 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd [2024-11-13 20:53:32,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:53:32,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:53:32,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:53:32,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:53:32,063 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:53:32,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/memsafety/test-0019-1.i Unable to find full path for "g++" [2024-11-13 20:53:34,424 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:53:34,875 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:53:34,876 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/sv-benchmarks/c/memsafety/test-0019-1.i [2024-11-13 20:53:34,891 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/data/189ff804b/f7a0b189c239447690e3bb28bd7e76f3/FLAG724c1849b [2024-11-13 20:53:34,911 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/data/189ff804b/f7a0b189c239447690e3bb28bd7e76f3 [2024-11-13 20:53:34,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:53:34,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:53:34,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:53:34,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:53:34,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:53:34,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:53:34" (1/1) ... [2024-11-13 20:53:34,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@733e5ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:53:34, skipping insertion in model container [2024-11-13 20:53:34,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:53:34" (1/1) ... [2024-11-13 20:53:34,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:53:35,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:53:35,481 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:53:35,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:53:35,582 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:53:35,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:53:35 WrapperNode [2024-11-13 20:53:35,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:53:35,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:53:35,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:53:35,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:53:35,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:53:35" (1/1) ... [2024-11-13 20:53:35,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:53:35" (1/1) ... [2024-11-13 20:53:35,640 INFO L138 Inliner]: procedures = 125, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2024-11-13 20:53:35,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:53:35,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:53:35,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:53:35,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:53:35,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:53:35" (1/1) ... [2024-11-13 20:53:35,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:53:35" (1/1) ... [2024-11-13 20:53:35,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:53:35" (1/1) ... [2024-11-13 20:53:35,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:53:35" (1/1) ... [2024-11-13 20:53:35,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:53:35" (1/1) ... [2024-11-13 20:53:35,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:53:35" (1/1) ... [2024-11-13 20:53:35,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:53:35" (1/1) ... [2024-11-13 20:53:35,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:53:35" (1/1) ... [2024-11-13 20:53:35,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:53:35,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:53:35,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:53:35,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:53:35,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:53:35" (1/1) ... [2024-11-13 20:53:35,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:53:35,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:53:35,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 20:53:35,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 20:53:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 20:53:35,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:53:35,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 20:53:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-13 20:53:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-13 20:53:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 20:53:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 20:53:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:53:35,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:53:35,924 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:53:35,927 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:53:36,206 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-11-13 20:53:36,206 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:53:36,263 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:53:36,263 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 20:53:36,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:53:36 BoogieIcfgContainer [2024-11-13 20:53:36,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:53:36,265 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:53:36,265 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:53:36,277 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:53:36,277 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:53:36" (1/1) ... [2024-11-13 20:53:36,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:53:36,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2024-11-13 20:53:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2024-11-13 20:53:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 20:53:36,360 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:36,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:36,687 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-13 20:53:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2024-11-13 20:53:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2024-11-13 20:53:36,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-13 20:53:36,742 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:36,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:36,987 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-13 20:53:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2024-11-13 20:53:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2024-11-13 20:53:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 20:53:37,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:37,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:37,208 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-13 20:53:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-11-13 20:53:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-11-13 20:53:37,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-13 20:53:37,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:37,460 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-13 20:53:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-11-13 20:53:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-11-13 20:53:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 20:53:37,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:37,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:37,840 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-13 20:53:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2024-11-13 20:53:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2024-11-13 20:53:38,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-13 20:53:38,272 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:38,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:38,725 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-13 20:53:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2024-11-13 20:53:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2024-11-13 20:53:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 20:53:39,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:39,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:39,724 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-13 20:53:39,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-11-13 20:53:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-11-13 20:53:39,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-13 20:53:39,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:39,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:40,288 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-13 20:53:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2024-11-13 20:53:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2024-11-13 20:53:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 20:53:41,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:41,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:41,553 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-13 20:53:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2024-11-13 20:53:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2024-11-13 20:53:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 20:53:41,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:41,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:41,810 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-13 20:53:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2024-11-13 20:53:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2024-11-13 20:53:42,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 20:53:42,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:42,217 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-13 20:53:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2024-11-13 20:53:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2024-11-13 20:53:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 20:53:42,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:42,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:42,434 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-13 20:53:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-11-13 20:53:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-11-13 20:53:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 20:53:42,954 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:42,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:43,022 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-13 20:53:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2024-11-13 20:53:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2024-11-13 20:53:43,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 20:53:43,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:43,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:43,256 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-13 20:53:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-11-13 20:53:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-11-13 20:53:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 20:53:43,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:43,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:43,767 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-13 20:53:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-13 20:53:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-13 20:53:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 20:53:43,983 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:43,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:44,025 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-13 20:53:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-11-13 20:53:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-11-13 20:53:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 20:53:44,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:44,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:44,995 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-13 20:53:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-11-13 20:53:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-11-13 20:53:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:53:48,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:48,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:49,843 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-13 20:53:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:53:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 25 states and 24 transitions. [2024-11-13 20:53:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2024-11-13 20:53:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 20:53:56,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:53:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:53:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:53:57,407 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-13 20:54:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:54:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 24 states and 23 transitions. [2024-11-13 20:54:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2024-11-13 20:54:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 20:54:06,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:54:06,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:54:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:54:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:54:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:54:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 23 states and 22 transitions. [2024-11-13 20:54:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2024-11-13 20:54:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 20:54:21,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:54:21,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:54:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:54:23,730 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-13 20:54:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:54:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 22 states and 21 transitions. [2024-11-13 20:54:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2024-11-13 20:54:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 20:54:37,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:54:37,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:54:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:54:39,357 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-13 20:54:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:54:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 21 states and 20 transitions. [2024-11-13 20:54:55,848 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2024-11-13 20:54:55,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-13 20:54:55,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:54:55,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:54:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:54:59,393 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-13 20:55:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:55:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 20 states and 19 transitions. [2024-11-13 20:55:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2024-11-13 20:55:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-13 20:55:26,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:55:26,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:55:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:55:35,177 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-13 20:56:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:56:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 19 states and 18 transitions. [2024-11-13 20:56:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2024-11-13 20:56:16,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 20:56:16,196 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 25 iterations. [2024-11-13 20:56:16,205 INFO L729 CodeCheckObserver]: All specifications hold 23 specifications checked. All of them hold [2024-11-13 20:56:16,594 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,594 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE(line 539) no Hoare annotation was computed. [2024-11-13 20:56:16,595 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE(line 538) no Hoare annotation was computed. [2024-11-13 20:56:16,595 INFO L77 FloydHoareUtils]: At program point L539(line 539) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|))) [2024-11-13 20:56:16,595 INFO L77 FloydHoareUtils]: At program point L539-1(line 539) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|))) [2024-11-13 20:56:16,595 INFO L77 FloydHoareUtils]: At program point L539-2(line 539) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|))) [2024-11-13 20:56:16,596 INFO L77 FloydHoareUtils]: At program point L535(line 535) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_free_data_~#data#1.offset| 4))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) .cse1))) (and (not (= |ULTIMATE.start_free_data_~lo~0#1.base| 0)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= .cse0 |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_free_data_~#data#1.offset| 0) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| .cse0)) (= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) .cse1) 0) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (<= (+ .cse0 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) .cse0 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= .cse0 |ULTIMATE.start_free_data_~#data#1.base|)) (= |ULTIMATE.start_free_data_~lo~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= (select |#valid| .cse0) 1)))) [2024-11-13 20:56:16,596 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,596 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,596 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,596 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,596 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 541 546) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-11-13 20:56:16,596 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE(line 539) no Hoare annotation was computed. [2024-11-13 20:56:16,597 INFO L77 FloydHoareUtils]: At program point L544(line 544) the Hoare annotation is: (let ((.cse3 (+ |ULTIMATE.start_main_~#data~0#1.offset| 4)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|))) (let ((.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|)) (.cse0 (select .cse5 |ULTIMATE.start_main_~#data~0#1.offset|)) (.cse1 (select .cse5 .cse3)) (.cse4 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|))) (and (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select |#valid| .cse1) 1) (= (select |#valid| .cse0) 1) (= (select .cse2 .cse3) 0) (not (= .cse0 |ULTIMATE.start_main_~#data~0#1.base|)) (<= (+ .cse1 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1) (<= 0 |ULTIMATE.start_main_~#data~0#1.offset|) (= (select .cse2 |ULTIMATE.start_main_~#data~0#1.offset|) 0) (= (store (store (store |#valid| .cse1 0) .cse0 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= .cse0 0)) (not (= .cse1 .cse0)) (or (= .cse4 8) (< (+ 23 |ULTIMATE.start_main_~#data~0#1.offset|) .cse4)) (not (= .cse1 |ULTIMATE.start_main_~#data~0#1.base|)) (<= (+ |ULTIMATE.start_main_~#data~0#1.offset| 8) .cse4)))) [2024-11-13 20:56:16,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,597 INFO L77 FloydHoareUtils]: At program point L544-1(line 544) the Hoare annotation is: (let ((.cse1 (+ |ULTIMATE.start_main_~#data~0#1.offset| 4))) (let ((.cse2 (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) .cse1))) (and (= (select |#valid| .cse0) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) .cse1) 0) (<= (+ |ULTIMATE.start_main_#t~mem7#1.base| 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_#t~mem7#1.base|) 1) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) 1) (<= 0 |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_main_#t~mem7#1.offset| 0) (or (= .cse2 8) (< (+ 23 |ULTIMATE.start_main_~#data~0#1.offset|) .cse2)) (not (= .cse0 |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem7#1.base| 0)) (not (= |ULTIMATE.start_main_#t~mem7#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (<= (+ |ULTIMATE.start_main_~#data~0#1.offset| 8) .cse2) (not (= .cse0 |ULTIMATE.start_main_#t~mem7#1.base|)) (= (store (store (store |#valid| .cse0 0) |ULTIMATE.start_main_#t~mem7#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)))) [2024-11-13 20:56:16,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE(line 538) no Hoare annotation was computed. [2024-11-13 20:56:16,597 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,597 INFO L77 FloydHoareUtils]: At program point L536(lines 536 537) the Hoare annotation is: (and (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| 0)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (= |ULTIMATE.start_free_data_~lo~0#1.offset| 0) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-11-13 20:56:16,598 INFO L77 FloydHoareUtils]: At program point L532(lines 532 540) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_free_data_#in~data#1.hi.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_free_data_~#data#1.offset| 0) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_#in~data#1.lo.base| 0) |ULTIMATE.start_free_data_#in~data#1.hi.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1) (<= (+ |ULTIMATE.start_free_data_#in~data#1.lo.base| 2) |ULTIMATE.start_free_data_~#data#1.base|) (<= (+ |ULTIMATE.start_free_data_#in~data#1.lo.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.lo.base|) 1) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| 0) (not (= |ULTIMATE.start_free_data_#in~data#1.lo.base| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|) 1) (not (= |ULTIMATE.start_free_data_#in~data#1.lo.base| 0)) (= |ULTIMATE.start_free_data_#in~data#1.lo.offset| 0) (not (= |ULTIMATE.start_free_data_#in~data#1.lo.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= 8 (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| |ULTIMATE.start_main_~#data~0#1.base|))) [2024-11-13 20:56:16,598 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,598 INFO L77 FloydHoareUtils]: At program point L532-1(lines 532 540) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))) (and (<= (+ |ULTIMATE.start_free_data_#in~data#1.hi.base| 1) |#StackHeapBarrier|) (not (= .cse0 |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_free_data_~#data#1.offset| 0) (<= (+ 2 .cse0) |ULTIMATE.start_free_data_~#data#1.base|) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_free_data_#in~data#1.hi.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) 0) (= (select |#valid| .cse0) 1) (= (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|) 1) (= 8 (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) .cse0 0) |ULTIMATE.start_free_data_#in~data#1.hi.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= .cse0 0)) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| .cse0)))) [2024-11-13 20:56:16,598 INFO L77 FloydHoareUtils]: At program point L532-2(lines 532 540) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|)) (.cse3 (+ |ULTIMATE.start_free_data_~#data#1.offset| 4))) (let ((.cse2 (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|)) (.cse1 (select .cse4 .cse3)) (.cse0 (select .cse4 |ULTIMATE.start_free_data_~#data#1.offset|))) (and (not (= .cse0 |ULTIMATE.start_main_~#data~0#1.base|)) (not (= .cse1 |ULTIMATE.start_main_~#data~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) .cse0 0) .cse1 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_free_data_~#data#1.offset| 0) (<= (+ 2 .cse0) |ULTIMATE.start_free_data_~#data#1.base|) (<= (+ .cse0 1) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|) 1) (= (select .cse2 .cse3) 0) (<= (+ .cse1 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select .cse2 |ULTIMATE.start_free_data_~#data#1.offset|) 0) (= (select |#valid| .cse0) 1) (not (= .cse1 |ULTIMATE.start_free_data_~#data#1.base|)) (= 8 (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= .cse0 0)) (= (select |#valid| .cse1) 1) (not (= .cse1 .cse0))))) [2024-11-13 20:56:16,598 INFO L77 FloydHoareUtils]: At program point L532-3(lines 532 540) the Hoare annotation is: (= (store |#valid| |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) [2024-11-13 20:56:16,598 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,599 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-13 20:56:16,599 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE(line 539) no Hoare annotation was computed. [2024-11-13 20:56:16,599 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,600 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,600 INFO L77 FloydHoareUtils]: At program point L529(line 529) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#data~0#1.base|) (= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_#t~malloc3#1.offset| 0) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| 0)) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= (store (store |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (<= (+ |ULTIMATE.start_alloc_data_#t~malloc3#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|) 1) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1)) [2024-11-13 20:56:16,600 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,600 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-13 20:56:16,600 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE(line 538) no Hoare annotation was computed. [2024-11-13 20:56:16,601 INFO L77 FloydHoareUtils]: At program point L538(line 538) the Hoare annotation is: (and (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| 0)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (= |ULTIMATE.start_free_data_~lo~0#1.offset| 0) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-11-13 20:56:16,601 INFO L77 FloydHoareUtils]: At program point L538-1(line 538) the Hoare annotation is: (and (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| 0)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_free_data_~lo~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-11-13 20:56:16,601 INFO L77 FloydHoareUtils]: At program point L538-2(line 538) the Hoare annotation is: (and (= (store (store (store (store |#valid| |ULTIMATE.start_free_data_~#data#1.base| 0) |ULTIMATE.start_free_data_~lo~0#1.base| 0) |ULTIMATE.start_free_data_~hi~0#1.base| 0) |ULTIMATE.start_main_~#data~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| 0)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|) 1) (<= (+ |ULTIMATE.start_free_data_~hi~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_data_~#data#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|) 1) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= 0 |ULTIMATE.start_free_data_~hi~0#1.offset|) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (not (= |ULTIMATE.start_free_data_~hi~0#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (not (= |ULTIMATE.start_free_data_~lo~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|))) [2024-11-13 20:56:16,601 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,601 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,602 INFO L77 FloydHoareUtils]: At program point L530(line 530) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (and (= (select |#valid| .cse0) 1) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) 0) (= 8 (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (<= (+ .cse0 1) |#StackHeapBarrier|) (not (= .cse0 |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (<= (+ |ULTIMATE.start_alloc_data_#t~malloc4#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#data~0#1.offset| |ULTIMATE.start_alloc_data_~pdata#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| 0) (not (= .cse0 |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_main_~#data~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) 1) (not (= .cse0 0)) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) 1) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base| 0) .cse0 0) |ULTIMATE.start_main_~#data~0#1.base| 0)))) [2024-11-13 20:56:16,602 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,602 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-11-13 20:56:16,602 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK(lines 541 546) no Hoare annotation was computed. [2024-11-13 20:56:16,609 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 20:56:16,610 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-13 20:56:16,612 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-11-13 20:56:16,612 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-11-13 20:56:16,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:56:16 ImpRootNode [2024-11-13 20:56:16,614 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:56:16,615 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:56:16,615 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:56:16,615 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:56:16,616 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:53:36" (3/4) ... [2024-11-13 20:56:16,618 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 20:56:16,625 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-11-13 20:56:16,625 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-13 20:56:16,626 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-13 20:56:16,626 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 20:56:16,699 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:56:16,700 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/witness.yml [2024-11-13 20:56:16,700 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:56:16,701 INFO L158 Benchmark]: Toolchain (without parser) took 161785.66ms. Allocated memory was 117.4MB in the beginning and 578.8MB in the end (delta: 461.4MB). Free memory was 90.8MB in the beginning and 190.0MB in the end (delta: -99.1MB). Peak memory consumption was 362.8MB. Max. memory is 16.1GB. [2024-11-13 20:56:16,702 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 83.9MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:56:16,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 664.62ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 73.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:56:16,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.24ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 72.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:56:16,704 INFO L158 Benchmark]: Boogie Preprocessor took 43.38ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 71.0MB in the end (delta: 829.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:56:16,705 INFO L158 Benchmark]: RCFGBuilder took 579.20ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 53.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:56:16,705 INFO L158 Benchmark]: CodeCheck took 160349.05ms. Allocated memory was 117.4MB in the beginning and 578.8MB in the end (delta: 461.4MB). Free memory was 53.9MB in the beginning and 194.2MB in the end (delta: -140.3MB). Peak memory consumption was 320.9MB. Max. memory is 16.1GB. [2024-11-13 20:56:16,705 INFO L158 Benchmark]: Witness Printer took 85.80ms. Allocated memory is still 578.8MB. Free memory was 194.2MB in the beginning and 190.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:56:16,708 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, 42 locations, 23 error locations. Started 1 CEGAR loops. OverallTime: 159.9s, OverallIterations: 25, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 12.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 11.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1390 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4503 IncrementalHoareTripleChecker+Invalid, 5893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1390 mSolverCounterUnsat, 21 mSDtfsCounter, 4503 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1753 GetRequests, 1163 SyntacticMatches, 12 SemanticMatches, 578 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135382 ImplicationChecksByTransitivity, 151.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 25.3s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 2052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 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: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 538]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 539]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 541]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52ms. Allocated memory is still 83.9MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 664.62ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 73.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.24ms. Allocated memory is still 117.4MB. Free memory was 73.5MB in the beginning and 72.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.38ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 71.0MB in the end (delta: 829.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 579.20ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 53.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 160349.05ms. Allocated memory was 117.4MB in the beginning and 578.8MB in the end (delta: 461.4MB). Free memory was 53.9MB in the beginning and 194.2MB in the end (delta: -140.3MB). Peak memory consumption was 320.9MB. Max. memory is 16.1GB. * Witness Printer took 85.80ms. Allocated memory is still 578.8MB. Free memory was 194.2MB in the beginning and 190.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: main_old_#valid#1 RESULT: Ultimate proved your program to be correct! [2024-11-13 20:56:16,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce3093e-f469-421d-b8d5-1d9d230ccb6b/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE