./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0019-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 23:39:09,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 23:39:09,606 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2024-12-05 23:39:09,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 23:39:09,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 23:39:09,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 23:39:09,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 23:39:09,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 23:39:09,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 23:39:09,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 23:39:09,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 23:39:09,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 23:39:09,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 23:39:09,635 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-12-05 23:39:09,635 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-12-05 23:39:09,636 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-12-05 23:39:09,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 23:39:09,636 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-05 23:39:09,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 23:39:09,636 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 23:39:09,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 23:39:09,636 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 23:39:09,636 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 23:39:09,636 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 23:39:09,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 23:39:09,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:39:09,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 23:39:09,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 23:39:09,637 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 23:39:09,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 23:39:09,637 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_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a1ab43e825ce385252e3e834bebdceddee5ecd9c5749af5b0b2355e44f90dcd [2024-12-05 23:39:09,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 23:39:09,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 23:39:09,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 23:39:09,934 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 23:39:09,935 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 23:39:09,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/memsafety/test-0019-1.i [2024-12-05 23:39:13,140 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/data/6a5630232/3b1d72b6aa55485fa764a827d889a12e/FLAG58b4fc65c [2024-12-05 23:39:13,372 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 23:39:13,373 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/sv-benchmarks/c/memsafety/test-0019-1.i [2024-12-05 23:39:13,385 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/data/6a5630232/3b1d72b6aa55485fa764a827d889a12e/FLAG58b4fc65c [2024-12-05 23:39:13,402 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/data/6a5630232/3b1d72b6aa55485fa764a827d889a12e [2024-12-05 23:39:13,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 23:39:13,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 23:39:13,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 23:39:13,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 23:39:13,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 23:39:13,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4270dce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13, skipping insertion in model container [2024-12-05 23:39:13,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 23:39:13,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:39:13,758 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 23:39:13,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 23:39:13,830 INFO L204 MainTranslator]: Completed translation [2024-12-05 23:39:13,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13 WrapperNode [2024-12-05 23:39:13,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 23:39:13,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 23:39:13,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 23:39:13,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 23:39:13,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,877 INFO L138 Inliner]: procedures = 125, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2024-12-05 23:39:13,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 23:39:13,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 23:39:13,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 23:39:13,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 23:39:13,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 23:39:13,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 23:39:13,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 23:39:13,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 23:39:13,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:39:13" (1/1) ... [2024-12-05 23:39:13,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 23:39:13,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 23:39:13,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 23:39:13,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 23:39:13,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-05 23:39:13,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 23:39:13,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-12-05 23:39:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-12-05 23:39:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-12-05 23:39:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-12-05 23:39:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 23:39:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 23:39:13,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 23:39:14,071 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 23:39:14,072 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 23:39:14,305 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2024-12-05 23:39:14,305 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 23:39:14,348 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 23:39:14,348 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-05 23:39:14,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:39:14 BoogieIcfgContainer [2024-12-05 23:39:14,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 23:39:14,350 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 23:39:14,350 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 23:39:14,363 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 23:39:14,363 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:39:14" (1/1) ... [2024-12-05 23:39:14,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 23:39:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2024-12-05 23:39:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2024-12-05 23:39:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-05 23:39:14,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:14,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:14,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2024-12-05 23:39:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2024-12-05 23:39:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-05 23:39:14,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:14,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2024-12-05 23:39:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2024-12-05 23:39:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-05 23:39:14,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:14,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-12-05 23:39:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-12-05 23:39:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-05 23:39:15,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:15,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-12-05 23:39:15,410 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-12-05 23:39:15,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-05 23:39:15,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:15,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:15,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2024-12-05 23:39:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2024-12-05 23:39:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-05 23:39:15,837 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:15,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:16,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-12-05 23:39:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:16,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2024-12-05 23:39:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2024-12-05 23:39:16,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-05 23:39:16,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:16,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-12-05 23:39:16,822 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-12-05 23:39:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-05 23:39:16,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:16,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2024-12-05 23:39:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2024-12-05 23:39:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-05 23:39:18,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:18,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2024-12-05 23:39:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2024-12-05 23:39:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-05 23:39:18,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:18,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2024-12-05 23:39:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2024-12-05 23:39:18,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 23:39:18,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:18,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2024-12-05 23:39:18,530 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2024-12-05 23:39:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-05 23:39:18,531 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:18,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:18,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-12-05 23:39:18,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:18,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-12-05 23:39:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-12-05 23:39:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-05 23:39:18,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:18,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2024-12-05 23:39:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2024-12-05 23:39:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-05 23:39:18,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:18,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-12-05 23:39:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-12-05 23:39:19,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-05 23:39:19,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:19,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-12-05 23:39:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-12-05 23:39:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-05 23:39:19,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:19,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-12-05 23:39:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-12-05 23:39:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-05 23:39:19,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:19,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:22,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-12-05 23:39:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-12-05 23:39:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 23:39:22,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:22,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 25 states and 24 transitions. [2024-12-05 23:39:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2024-12-05 23:39:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-05 23:39:27,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:27,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 24 states and 23 transitions. [2024-12-05 23:39:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2024-12-05 23:39:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-05 23:39:35,113 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:35,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:46,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 23 states and 22 transitions. [2024-12-05 23:39:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2024-12-05 23:39:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-05 23:39:46,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:46,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:39:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:39:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 22 states and 21 transitions. [2024-12-05 23:39:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2024-12-05 23:39:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-05 23:39:57,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:39:57,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:39:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:39:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:40:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:40:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 21 states and 20 transitions. [2024-12-05 23:40:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2024-12-05 23:40:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-05 23:40:11,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:40:11,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:40:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:40:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:40:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:40:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 20 states and 19 transitions. [2024-12-05 23:40:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2024-12-05 23:40:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-05 23:40:35,407 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 23:40:35,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 23:40:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 23:40:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 23:41:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 23:41:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 19 states and 18 transitions. [2024-12-05 23:41:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2024-12-05 23:41:17,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-05 23:41:17,892 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 25 iterations. [2024-12-05 23:41:17,900 INFO L726 CodeCheckObserver]: All specifications hold 23 specifications checked. All of them hold [2024-12-05 23:41:18,269 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,269 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE(line 539) no Hoare annotation was computed. [2024-12-05 23:41:18,270 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE(line 538) no Hoare annotation was computed. [2024-12-05 23:41:18,270 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-12-05 23:41:18,270 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-12-05 23:41:18,270 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-12-05 23:41:18,271 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-12-05 23:41:18,271 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,271 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,271 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,271 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,271 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 541 546) the Hoare annotation is: (= |ULTIMATE.start_main_old_#valid#1| |#valid|) [2024-12-05 23:41:18,272 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE(line 539) no Hoare annotation was computed. [2024-12-05 23:41:18,272 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-12-05 23:41:18,272 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,272 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-12-05 23:41:18,273 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE(line 538) no Hoare annotation was computed. [2024-12-05 23:41:18,273 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,273 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-12-05 23:41:18,274 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-12-05 23:41:18,274 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,274 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-12-05 23:41:18,274 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-12-05 23:41:18,274 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-12-05 23:41:18,275 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,275 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-05 23:41:18,275 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE(line 539) no Hoare annotation was computed. [2024-12-05 23:41:18,275 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,275 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,275 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-12-05 23:41:18,275 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,275 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-05 23:41:18,276 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE(line 538) no Hoare annotation was computed. [2024-12-05 23:41:18,276 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-12-05 23:41:18,276 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-12-05 23:41:18,276 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-12-05 23:41:18,276 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,276 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,277 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-12-05 23:41:18,277 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,277 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE(line -1) no Hoare annotation was computed. [2024-12-05 23:41:18,277 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK(lines 541 546) no Hoare annotation was computed. [2024-12-05 23:41:18,285 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-05 23:41:18,286 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-12-05 23:41:18,288 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: ArrayStoreExpression [2024-12-05 23:41:18,288 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: main_old_#valid#1 [2024-12-05 23:41:18,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 11:41:18 ImpRootNode [2024-12-05 23:41:18,290 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 23:41:18,290 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 23:41:18,291 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 23:41:18,291 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 23:41:18,292 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:39:14" (3/4) ... [2024-12-05 23:41:18,294 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-05 23:41:18,302 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-12-05 23:41:18,302 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-12-05 23:41:18,303 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-05 23:41:18,303 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-05 23:41:18,387 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 23:41:18,387 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 23:41:18,387 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 23:41:18,388 INFO L158 Benchmark]: Toolchain (without parser) took 124982.12ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 91.0MB in the beginning and 126.9MB in the end (delta: -35.9MB). Peak memory consumption was 114.4MB. Max. memory is 16.1GB. [2024-12-05 23:41:18,388 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:41:18,389 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.17ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 73.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-05 23:41:18,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.55ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 72.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:41:18,389 INFO L158 Benchmark]: Boogie Preprocessor took 28.28ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 71.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 23:41:18,389 INFO L158 Benchmark]: RCFGBuilder took 441.78ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 54.3MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-05 23:41:18,390 INFO L158 Benchmark]: CodeCheck took 123940.02ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 54.3MB in the beginning and 132.9MB in the end (delta: -78.6MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2024-12-05 23:41:18,390 INFO L158 Benchmark]: Witness Printer took 97.07ms. Allocated memory is still 268.4MB. Free memory was 132.9MB in the beginning and 126.9MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 23:41:18,392 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: 123.5s, 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, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 8.6s 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, 117.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 19.6s 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, ConComCheckerStatistics: No data available - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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.36ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.17ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 73.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.55ms. Allocated memory is still 117.4MB. Free memory was 73.9MB in the beginning and 72.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.28ms. Allocated memory is still 117.4MB. Free memory was 72.5MB in the beginning and 71.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 441.78ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 54.3MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 123940.02ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 54.3MB in the beginning and 132.9MB in the end (delta: -78.6MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. * Witness Printer took 97.07ms. Allocated memory is still 268.4MB. Free memory was 132.9MB in the beginning and 126.9MB in the end (delta: 6.0MB). 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-12-05 23:41:18,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a93c05-104c-47d2-bf70-b9c5eae5c251/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE