./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:05:33,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:05:33,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-08 06:05:33,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:05:33,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:05:33,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:05:33,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:05:33,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:05:33,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:05:33,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:05:33,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:05:33,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:05:33,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:05:33,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:05:33,068 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:05:33,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:05:33,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 06:05:33,068 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:05:33,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:05:33,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:05:33,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:05:33,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 06:05:33,068 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:05:33,069 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:05:33,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:05:33,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 06:05:33,069 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:05:33,069 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:05:33,069 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:05:33,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 06:05:33,069 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:05:33,069 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:05:33,069 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:05:33,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:05:33,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:05:33,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:05:33,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:05:33,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:05:33,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:05:33,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:05:33,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:05:33,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:05:33,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:05:33,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:05:33,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:05:33,070 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 [2025-02-08 06:05:33,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:05:33,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:05:33,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:05:33,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:05:33,324 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:05:33,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2025-02-08 06:05:34,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cd7c1ab1/48d8d347841e48d389bab205cc2f1be6/FLAG075c74c19 [2025-02-08 06:05:35,206 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:05:35,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2025-02-08 06:05:35,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cd7c1ab1/48d8d347841e48d389bab205cc2f1be6/FLAG075c74c19 [2025-02-08 06:05:35,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9cd7c1ab1/48d8d347841e48d389bab205cc2f1be6 [2025-02-08 06:05:35,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:05:35,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:05:35,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:05:35,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:05:35,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:05:35,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:05:35" (1/1) ... [2025-02-08 06:05:35,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b98a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:35, skipping insertion in model container [2025-02-08 06:05:35,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:05:35" (1/1) ... [2025-02-08 06:05:35,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:05:35,693 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,730 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,734 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,739 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,746 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,784 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,787 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,790 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,791 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,794 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,798 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,798 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,799 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,801 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:35,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:05:35,837 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2025-02-08 06:05:35,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1a8a32b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:35, skipping insertion in model container [2025-02-08 06:05:35,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:05:35,841 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-02-08 06:05:35,847 INFO L158 Benchmark]: Toolchain (without parser) took 507.09ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 108.8MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 06:05:35,847 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 226.5MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:05:35,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.21ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 108.8MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 06:05:35,848 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 226.5MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.21ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 108.8MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:05:38,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:05:38,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-02-08 06:05:38,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:05:38,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:05:38,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:05:38,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:05:38,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:05:38,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:05:38,413 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:05:38,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:05:38,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:05:38,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:05:38,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:05:38,413 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:05:38,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:05:38,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 06:05:38,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:05:38,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:05:38,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:05:38,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:05:38,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 06:05:38,414 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:05:38,414 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:05:38,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:05:38,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 06:05:38,415 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:05:38,415 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 06:05:38,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 06:05:38,415 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:05:38,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:05:38,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:05:38,416 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:05:38,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:05:38,416 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 [2025-02-08 06:05:38,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:05:38,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:05:38,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:05:38,694 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:05:38,695 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:05:38,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2025-02-08 06:05:40,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0124dd334/f3cb93eca2694844930be46cc5373557/FLAGbc196f2b0 [2025-02-08 06:05:40,472 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:05:40,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2025-02-08 06:05:40,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0124dd334/f3cb93eca2694844930be46cc5373557/FLAGbc196f2b0 [2025-02-08 06:05:40,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0124dd334/f3cb93eca2694844930be46cc5373557 [2025-02-08 06:05:40,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:05:40,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:05:40,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:05:40,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:05:40,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:05:40,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:05:40" (1/1) ... [2025-02-08 06:05:40,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1814fd4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:40, skipping insertion in model container [2025-02-08 06:05:40,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:05:40" (1/1) ... [2025-02-08 06:05:40,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:05:41,554 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,612 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,615 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,626 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,639 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,701 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,705 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,712 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,715 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,722 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,723 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,727 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,728 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,733 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:05:41,783 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-02-08 06:05:41,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:05:41,870 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,905 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,914 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,925 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,935 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,976 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,976 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,977 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,981 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,984 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,990 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,991 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,991 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:41,993 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:42,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:05:42,014 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:05:42,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:05:42,297 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:05:42,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42 WrapperNode [2025-02-08 06:05:42,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:05:42,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:05:42,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:05:42,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:05:42,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42" (1/1) ... [2025-02-08 06:05:42,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42" (1/1) ... [2025-02-08 06:05:42,369 INFO L138 Inliner]: procedures = 286, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1026 [2025-02-08 06:05:42,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:05:42,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:05:42,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:05:42,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:05:42,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42" (1/1) ... [2025-02-08 06:05:42,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42" (1/1) ... [2025-02-08 06:05:42,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42" (1/1) ... [2025-02-08 06:05:42,463 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 12, 34, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 54 writes are split as follows [0, 1, 4, 49]. [2025-02-08 06:05:42,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42" (1/1) ... [2025-02-08 06:05:42,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42" (1/1) ... [2025-02-08 06:05:42,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42" (1/1) ... [2025-02-08 06:05:42,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42" (1/1) ... [2025-02-08 06:05:42,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42" (1/1) ... [2025-02-08 06:05:42,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42" (1/1) ... [2025-02-08 06:05:42,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:05:42,536 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:05:42,536 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:05:42,536 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:05:42,537 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42" (1/1) ... [2025-02-08 06:05:42,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:05:42,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:05:42,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:05:42,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:05:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 06:05:42,587 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 06:05:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-08 06:05:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-08 06:05:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-08 06:05:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-08 06:05:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-08 06:05:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-08 06:05:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-08 06:05:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-08 06:05:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:05:42,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-02-08 06:05:42,588 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 06:05:42,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-02-08 06:05:42,588 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:05:42,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:05:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 06:05:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-02-08 06:05:42,590 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-02-08 06:05:42,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:05:42,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:05:42,798 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:05:42,800 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:05:42,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L994: call main_#t~mem42#1 := read~intINTTYPE4#2(main_~#i~0#1.base, main_~#i~0#1.offset, 4bv32);call write~intINTTYPE4#3(main_#t~mem42#1, main_~user~0#1.base, main_~user~0#1.offset, 4bv32);havoc main_#t~mem42#1;call main_#t~mem43#1 := read~intINTTYPE4#2(main_~#i~0#1.base, main_~#i~0#1.offset, 4bv32);call main_#t~mem44#1 := read~intINTTYPE4#2(main_~#i~0#1.base, main_~#i~0#1.offset, 4bv32);call write~intINTTYPE4#3(~bvmul~32(main_#t~mem43#1, main_#t~mem44#1), main_~user~0#1.base, ~bvadd~32(4bv32, main_~user~0#1.offset), 4bv32);havoc main_#t~mem43#1;havoc main_#t~mem44#1; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;main_#t~ret41#1.base, main_#t~ret41#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;havoc real_malloc_#in~n#1;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret41#1.base, main_#t~ret41#1.offset;havoc main_#t~ret41#1.base, main_#t~ret41#1.offset; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996: assume true;havoc main_~_ha_hashv~0#1; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996: assume !true; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-1: assume false; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-1: assume !false; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-2: havoc main_~_ha_hashv~0#1; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-3: assume true;call write~intINTTYPE4#3(main_~_ha_hashv~0#1, main_~user~0#1.base, ~bvadd~32(28bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32);call write~$Pointer$#3(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, ~bvadd~32(20bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32);call write~intINTTYPE4#3(4bv32, main_~user~0#1.base, ~bvadd~32(24bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32); [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-3: assume !true; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-4: assume false; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-4: assume !false; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-5: assume true;havoc main_~_ha_bkt~0#1;call main_#t~mem92#1.base, main_#t~mem92#1.offset := read~$Pointer$#3(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32);call main_#t~mem93#1 := read~intINTTYPE4#3(main_#t~mem92#1.base, ~bvadd~32(12bv32, main_#t~mem92#1.offset), 4bv32);main_#t~post94#1 := main_#t~mem93#1;call write~intINTTYPE4#3(~bvadd~32(1bv32, main_#t~post94#1), main_#t~mem92#1.base, ~bvadd~32(12bv32, main_#t~mem92#1.offset), 4bv32);havoc main_#t~mem92#1.base, main_#t~mem92#1.offset;havoc main_#t~mem93#1;havoc main_#t~post94#1; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-5: assume !true; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-6: assume false; [2025-02-08 06:05:48,738 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-6: assume !false; [2025-02-08 06:05:48,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-7: havoc main_~_ha_bkt~0#1; [2025-02-08 06:05:48,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-8: assume true;call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$#3(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32);call main_#t~mem98#1.base, main_#t~mem98#1.offset := read~$Pointer$#3(main_#t~mem97#1.base, main_#t~mem97#1.offset, 4bv32);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem98#1.base, ~bvadd~32(main_#t~mem98#1.offset, ~bvmul~32(12bv32, main_~_ha_bkt~0#1));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1.base, main_#t~mem98#1.offset;call main_#t~mem99#1 := read~intINTTYPE4#3(main_~_ha_head~0#1.base, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset), 4bv32);main_#t~post100#1 := main_#t~mem99#1;call write~intINTTYPE4#3(~bvadd~32(1bv32, main_#t~post100#1), main_~_ha_head~0#1.base, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset), 4bv32);havoc main_#t~mem99#1;havoc main_#t~post100#1;call main_#t~mem101#1.base, main_#t~mem101#1.offset := read~$Pointer$#3(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4bv32);call write~$Pointer$#3(main_#t~mem101#1.base, main_#t~mem101#1.offset, main_~user~0#1.base, ~bvadd~32(16bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32);havoc main_#t~mem101#1.base, main_#t~mem101#1.offset;call write~$Pointer$#3(0bv32, 0bv32, main_~user~0#1.base, ~bvadd~32(12bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32);call main_#t~mem102#1.base, main_#t~mem102#1.offset := read~$Pointer$#3(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4bv32); [2025-02-08 06:05:48,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-8: assume !true; [2025-02-08 06:05:48,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-9: assume false; [2025-02-08 06:05:48,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-9: assume !false; [2025-02-08 06:05:48,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-10: havoc main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset; [2025-02-08 06:05:48,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-11: assume true;havoc main_~_he_bkt~0#1;havoc main_~_he_bkt_i~0#1;havoc main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset;havoc main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset;havoc main_~_he_new_buckets~0#1.base, main_~_he_new_buckets~0#1.offset;havoc main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset;call main_#t~mem109#1.base, main_#t~mem109#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem110#1 := read~intINTTYPE4#3(main_#t~mem109#1.base, ~bvadd~32(4bv32, main_#t~mem109#1.offset), 4bv32); [2025-02-08 06:05:48,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-11: assume !true; [2025-02-08 06:05:48,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-12: assume false; [2025-02-08 06:05:48,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-12: assume !false; [2025-02-08 06:05:48,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-13: havoc main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~_he_new_buckets~0#1.base, main_~_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset; [2025-02-08 06:05:48,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-14: assume ~bvugt~32(main_#t~mem169#1, 1bv32);havoc main_#t~mem168#1.base, main_#t~mem168#1.offset;havoc main_#t~mem169#1;call main_#t~mem170#1.base, main_#t~mem170#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call write~intINTTYPE4#3(1bv32, main_#t~mem170#1.base, ~bvadd~32(36bv32, main_#t~mem170#1.offset), 4bv32);havoc main_#t~mem170#1.base, main_#t~mem170#1.offset;havoc main_#t~mem170#1.base, main_#t~mem170#1.offset; [2025-02-08 06:05:48,739 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-14: assume !~bvugt~32(main_#t~mem169#1, 1bv32);havoc main_#t~mem168#1.base, main_#t~mem168#1.offset;havoc main_#t~mem169#1; [2025-02-08 06:05:48,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-15: call write~intINTTYPE4#3(main_#t~ite167#1, main_#t~mem160#1.base, ~bvadd~32(32bv32, main_#t~mem160#1.offset), 4bv32);havoc main_#t~mem160#1.base, main_#t~mem160#1.offset;havoc main_#t~mem161#1.base, main_#t~mem161#1.offset;havoc main_#t~mem164#1;havoc main_#t~mem162#1.base, main_#t~mem162#1.offset;havoc main_#t~mem163#1;havoc main_#t~ite167#1;havoc main_#t~mem165#1.base, main_#t~mem165#1.offset;havoc main_#t~mem166#1;call main_#t~mem168#1.base, main_#t~mem168#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem169#1 := read~intINTTYPE4#3(main_#t~mem168#1.base, ~bvadd~32(32bv32, main_#t~mem168#1.offset), 4bv32); [2025-02-08 06:05:48,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-16: assume ~bvugt~32(main_#t~mem164#1, ~bvlshr~32(main_#t~mem163#1, 1bv32));call main_#t~mem165#1.base, main_#t~mem165#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem166#1 := read~intINTTYPE4#3(main_#t~mem165#1.base, ~bvadd~32(32bv32, main_#t~mem165#1.offset), 4bv32);main_#t~ite167#1 := ~bvadd~32(1bv32, main_#t~mem166#1); [2025-02-08 06:05:48,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-16: assume !~bvugt~32(main_#t~mem164#1, ~bvlshr~32(main_#t~mem163#1, 1bv32));main_#t~ite167#1 := 0bv32; [2025-02-08 06:05:48,740 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-17: havoc main_#t~mem150#1.base, main_#t~mem150#1.offset;havoc main_#t~mem151#1.base, main_#t~mem151#1.offset;havoc main_#t~mem152#1.base, main_#t~mem152#1.offset;havoc main_#t~mem153#1;call main_#t~mem154#1.base, main_#t~mem154#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem155#1 := read~intINTTYPE4#3(main_#t~mem154#1.base, ~bvadd~32(4bv32, main_#t~mem154#1.offset), 4bv32);call write~intINTTYPE4#3(~bvmul~32(2bv32, main_#t~mem155#1), main_#t~mem154#1.base, ~bvadd~32(4bv32, main_#t~mem154#1.offset), 4bv32);havoc main_#t~mem154#1.base, main_#t~mem154#1.offset;havoc main_#t~mem155#1;call main_#t~mem156#1.base, main_#t~mem156#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem157#1 := read~intINTTYPE4#3(main_#t~mem156#1.base, ~bvadd~32(8bv32, main_#t~mem156#1.offset), 4bv32);main_#t~post158#1 := main_#t~mem157#1;call write~intINTTYPE4#3(~bvadd~32(1bv32, main_#t~post158#1), main_#t~mem156#1.base, ~bvadd~32(8bv32, main_#t~mem156#1.offset), 4bv32);havoc main_#t~mem156#1.base, main_#t~mem156#1.offset;havoc main_#t~mem157#1;havoc main_#t~post158#1;call main_#t~mem159#1.base, main_#t~mem159#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call write~$Pointer$#3(main_~_he_new_buckets~0#1.base, main_~_he_new_buckets~0#1.offset, main_#t~mem159#1.base, main_#t~mem159#1.offset, 4bv32);havoc main_#t~mem159#1.base, main_#t~mem159#1.offset;call main_#t~mem160#1.base, main_#t~mem160#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem161#1.base, main_#t~mem161#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem164#1 := read~intINTTYPE4#3(main_#t~mem161#1.base, ~bvadd~32(28bv32, main_#t~mem161#1.offset), 4bv32);call main_#t~mem162#1.base, main_#t~mem162#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem163#1 := read~intINTTYPE4#3(main_#t~mem162#1.base, ~bvadd~32(12bv32, main_#t~mem162#1.offset), 4bv32); [2025-02-08 06:05:48,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-18: SUMMARY for call alt_free(main_#t~mem151#1.base, main_#t~mem151#1.offset, ~bvmul~32(12bv32, main_#t~mem153#1)); srcloc: null [2025-02-08 06:05:48,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-19: call main_#t~mem150#1.base, main_#t~mem150#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem151#1.base, main_#t~mem151#1.offset := read~$Pointer$#3(main_#t~mem150#1.base, main_#t~mem150#1.offset, 4bv32);call main_#t~mem152#1.base, main_#t~mem152#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem153#1 := read~intINTTYPE4#3(main_#t~mem152#1.base, ~bvadd~32(4bv32, main_#t~mem152#1.offset), 4bv32); [2025-02-08 06:05:48,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-20: assume true;call main_#t~mem124#1.base, main_#t~mem124#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem125#1 := read~intINTTYPE4#3(main_#t~mem124#1.base, ~bvadd~32(4bv32, main_#t~mem124#1.offset), 4bv32); [2025-02-08 06:05:48,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-20: assume !true; [2025-02-08 06:05:48,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-21: assume main_~_he_thh~0#1.base != 0bv32 || main_~_he_thh~0#1.offset != 0bv32;call main_#t~mem129#1.base, main_#t~mem129#1.offset := read~$Pointer$#3(main_~_he_thh~0#1.base, ~bvadd~32(16bv32, main_~_he_thh~0#1.offset), 4bv32);main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset := main_#t~mem129#1.base, main_#t~mem129#1.offset;havoc main_#t~mem129#1.base, main_#t~mem129#1.offset; [2025-02-08 06:05:48,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-21: assume !(main_~_he_thh~0#1.base != 0bv32 || main_~_he_thh~0#1.offset != 0bv32);main_#t~post149#1 := main_~_he_bkt_i~0#1;main_~_he_bkt_i~0#1 := ~bvadd~32(1bv32, main_#t~post149#1);havoc main_#t~post149#1; [2025-02-08 06:05:48,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-22: call write~$Pointer$#3(main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, 4bv32);main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset := main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset; [2025-02-08 06:05:48,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-23: assume main_#t~mem147#1.base != 0bv32 || main_#t~mem147#1.offset != 0bv32;havoc main_#t~mem147#1.base, main_#t~mem147#1.offset;call main_#t~mem148#1.base, main_#t~mem148#1.offset := read~$Pointer$#3(main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, 4bv32);call write~$Pointer$#3(main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_#t~mem148#1.base, ~bvadd~32(12bv32, main_#t~mem148#1.offset), 4bv32);havoc main_#t~mem148#1.base, main_#t~mem148#1.offset; [2025-02-08 06:05:48,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-23: assume !(main_#t~mem147#1.base != 0bv32 || main_#t~mem147#1.offset != 0bv32);havoc main_#t~mem147#1.base, main_#t~mem147#1.offset; [2025-02-08 06:05:48,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-24: call write~$Pointer$#3(0bv32, 0bv32, main_~_he_thh~0#1.base, ~bvadd~32(12bv32, main_~_he_thh~0#1.offset), 4bv32);call main_#t~mem146#1.base, main_#t~mem146#1.offset := read~$Pointer$#3(main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, 4bv32);call write~$Pointer$#3(main_#t~mem146#1.base, main_#t~mem146#1.offset, main_~_he_thh~0#1.base, ~bvadd~32(16bv32, main_~_he_thh~0#1.offset), 4bv32);havoc main_#t~mem146#1.base, main_#t~mem146#1.offset;call main_#t~mem147#1.base, main_#t~mem147#1.offset := read~$Pointer$#3(main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, 4bv32); [2025-02-08 06:05:48,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-25: assume ~bvugt~32(main_#t~mem143#1, ~bvmul~32(main_#t~mem141#1, main_#t~mem142#1));havoc main_#t~mem143#1;havoc main_#t~mem141#1;havoc main_#t~mem140#1.base, main_#t~mem140#1.offset;havoc main_#t~mem142#1;call main_#t~mem144#1 := read~intINTTYPE4#3(main_~_he_newbkt~0#1.base, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset), 4bv32);main_#t~post145#1 := main_#t~mem144#1;call write~intINTTYPE4#3(~bvadd~32(1bv32, main_#t~post145#1), main_~_he_newbkt~0#1.base, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset), 4bv32);havoc main_#t~mem144#1;havoc main_#t~post145#1; [2025-02-08 06:05:48,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-25: assume !~bvugt~32(main_#t~mem143#1, ~bvmul~32(main_#t~mem141#1, main_#t~mem142#1));havoc main_#t~mem143#1;havoc main_#t~mem141#1;havoc main_#t~mem140#1.base, main_#t~mem140#1.offset;havoc main_#t~mem142#1; [2025-02-08 06:05:48,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-26: assume ~bvugt~32(main_#t~pre134#1, main_#t~mem136#1);havoc main_#t~mem133#1;havoc main_#t~pre134#1;havoc main_#t~mem135#1.base, main_#t~mem135#1.offset;havoc main_#t~mem136#1;call main_#t~mem137#1.base, main_#t~mem137#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem138#1 := read~intINTTYPE4#3(main_#t~mem137#1.base, ~bvadd~32(28bv32, main_#t~mem137#1.offset), 4bv32);main_#t~post139#1 := main_#t~mem138#1;call write~intINTTYPE4#3(~bvadd~32(1bv32, main_#t~post139#1), main_#t~mem137#1.base, ~bvadd~32(28bv32, main_#t~mem137#1.offset), 4bv32);havoc main_#t~mem137#1.base, main_#t~mem137#1.offset;havoc main_#t~mem138#1;havoc main_#t~post139#1;call main_#t~mem143#1 := read~intINTTYPE4#3(main_~_he_newbkt~0#1.base, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset), 4bv32);call main_#t~mem141#1 := read~intINTTYPE4#3(main_~_he_newbkt~0#1.base, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset), 4bv32);call main_#t~mem140#1.base, main_#t~mem140#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem142#1 := read~intINTTYPE4#3(main_#t~mem140#1.base, ~bvadd~32(24bv32, main_#t~mem140#1.offset), 4bv32); [2025-02-08 06:05:48,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-26: assume !~bvugt~32(main_#t~pre134#1, main_#t~mem136#1);havoc main_#t~mem133#1;havoc main_#t~pre134#1;havoc main_#t~mem135#1.base, main_#t~mem135#1.offset;havoc main_#t~mem136#1; [2025-02-08 06:05:48,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-27: main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset := main_~_he_new_buckets~0#1.base, ~bvadd~32(main_~_he_new_buckets~0#1.offset, ~bvmul~32(12bv32, main_~_he_bkt~0#1));call main_#t~mem133#1 := read~intINTTYPE4#3(main_~_he_newbkt~0#1.base, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset), 4bv32);main_#t~pre134#1 := ~bvadd~32(1bv32, main_#t~mem133#1);call write~intINTTYPE4#3(~bvadd~32(1bv32, main_#t~mem133#1), main_~_he_newbkt~0#1.base, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset), 4bv32);call main_#t~mem135#1.base, main_#t~mem135#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem136#1 := read~intINTTYPE4#3(main_#t~mem135#1.base, ~bvadd~32(24bv32, main_#t~mem135#1.offset), 4bv32); [2025-02-08 06:05:48,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-28: assume true;call main_#t~mem132#1 := read~intINTTYPE4#3(main_~_he_thh~0#1.base, ~bvadd~32(28bv32, main_~_he_thh~0#1.offset), 4bv32);call main_#t~mem130#1.base, main_#t~mem130#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem131#1 := read~intINTTYPE4#3(main_#t~mem130#1.base, ~bvadd~32(4bv32, main_#t~mem130#1.offset), 4bv32);main_~_he_bkt~0#1 := ~bvand~32(main_#t~mem132#1, ~bvsub~32(~bvmul~32(2bv32, main_#t~mem131#1), 1bv32));havoc main_#t~mem132#1;havoc main_#t~mem130#1.base, main_#t~mem130#1.offset;havoc main_#t~mem131#1; [2025-02-08 06:05:48,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-28: assume !true; [2025-02-08 06:05:48,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-29: assume false; [2025-02-08 06:05:48,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-29: assume !false; [2025-02-08 06:05:48,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-31: assume !~bvult~32(main_~_he_bkt_i~0#1, main_#t~mem125#1);havoc main_#t~mem124#1.base, main_#t~mem124#1.offset;havoc main_#t~mem125#1; [2025-02-08 06:05:48,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-31: assume ~bvult~32(main_~_he_bkt_i~0#1, main_#t~mem125#1);havoc main_#t~mem124#1.base, main_#t~mem124#1.offset;havoc main_#t~mem125#1;call main_#t~mem126#1.base, main_#t~mem126#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem127#1.base, main_#t~mem127#1.offset := read~$Pointer$#3(main_#t~mem126#1.base, main_#t~mem126#1.offset, 4bv32);call main_#t~mem128#1.base, main_#t~mem128#1.offset := read~$Pointer$#3(main_#t~mem127#1.base, ~bvadd~32(main_#t~mem127#1.offset, ~bvmul~32(12bv32, main_~_he_bkt_i~0#1)), 4bv32);main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset := main_#t~mem128#1.base, main_#t~mem128#1.offset;havoc main_#t~mem126#1.base, main_#t~mem126#1.offset;havoc main_#t~mem127#1.base, main_#t~mem127#1.offset;havoc main_#t~mem128#1.base, main_#t~mem128#1.offset; [2025-02-08 06:05:48,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-32: havoc main_#t~mem112#1.base, main_#t~mem112#1.offset;havoc main_#t~mem113#1;call main_#t~mem114#1.base, main_#t~mem114#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem115#1.base, main_#t~mem115#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem118#1 := read~intINTTYPE4#3(main_#t~mem115#1.base, ~bvadd~32(12bv32, main_#t~mem115#1.offset), 4bv32);call main_#t~mem116#1.base, main_#t~mem116#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem117#1 := read~intINTTYPE4#3(main_#t~mem116#1.base, ~bvadd~32(8bv32, main_#t~mem116#1.offset), 4bv32);call main_#t~mem119#1.base, main_#t~mem119#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem122#1 := read~intINTTYPE4#3(main_#t~mem119#1.base, ~bvadd~32(12bv32, main_#t~mem119#1.offset), 4bv32);call main_#t~mem120#1.base, main_#t~mem120#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem121#1 := read~intINTTYPE4#3(main_#t~mem120#1.base, ~bvadd~32(4bv32, main_#t~mem120#1.offset), 4bv32);call write~intINTTYPE4#3(~bvadd~32(~bvlshr~32(main_#t~mem118#1, ~bvadd~32(1bv32, main_#t~mem117#1)), (if 0bv32 != ~bvand~32(main_#t~mem122#1, ~bvsub~32(~bvmul~32(2bv32, main_#t~mem121#1), 1bv32)) then 1bv32 else 0bv32)), main_#t~mem114#1.base, ~bvadd~32(24bv32, main_#t~mem114#1.offset), 4bv32);havoc main_#t~mem114#1.base, main_#t~mem114#1.offset;havoc main_#t~mem115#1.base, main_#t~mem115#1.offset;havoc main_#t~mem118#1;havoc main_#t~mem116#1.base, main_#t~mem116#1.offset;havoc main_#t~mem117#1;havoc main_#t~mem119#1.base, main_#t~mem119#1.offset;havoc main_#t~mem122#1;havoc main_#t~mem120#1.base, main_#t~mem120#1.offset;havoc main_#t~mem121#1;call main_#t~mem123#1.base, main_#t~mem123#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call write~intINTTYPE4#3(0bv32, main_#t~mem123#1.base, ~bvadd~32(28bv32, main_#t~mem123#1.offset), 4bv32);havoc main_#t~mem123#1.base, main_#t~mem123#1.offset;main_~_he_bkt_i~0#1 := 0bv32; [2025-02-08 06:05:48,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-33: SUMMARY for call alt_bzero(main_~_he_new_buckets~0#1.base, main_~_he_new_buckets~0#1.offset, ~bvmul~32(12bv32, ~bvmul~32(2bv32, main_#t~mem113#1))); srcloc: null [2025-02-08 06:05:48,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-34: assume main_~_he_new_buckets~0#1.base == 0bv32 && main_~_he_new_buckets~0#1.offset == 0bv32;assume false; [2025-02-08 06:05:48,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-34: assume !(main_~_he_new_buckets~0#1.base == 0bv32 && main_~_he_new_buckets~0#1.offset == 0bv32);call main_#t~mem112#1.base, main_#t~mem112#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem113#1 := read~intINTTYPE4#3(main_#t~mem112#1.base, ~bvadd~32(4bv32, main_#t~mem112#1.offset), 4bv32); [2025-02-08 06:05:48,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-35: main_~_he_new_buckets~0#1.base, main_~_he_new_buckets~0#1.offset := main_#t~ret111#1.base, main_#t~ret111#1.offset;havoc main_#t~mem109#1.base, main_#t~mem109#1.offset;havoc main_#t~mem110#1;havoc main_#t~ret111#1.base, main_#t~ret111#1.offset; [2025-02-08 06:05:48,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-36: SUMMARY for call main_#t~ret111#1.base, main_#t~ret111#1.offset := alt_malloc(~bvmul~32(12bv32, ~bvmul~32(2bv32, main_#t~mem110#1))); srcloc: null [2025-02-08 06:05:48,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-37: assume main_#t~short108#1;havoc main_#t~mem105#1;havoc main_#t~mem104#1;havoc main_#t~mem106#1.base, main_#t~mem106#1.offset;havoc main_#t~mem107#1;havoc main_#t~short108#1; [2025-02-08 06:05:48,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-37: assume !main_#t~short108#1;havoc main_#t~mem105#1;havoc main_#t~mem104#1;havoc main_#t~mem106#1.base, main_#t~mem106#1.offset;havoc main_#t~mem107#1;havoc main_#t~short108#1; [2025-02-08 06:05:48,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-38: assume main_#t~short108#1;call main_#t~mem106#1.base, main_#t~mem106#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem107#1 := read~intINTTYPE4#3(main_#t~mem106#1.base, ~bvadd~32(36bv32, main_#t~mem106#1.offset), 4bv32);main_#t~short108#1 := 0bv32 == main_#t~mem107#1; [2025-02-08 06:05:48,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-38: assume !main_#t~short108#1; [2025-02-08 06:05:48,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-39: call write~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4bv32);call main_#t~mem105#1 := read~intINTTYPE4#3(main_~_ha_head~0#1.base, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset), 4bv32);call main_#t~mem104#1 := read~intINTTYPE4#3(main_~_ha_head~0#1.base, ~bvadd~32(8bv32, main_~_ha_head~0#1.offset), 4bv32);main_#t~short108#1 := ~bvuge~32(main_#t~mem105#1, ~bvmul~32(10bv32, ~bvadd~32(1bv32, main_#t~mem104#1))); [2025-02-08 06:05:48,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-40: assume main_#t~mem102#1.base != 0bv32 || main_#t~mem102#1.offset != 0bv32;havoc main_#t~mem102#1.base, main_#t~mem102#1.offset;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$#3(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4bv32);call write~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), main_#t~mem103#1.base, ~bvadd~32(12bv32, main_#t~mem103#1.offset), 4bv32);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset; [2025-02-08 06:05:48,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-40: assume !(main_#t~mem102#1.base != 0bv32 || main_#t~mem102#1.offset != 0bv32);havoc main_#t~mem102#1.base, main_#t~mem102#1.offset; [2025-02-08 06:05:48,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-41: assume true;call main_#t~mem95#1.base, main_#t~mem95#1.offset := read~$Pointer$#3(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32);call main_#t~mem96#1 := read~intINTTYPE4#3(main_#t~mem95#1.base, ~bvadd~32(4bv32, main_#t~mem95#1.offset), 4bv32);main_~_ha_bkt~0#1 := ~bvand~32(main_~_ha_hashv~0#1, ~bvsub~32(main_#t~mem96#1, 1bv32));havoc main_#t~mem95#1.base, main_#t~mem95#1.offset;havoc main_#t~mem96#1; [2025-02-08 06:05:48,744 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-41: assume !true; [2025-02-08 06:05:48,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-42: assume false; [2025-02-08 06:05:48,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-42: assume !false; [2025-02-08 06:05:48,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-43: main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; [2025-02-08 06:05:48,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-44: assume true; [2025-02-08 06:05:48,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-44: assume !true; [2025-02-08 06:05:48,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-45: assume false; [2025-02-08 06:05:48,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-45: assume !false; [2025-02-08 06:05:48,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-46: havoc main_#t~mem81#1.base, main_#t~mem81#1.offset; [2025-02-08 06:05:48,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-47: SUMMARY for call alt_free(main_#t~mem81#1.base, main_#t~mem81#1.offset, 44bv32); srcloc: null [2025-02-08 06:05:48,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-48: havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;havoc main_#t~mem83#1.base, main_#t~mem83#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;havoc main_#t~mem83#1.base, main_#t~mem83#1.offset; [2025-02-08 06:05:48,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-49: SUMMARY for call alt_bzero(main_#t~mem83#1.base, main_#t~mem83#1.offset, 384bv32); srcloc: null [2025-02-08 06:05:48,745 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-50: assume main_#t~mem80#1.base == 0bv32 && main_#t~mem80#1.offset == 0bv32;havoc main_#t~mem79#1.base, main_#t~mem79#1.offset;havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;assume false;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); [2025-02-08 06:05:48,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-50: assume !(main_#t~mem80#1.base == 0bv32 && main_#t~mem80#1.offset == 0bv32);havoc main_#t~mem79#1.base, main_#t~mem79#1.offset;havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$#3(main_#t~mem82#1.base, main_#t~mem82#1.offset, 4bv32); [2025-02-08 06:05:48,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-51: call write~$Pointer$#3(main_#t~ret77#1.base, main_#t~ret77#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, 4bv32);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;havoc main_#t~ret77#1.base, main_#t~ret77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call write~intINTTYPE4#3(2685476833bv32, main_#t~mem78#1.base, ~bvadd~32(40bv32, main_#t~mem78#1.offset), 4bv32);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;call main_#t~mem79#1.base, main_#t~mem79#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$#3(main_#t~mem79#1.base, main_#t~mem79#1.offset, 4bv32); [2025-02-08 06:05:48,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-52: SUMMARY for call main_#t~ret77#1.base, main_#t~ret77#1.offset := alt_malloc(384bv32); srcloc: null [2025-02-08 06:05:48,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-53: havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call write~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), main_#t~mem72#1.base, ~bvadd~32(16bv32, main_#t~mem72#1.offset), 4bv32);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call write~intINTTYPE4#3(32bv32, main_#t~mem73#1.base, ~bvadd~32(4bv32, main_#t~mem73#1.offset), 4bv32);havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call write~intINTTYPE4#3(5bv32, main_#t~mem74#1.base, ~bvadd~32(8bv32, main_#t~mem74#1.offset), 4bv32);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);call write~intINTTYPE4#3(~bvsub~32(~bvadd~32(8bv32, main_~user~0#1.offset), main_~user~0#1.offset), main_#t~mem75#1.base, ~bvadd~32(20bv32, main_#t~mem75#1.offset), 4bv32);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); [2025-02-08 06:05:48,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-54: SUMMARY for call alt_bzero(main_#t~mem71#1.base, main_#t~mem71#1.offset, 44bv32); srcloc: null [2025-02-08 06:05:48,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-55: assume main_#t~mem70#1.base == 0bv32 && main_#t~mem70#1.offset == 0bv32;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;assume false; [2025-02-08 06:05:48,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-55: assume !(main_#t~mem70#1.base == 0bv32 && main_#t~mem70#1.offset == 0bv32);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); [2025-02-08 06:05:48,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-56: call write~$Pointer$#3(main_#t~ret69#1.base, main_#t~ret69#1.offset, main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);havoc main_#t~ret69#1.base, main_#t~ret69#1.offset;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); [2025-02-08 06:05:48,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-57: SUMMARY for call main_#t~ret69#1.base, main_#t~ret69#1.offset := alt_malloc(44bv32); srcloc: null [2025-02-08 06:05:48,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-58: assume true;call write~$Pointer$#3(0bv32, 0bv32, main_~user~0#1.base, ~bvadd~32(8bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$#3(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$#3(main_#t~mem85#1.base, ~bvadd~32(16bv32, main_#t~mem85#1.offset), 4bv32);call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$#3(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32);call main_#t~mem88#1 := read~intINTTYPE4#3(main_#t~mem87#1.base, ~bvadd~32(20bv32, main_#t~mem87#1.offset), 4bv32);call write~$Pointer$#3(main_#t~mem86#1.base, ~bvsub~32(main_#t~mem86#1.offset, main_#t~mem88#1), main_~user~0#1.base, ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32);havoc main_#t~mem85#1.base, main_#t~mem85#1.offset;havoc main_#t~mem86#1.base, main_#t~mem86#1.offset;havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1;call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$#3(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32);call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$#3(main_#t~mem89#1.base, ~bvadd~32(16bv32, main_#t~mem89#1.offset), 4bv32);call write~$Pointer$#3(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem90#1.base, ~bvadd~32(8bv32, main_#t~mem90#1.offset), 4bv32);havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset;call main_#t~mem91#1.base, main_#t~mem91#1.offset := read~$Pointer$#3(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32);call write~$Pointer$#3(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), main_#t~mem91#1.base, ~bvadd~32(16bv32, main_#t~mem91#1.offset), 4bv32);havoc main_#t~mem91#1.base, main_#t~mem91#1.offset; [2025-02-08 06:05:48,746 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-58: assume !true; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-59: assume false; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-59: assume !false; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-60: assume main_~users~0#1.base == 0bv32 && main_~users~0#1.offset == 0bv32;call write~$Pointer$#3(0bv32, 0bv32, main_~user~0#1.base, ~bvadd~32(8bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32);call write~$Pointer$#3(0bv32, 0bv32, main_~user~0#1.base, ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32); [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-60: assume !(main_~users~0#1.base == 0bv32 && main_~users~0#1.offset == 0bv32);call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$#3(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32);call write~$Pointer$#3(main_#t~mem84#1.base, main_#t~mem84#1.offset, main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32);havoc main_#t~mem84#1.base, main_#t~mem84#1.offset; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-61: assume true; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-61: assume !true; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-62: assume false; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-62: assume !false; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-63: assume true;havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775bv32;main_~_hj_j~0#1 := 2654435769bv32;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4bv32; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-63: assume !true; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-64: assume false; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-64: assume !false; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-65: havoc main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-66: assume true;main_~_hj_i~0#1 := ~bvsub~32(main_~_hj_i~0#1, main_~_hj_j~0#1);main_~_hj_i~0#1 := ~bvsub~32(main_~_hj_i~0#1, main_~_ha_hashv~0#1);main_~_hj_i~0#1 := ~bvxor~32(main_~_hj_i~0#1, ~bvlshr~32(main_~_ha_hashv~0#1, 13bv32));main_~_hj_j~0#1 := ~bvsub~32(main_~_hj_j~0#1, main_~_ha_hashv~0#1);main_~_hj_j~0#1 := ~bvsub~32(main_~_hj_j~0#1, main_~_hj_i~0#1);main_~_hj_j~0#1 := ~bvxor~32(main_~_hj_j~0#1, ~bvshl~32(main_~_hj_i~0#1, 8bv32));main_~_ha_hashv~0#1 := ~bvsub~32(main_~_ha_hashv~0#1, main_~_hj_i~0#1);main_~_ha_hashv~0#1 := ~bvsub~32(main_~_ha_hashv~0#1, main_~_hj_j~0#1);main_~_ha_hashv~0#1 := ~bvxor~32(main_~_ha_hashv~0#1, ~bvlshr~32(main_~_hj_j~0#1, 13bv32));main_~_hj_i~0#1 := ~bvsub~32(main_~_hj_i~0#1, main_~_hj_j~0#1);main_~_hj_i~0#1 := ~bvsub~32(main_~_hj_i~0#1, main_~_ha_hashv~0#1);main_~_hj_i~0#1 := ~bvxor~32(main_~_hj_i~0#1, ~bvlshr~32(main_~_ha_hashv~0#1, 12bv32));main_~_hj_j~0#1 := ~bvsub~32(main_~_hj_j~0#1, main_~_ha_hashv~0#1);main_~_hj_j~0#1 := ~bvsub~32(main_~_hj_j~0#1, main_~_hj_i~0#1);main_~_hj_j~0#1 := ~bvxor~32(main_~_hj_j~0#1, ~bvshl~32(main_~_hj_i~0#1, 16bv32));main_~_ha_hashv~0#1 := ~bvsub~32(main_~_ha_hashv~0#1, main_~_hj_i~0#1);main_~_ha_hashv~0#1 := ~bvsub~32(main_~_ha_hashv~0#1, main_~_hj_j~0#1);main_~_ha_hashv~0#1 := ~bvxor~32(main_~_ha_hashv~0#1, ~bvlshr~32(main_~_hj_j~0#1, 5bv32));main_~_hj_i~0#1 := ~bvsub~32(main_~_hj_i~0#1, main_~_hj_j~0#1);main_~_hj_i~0#1 := ~bvsub~32(main_~_hj_i~0#1, main_~_ha_hashv~0#1);main_~_hj_i~0#1 := ~bvxor~32(main_~_hj_i~0#1, ~bvlshr~32(main_~_ha_hashv~0#1, 3bv32));main_~_hj_j~0#1 := ~bvsub~32(main_~_hj_j~0#1, main_~_ha_hashv~0#1);main_~_hj_j~0#1 := ~bvsub~32(main_~_hj_j~0#1, main_~_hj_i~0#1);main_~_hj_j~0#1 := ~bvxor~32(main_~_hj_j~0#1, ~bvshl~32(main_~_hj_i~0#1, 10bv32));main_~_ha_hashv~0#1 := ~bvsub~32(main_~_ha_hashv~0#1, main_~_hj_i~0#1);main_~_ha_hashv~0#1 := ~bvsub~32(main_~_ha_hashv~0#1, main_~_hj_j~0#1);main_~_ha_hashv~0#1 := ~bvxor~32(main_~_ha_hashv~0#1, ~bvlshr~32(main_~_hj_j~0#1, 15bv32)); [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-66: assume !true; [2025-02-08 06:05:48,747 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-67: assume false; [2025-02-08 06:05:48,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-67: assume !false; [2025-02-08 06:05:48,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-68: havoc main_#t~switch57#1;havoc main_#t~mem58#1;havoc main_#t~mem59#1;havoc main_#t~mem60#1;havoc main_#t~mem61#1;havoc main_#t~mem62#1;havoc main_#t~mem63#1;havoc main_#t~mem64#1;havoc main_#t~mem65#1;havoc main_#t~mem66#1;havoc main_#t~mem67#1;havoc main_#t~mem68#1;havoc main_#t~switch57#1;havoc main_#t~mem58#1;havoc main_#t~mem59#1;havoc main_#t~mem60#1;havoc main_#t~mem61#1;havoc main_#t~mem62#1;havoc main_#t~mem63#1;havoc main_#t~mem64#1;havoc main_#t~mem65#1;havoc main_#t~mem66#1;havoc main_#t~mem67#1;havoc main_#t~mem68#1; [2025-02-08 06:05:48,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-69: assume main_#t~switch57#1;call main_#t~mem68#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1bv32);main_~_hj_i~0#1 := ~bvadd~32(main_~_hj_i~0#1, ~zero_extend~32~8(main_#t~mem68#1)); [2025-02-08 06:05:48,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-69: assume !main_#t~switch57#1; [2025-02-08 06:05:48,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-70: main_#t~switch57#1 := main_#t~switch57#1 || 1bv32 == main_~_hj_k~0#1; [2025-02-08 06:05:48,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-71: assume main_#t~switch57#1;call main_#t~mem67#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(1bv32, main_~_hj_key~0#1.offset), 1bv32);main_~_hj_i~0#1 := ~bvadd~32(main_~_hj_i~0#1, ~bvshl~32(~zero_extend~32~8(main_#t~mem67#1), 8bv32)); [2025-02-08 06:05:48,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-71: assume !main_#t~switch57#1; [2025-02-08 06:05:48,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-72: main_#t~switch57#1 := main_#t~switch57#1 || 2bv32 == main_~_hj_k~0#1; [2025-02-08 06:05:48,748 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-73: assume main_#t~switch57#1;call main_#t~mem66#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(2bv32, main_~_hj_key~0#1.offset), 1bv32);main_~_hj_i~0#1 := ~bvadd~32(main_~_hj_i~0#1, ~bvshl~32(~zero_extend~32~8(main_#t~mem66#1), 16bv32)); [2025-02-08 06:05:48,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-73: assume !main_#t~switch57#1; [2025-02-08 06:05:48,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-74: main_#t~switch57#1 := main_#t~switch57#1 || 3bv32 == main_~_hj_k~0#1; [2025-02-08 06:05:48,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-75: assume main_#t~switch57#1;call main_#t~mem65#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(3bv32, main_~_hj_key~0#1.offset), 1bv32);main_~_hj_i~0#1 := ~bvadd~32(main_~_hj_i~0#1, ~bvshl~32(~zero_extend~32~8(main_#t~mem65#1), 24bv32)); [2025-02-08 06:05:48,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-75: assume !main_#t~switch57#1; [2025-02-08 06:05:48,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-76: main_#t~switch57#1 := main_#t~switch57#1 || 4bv32 == main_~_hj_k~0#1; [2025-02-08 06:05:48,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-77: assume main_#t~switch57#1;call main_#t~mem64#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(4bv32, main_~_hj_key~0#1.offset), 1bv32);main_~_hj_j~0#1 := ~bvadd~32(main_~_hj_j~0#1, ~zero_extend~32~8(main_#t~mem64#1)); [2025-02-08 06:05:48,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-77: assume !main_#t~switch57#1; [2025-02-08 06:05:48,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-78: main_#t~switch57#1 := main_#t~switch57#1 || 5bv32 == main_~_hj_k~0#1; [2025-02-08 06:05:48,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-79: assume main_#t~switch57#1;call main_#t~mem63#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(5bv32, main_~_hj_key~0#1.offset), 1bv32);main_~_hj_j~0#1 := ~bvadd~32(main_~_hj_j~0#1, ~bvshl~32(~zero_extend~32~8(main_#t~mem63#1), 8bv32)); [2025-02-08 06:05:48,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-79: assume !main_#t~switch57#1; [2025-02-08 06:05:48,749 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-80: main_#t~switch57#1 := main_#t~switch57#1 || 6bv32 == main_~_hj_k~0#1; [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-81: assume main_#t~switch57#1;call main_#t~mem62#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(6bv32, main_~_hj_key~0#1.offset), 1bv32);main_~_hj_j~0#1 := ~bvadd~32(main_~_hj_j~0#1, ~bvshl~32(~zero_extend~32~8(main_#t~mem62#1), 16bv32)); [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-81: assume !main_#t~switch57#1; [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-82: main_#t~switch57#1 := main_#t~switch57#1 || 7bv32 == main_~_hj_k~0#1; [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-83: assume main_#t~switch57#1;call main_#t~mem61#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(7bv32, main_~_hj_key~0#1.offset), 1bv32);main_~_hj_j~0#1 := ~bvadd~32(main_~_hj_j~0#1, ~bvshl~32(~zero_extend~32~8(main_#t~mem61#1), 24bv32)); [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-83: assume !main_#t~switch57#1; [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-84: main_#t~switch57#1 := main_#t~switch57#1 || 8bv32 == main_~_hj_k~0#1; [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-85: assume main_#t~switch57#1;call main_#t~mem60#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(8bv32, main_~_hj_key~0#1.offset), 1bv32);main_~_ha_hashv~0#1 := ~bvadd~32(main_~_ha_hashv~0#1, ~bvshl~32(~zero_extend~32~8(main_#t~mem60#1), 8bv32)); [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-85: assume !main_#t~switch57#1; [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-86: main_#t~switch57#1 := main_#t~switch57#1 || 9bv32 == main_~_hj_k~0#1; [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-87: assume main_#t~switch57#1;call main_#t~mem59#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(9bv32, main_~_hj_key~0#1.offset), 1bv32);main_~_ha_hashv~0#1 := ~bvadd~32(main_~_ha_hashv~0#1, ~bvshl~32(~zero_extend~32~8(main_#t~mem59#1), 16bv32)); [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-87: assume !main_#t~switch57#1; [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-88: main_#t~switch57#1 := main_#t~switch57#1 || 10bv32 == main_~_hj_k~0#1; [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-89: assume main_#t~switch57#1;call main_#t~mem58#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(10bv32, main_~_hj_key~0#1.offset), 1bv32);main_~_ha_hashv~0#1 := ~bvadd~32(main_~_ha_hashv~0#1, ~bvshl~32(~zero_extend~32~8(main_#t~mem58#1), 24bv32)); [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-89: assume !main_#t~switch57#1; [2025-02-08 06:05:48,750 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-90: assume ~bvuge~32(main_~_hj_k~0#1, 12bv32);call main_#t~mem46#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1bv32);call main_#t~mem45#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(1bv32, main_~_hj_key~0#1.offset), 1bv32);call main_#t~mem47#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(2bv32, main_~_hj_key~0#1.offset), 1bv32);call main_#t~mem48#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(3bv32, main_~_hj_key~0#1.offset), 1bv32);main_~_hj_i~0#1 := ~bvadd~32(main_~_hj_i~0#1, ~bvadd~32(~bvadd~32(~bvadd~32(~zero_extend~32~8(main_#t~mem46#1), ~bvshl~32(~zero_extend~32~8(main_#t~mem45#1), 8bv32)), ~bvshl~32(~zero_extend~32~8(main_#t~mem47#1), 16bv32)), ~bvshl~32(~zero_extend~32~8(main_#t~mem48#1), 24bv32)));havoc main_#t~mem46#1;havoc main_#t~mem45#1;havoc main_#t~mem47#1;havoc main_#t~mem48#1;call main_#t~mem50#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(4bv32, main_~_hj_key~0#1.offset), 1bv32);call main_#t~mem49#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(5bv32, main_~_hj_key~0#1.offset), 1bv32);call main_#t~mem51#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(6bv32, main_~_hj_key~0#1.offset), 1bv32);call main_#t~mem52#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(7bv32, main_~_hj_key~0#1.offset), 1bv32);main_~_hj_j~0#1 := ~bvadd~32(main_~_hj_j~0#1, ~bvadd~32(~bvadd~32(~bvadd~32(~zero_extend~32~8(main_#t~mem50#1), ~bvshl~32(~zero_extend~32~8(main_#t~mem49#1), 8bv32)), ~bvshl~32(~zero_extend~32~8(main_#t~mem51#1), 16bv32)), ~bvshl~32(~zero_extend~32~8(main_#t~mem52#1), 24bv32)));havoc main_#t~mem50#1;havoc main_#t~mem49#1;havoc main_#t~mem51#1;havoc main_#t~mem52#1;call main_#t~mem54#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(8bv32, main_~_hj_key~0#1.offset), 1bv32);call main_#t~mem53#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(9bv32, main_~_hj_key~0#1.offset), 1bv32);call main_#t~mem55#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(10bv32, main_~_hj_key~0#1.offset), 1bv32);call main_#t~mem56#1 := read~intINTTYPE1#3(main_~_hj_key~0#1.base, ~bvadd~32(11bv32, main_~_hj_key~0#1.offset), 1bv32);main_~_ha_hashv~0#1 := ~bvadd~32(main_~_ha_hashv~0#1, ~bvadd~32(~bvadd~32(~bvadd~32(~zero_extend~32~8(main_#t~mem54#1), ~bvshl~32(~zero_extend~32~8(main_#t~mem53#1), 8bv32)), ~bvshl~32(~zero_extend~32~8(main_#t~mem55#1), 16bv32)), ~bvshl~32(~zero_extend~32~8(main_#t~mem56#1), 24bv32)));havoc main_#t~mem54#1;havoc main_#t~mem53#1;havoc main_#t~mem55#1;havoc main_#t~mem56#1; [2025-02-08 06:05:48,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-90: assume !~bvuge~32(main_~_hj_k~0#1, 12bv32);main_~_ha_hashv~0#1 := ~bvadd~32(4bv32, main_~_ha_hashv~0#1);main_#t~switch57#1 := 11bv32 == main_~_hj_k~0#1; [2025-02-08 06:05:48,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-91: main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~_hj_key~0#1.base, ~bvadd~32(12bv32, main_~_hj_key~0#1.offset);main_~_hj_k~0#1 := ~bvsub~32(main_~_hj_k~0#1, 12bv32); [2025-02-08 06:05:48,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-92: assume true;main_~_hj_i~0#1 := ~bvsub~32(main_~_hj_i~0#1, main_~_hj_j~0#1);main_~_hj_i~0#1 := ~bvsub~32(main_~_hj_i~0#1, main_~_ha_hashv~0#1);main_~_hj_i~0#1 := ~bvxor~32(main_~_hj_i~0#1, ~bvlshr~32(main_~_ha_hashv~0#1, 13bv32));main_~_hj_j~0#1 := ~bvsub~32(main_~_hj_j~0#1, main_~_ha_hashv~0#1);main_~_hj_j~0#1 := ~bvsub~32(main_~_hj_j~0#1, main_~_hj_i~0#1);main_~_hj_j~0#1 := ~bvxor~32(main_~_hj_j~0#1, ~bvshl~32(main_~_hj_i~0#1, 8bv32));main_~_ha_hashv~0#1 := ~bvsub~32(main_~_ha_hashv~0#1, main_~_hj_i~0#1);main_~_ha_hashv~0#1 := ~bvsub~32(main_~_ha_hashv~0#1, main_~_hj_j~0#1);main_~_ha_hashv~0#1 := ~bvxor~32(main_~_ha_hashv~0#1, ~bvlshr~32(main_~_hj_j~0#1, 13bv32));main_~_hj_i~0#1 := ~bvsub~32(main_~_hj_i~0#1, main_~_hj_j~0#1);main_~_hj_i~0#1 := ~bvsub~32(main_~_hj_i~0#1, main_~_ha_hashv~0#1);main_~_hj_i~0#1 := ~bvxor~32(main_~_hj_i~0#1, ~bvlshr~32(main_~_ha_hashv~0#1, 12bv32));main_~_hj_j~0#1 := ~bvsub~32(main_~_hj_j~0#1, main_~_ha_hashv~0#1);main_~_hj_j~0#1 := ~bvsub~32(main_~_hj_j~0#1, main_~_hj_i~0#1);main_~_hj_j~0#1 := ~bvxor~32(main_~_hj_j~0#1, ~bvshl~32(main_~_hj_i~0#1, 16bv32));main_~_ha_hashv~0#1 := ~bvsub~32(main_~_ha_hashv~0#1, main_~_hj_i~0#1);main_~_ha_hashv~0#1 := ~bvsub~32(main_~_ha_hashv~0#1, main_~_hj_j~0#1);main_~_ha_hashv~0#1 := ~bvxor~32(main_~_ha_hashv~0#1, ~bvlshr~32(main_~_hj_j~0#1, 5bv32));main_~_hj_i~0#1 := ~bvsub~32(main_~_hj_i~0#1, main_~_hj_j~0#1);main_~_hj_i~0#1 := ~bvsub~32(main_~_hj_i~0#1, main_~_ha_hashv~0#1);main_~_hj_i~0#1 := ~bvxor~32(main_~_hj_i~0#1, ~bvlshr~32(main_~_ha_hashv~0#1, 3bv32));main_~_hj_j~0#1 := ~bvsub~32(main_~_hj_j~0#1, main_~_ha_hashv~0#1);main_~_hj_j~0#1 := ~bvsub~32(main_~_hj_j~0#1, main_~_hj_i~0#1);main_~_hj_j~0#1 := ~bvxor~32(main_~_hj_j~0#1, ~bvshl~32(main_~_hj_i~0#1, 10bv32));main_~_ha_hashv~0#1 := ~bvsub~32(main_~_ha_hashv~0#1, main_~_hj_i~0#1);main_~_ha_hashv~0#1 := ~bvsub~32(main_~_ha_hashv~0#1, main_~_hj_j~0#1);main_~_ha_hashv~0#1 := ~bvxor~32(main_~_ha_hashv~0#1, ~bvlshr~32(main_~_hj_j~0#1, 15bv32)); [2025-02-08 06:05:48,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-92: assume !true; [2025-02-08 06:05:48,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-93: assume false; [2025-02-08 06:05:48,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-93: assume !false; [2025-02-08 06:05:48,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L999-13: assume 0bv32 == main_#t~ret212#1;havoc main_#t~mem211#1.base, main_#t~mem211#1.offset;havoc main_#t~ret212#1; [2025-02-08 06:05:48,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L999-13: assume !(0bv32 == main_#t~ret212#1);havoc main_#t~mem211#1.base, main_#t~mem211#1.offset;havoc main_#t~ret212#1; [2025-02-08 06:05:48,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1;main_#t~ret212#1 := alt_memcmp_#res#1;havoc alt_memcmp_#t~pre35#1, alt_memcmp_#t~nondet36#1, alt_memcmp_~a#1.base, alt_memcmp_~a#1.offset, alt_memcmp_~b#1.base, alt_memcmp_~b#1.offset, alt_memcmp_~n#1;havoc alt_memcmp_#in~a#1.base, alt_memcmp_#in~a#1.offset, alt_memcmp_#in~b#1.base, alt_memcmp_#in~b#1.offset, alt_memcmp_#in~n#1;assume { :end_inline_alt_memcmp } true; [2025-02-08 06:05:48,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-08 06:05:48,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: call main_#t~mem171#1 := read~intINTTYPE4#2(main_~#i~0#1.base, main_~#i~0#1.offset, 4bv32);main_#t~post172#1 := main_#t~mem171#1;call write~intINTTYPE4#2(~bvadd~32(1bv32, main_#t~post172#1), main_~#i~0#1.base, main_~#i~0#1.offset, 4bv32);havoc main_#t~mem171#1;havoc main_#t~post172#1; [2025-02-08 06:05:48,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: assume main_~user~0#1.base == 0bv32 && main_~user~0#1.offset == 0bv32;assume false; [2025-02-08 06:05:48,752 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: assume !(main_~user~0#1.base == 0bv32 && main_~user~0#1.offset == 0bv32); [2025-02-08 06:05:48,782 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2025-02-08 06:05:48,782 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:05:48,790 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:05:48,792 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:05:48,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:05:48 BoogieIcfgContainer [2025-02-08 06:05:48,793 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:05:48,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:05:48,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:05:48,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:05:48,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:05:40" (1/3) ... [2025-02-08 06:05:48,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4b48f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:05:48, skipping insertion in model container [2025-02-08 06:05:48,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:42" (2/3) ... [2025-02-08 06:05:48,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4b48f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:05:48, skipping insertion in model container [2025-02-08 06:05:48,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:05:48" (3/3) ... [2025-02-08 06:05:48,802 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-1.i [2025-02-08 06:05:48,813 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:05:48,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test6-1.i that has 6 procedures, 132 locations, 1 initial locations, 36 loop locations, and 2 error locations. [2025-02-08 06:05:48,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:05:48,853 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@838d1a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:05:48,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 06:05:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 107 states have (on average 1.6168224299065421) internal successors, (173), 114 states have internal predecessors, (173), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:05:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 06:05:48,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:05:48,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:05:48,861 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:05:48,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:05:48,865 INFO L85 PathProgramCache]: Analyzing trace with hash -846433460, now seen corresponding path program 1 times [2025-02-08 06:05:48,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:05:48,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843966900] [2025-02-08 06:05:48,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:05:48,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:05:48,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:05:48,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:05:48,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:05:49,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 06:05:49,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 06:05:49,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:05:49,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:05:49,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 06:05:49,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:05:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:05:49,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:05:49,063 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:05:49,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843966900] [2025-02-08 06:05:49,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843966900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:05:49,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:05:49,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:05:49,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826472350] [2025-02-08 06:05:49,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:05:49,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 06:05:49,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:05:49,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 06:05:49,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 06:05:49,085 INFO L87 Difference]: Start difference. First operand has 125 states, 107 states have (on average 1.6168224299065421) internal successors, (173), 114 states have internal predecessors, (173), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:05:49,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:05:49,099 INFO L93 Difference]: Finished difference Result 119 states and 150 transitions. [2025-02-08 06:05:49,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 06:05:49,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 06:05:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:05:49,105 INFO L225 Difference]: With dead ends: 119 [2025-02-08 06:05:49,105 INFO L226 Difference]: Without dead ends: 115 [2025-02-08 06:05:49,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 06:05:49,109 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:05:49,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:05:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-08 06:05:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-02-08 06:05:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 106 states have internal predecessors, (132), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:05:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2025-02-08 06:05:49,139 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 146 transitions. Word has length 9 [2025-02-08 06:05:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:05:49,139 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 146 transitions. [2025-02-08 06:05:49,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:05:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2025-02-08 06:05:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:05:49,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:05:49,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:05:49,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:05:49,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:05:49,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:05:49,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:05:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1246080278, now seen corresponding path program 1 times [2025-02-08 06:05:49,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:05:49,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1460689513] [2025-02-08 06:05:49,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:05:49,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:05:49,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:05:49,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:05:49,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:05:49,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:05:49,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:05:49,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:05:49,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:05:49,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:05:49,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:05:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:05:49,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:05:49,676 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:05:49,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460689513] [2025-02-08 06:05:49,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460689513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:05:49,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:05:49,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:05:49,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043682693] [2025-02-08 06:05:49,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:05:49,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:05:49,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:05:49,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:05:49,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:05:49,678 INFO L87 Difference]: Start difference. First operand 115 states and 146 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:05:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:05:49,997 INFO L93 Difference]: Finished difference Result 186 states and 240 transitions. [2025-02-08 06:05:49,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:05:49,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 06:05:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:05:49,998 INFO L225 Difference]: With dead ends: 186 [2025-02-08 06:05:49,998 INFO L226 Difference]: Without dead ends: 186 [2025-02-08 06:05:49,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:05:49,999 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 85 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:05:49,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 389 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:05:50,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-08 06:05:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2025-02-08 06:05:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 173 states have internal predecessors, (221), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:05:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 235 transitions. [2025-02-08 06:05:50,009 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 235 transitions. Word has length 11 [2025-02-08 06:05:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:05:50,009 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 235 transitions. [2025-02-08 06:05:50,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:05:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2025-02-08 06:05:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:05:50,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:05:50,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:05:50,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:05:50,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:05:50,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:05:50,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:05:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash 587132010, now seen corresponding path program 1 times [2025-02-08 06:05:50,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 06:05:50,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [299771909] [2025-02-08 06:05:50,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:05:50,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:05:50,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:05:50,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:05:50,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:05:50,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:05:50,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:05:50,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:05:50,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:05:50,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 06:05:50,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:05:50,503 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:05:50,503 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:05:50,504 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:05:50,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-02-08 06:05:50,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:05:50,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-02-08 06:05:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:05:50,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:05:50,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 06:05:50,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299771909] [2025-02-08 06:05:50,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299771909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:05:50,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:05:50,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:05:50,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733045288] [2025-02-08 06:05:50,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:05:50,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:05:50,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 06:05:50,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:05:50,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:05:50,591 INFO L87 Difference]: Start difference. First operand 182 states and 235 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:05:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:05:50,632 INFO L93 Difference]: Finished difference Result 3 states and 2 transitions. [2025-02-08 06:05:50,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:05:50,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-08 06:05:50,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:05:50,633 INFO L225 Difference]: With dead ends: 3 [2025-02-08 06:05:50,633 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:05:50,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:05:50,634 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:05:50,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:05:50,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:05:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:05:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:05:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:05:50,634 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2025-02-08 06:05:50,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:05:50,634 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:05:50,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:05:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:05:50,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:05:50,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-02-08 06:05:50,641 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-02-08 06:05:50,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:05:50,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:05:50,845 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 06:05:50,847 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:05:50,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:05:50 BoogieIcfgContainer [2025-02-08 06:05:50,850 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:05:50,851 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:05:50,851 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:05:50,851 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:05:50,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:05:48" (3/4) ... [2025-02-08 06:05:50,859 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:05:50,867 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reach_error [2025-02-08 06:05:50,868 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure alt_malloc [2025-02-08 06:05:50,868 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 06:05:50,868 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure alt_free [2025-02-08 06:05:50,868 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure alt_bzero [2025-02-08 06:05:50,883 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-02-08 06:05:50,887 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 06:05:50,887 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 06:05:50,888 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:05:51,012 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:05:51,012 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:05:51,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:05:51,013 INFO L158 Benchmark]: Toolchain (without parser) took 10496.76ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 88.5MB in the beginning and 159.1MB in the end (delta: -70.5MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2025-02-08 06:05:51,013 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:05:51,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1781.60ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 75.0MB in the end (delta: 13.3MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2025-02-08 06:05:51,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.95ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 68.0MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:05:51,014 INFO L158 Benchmark]: Boogie Preprocessor took 165.77ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 50.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:05:51,015 INFO L158 Benchmark]: IcfgBuilder took 6256.66ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 50.2MB in the beginning and 123.4MB in the end (delta: -73.2MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2025-02-08 06:05:51,015 INFO L158 Benchmark]: TraceAbstraction took 2055.59ms. Allocated memory is still 260.0MB. Free memory was 122.7MB in the beginning and 169.5MB in the end (delta: -46.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:05:51,015 INFO L158 Benchmark]: Witness Printer took 161.56ms. Allocated memory is still 260.0MB. Free memory was 169.5MB in the beginning and 159.1MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:05:51,016 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1781.60ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 75.0MB in the end (delta: 13.3MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.95ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 68.0MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 165.77ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 50.2MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 6256.66ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 50.2MB in the beginning and 123.4MB in the end (delta: -73.2MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2055.59ms. Allocated memory is still 260.0MB. Free memory was 122.7MB in the beginning and 169.5MB in the end (delta: -46.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 161.56ms. Allocated memory is still 260.0MB. Free memory was 169.5MB in the beginning and 159.1MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 935]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 985]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 132 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 540 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 255 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 285 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 123 SizeOfPredicates, 3 NumberOfNonLiveVariables, 355 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:05:51,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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