./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_BER_test6-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:48:00,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:48:00,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 07:48:00,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:48:00,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:48:00,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:48:00,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:48:00,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:48:00,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:48:00,439 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:48:00,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:48:00,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:48:00,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:48:00,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:48:00,441 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:48:00,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:48:00,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:48:00,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:48:00,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:48:00,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:48:00,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:48:00,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:48:00,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:48:00,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:48:00,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:48:00,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:48:00,444 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d [2025-02-08 07:48:00,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:48:00,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:48:00,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:48:00,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:48:00,700 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:48:00,701 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_BER_test6-1.i [2025-02-08 07:48:01,837 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46c5fdc47/bf456cebb0d849688e667e79760ac1e7/FLAGc075047dc [2025-02-08 07:48:02,210 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:48:02,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2025-02-08 07:48:02,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46c5fdc47/bf456cebb0d849688e667e79760ac1e7/FLAGc075047dc [2025-02-08 07:48:02,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46c5fdc47/bf456cebb0d849688e667e79760ac1e7 [2025-02-08 07:48:02,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:48:02,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:48:02,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:48:02,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:48:02,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:48:02,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:48:02" (1/1) ... [2025-02-08 07:48:02,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b59d6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:02, skipping insertion in model container [2025-02-08 07:48:02,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:48:02" (1/1) ... [2025-02-08 07:48:02,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:48:02,879 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 07:48:02,907 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 07:48:02,909 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 07:48:02,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 07:48:02,918 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 07:48:02,943 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 07:48:02,943 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 07:48:02,944 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 07:48:02,945 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 07:48:02,946 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 07:48:02,947 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 07:48:02,948 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 07:48:02,948 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 07:48:02,954 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 07:48:02,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:48:02,980 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 07:48:02,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@276f16c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:02, skipping insertion in model container [2025-02-08 07:48:02,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:48:02,981 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-02-08 07:48:02,983 INFO L158 Benchmark]: Toolchain (without parser) took 574.95ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 88.4MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 07:48:02,984 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 07:48:02,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.41ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 88.4MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 07:48:02,985 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.18ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 573.41ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 88.4MB in the end (delta: 23.2MB). 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_BER_test6-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:48:04,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:48:04,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-08 07:48:04,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:48:04,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:48:04,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:48:04,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:48:04,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:48:04,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:48:04,979 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:48:04,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:48:04,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:48:04,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:48:04,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:48:04,980 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:48:04,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:48:04,981 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 07:48:04,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:48:04,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 07:48:04,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:48:04,981 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:48:04,981 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:48:04,981 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:48:04,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:48:04,982 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:48:04,982 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 07:48:04,982 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 07:48:04,982 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:48:04,982 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 07:48:04,982 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:48:04,982 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:48:04,982 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:48:04,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:48:04,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:48:04,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:48:04,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:48:04,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:48:04,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:48:04,983 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 07:48:04,983 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 07:48:04,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:48:04,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:48:04,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:48:04,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:48:04,984 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d [2025-02-08 07:48:05,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:48:05,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:48:05,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:48:05,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:48:05,238 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:48:05,239 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_BER_test6-1.i [2025-02-08 07:48:06,502 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60cfdaf23/d8a27cb6086e496395e58d58c33ec2cd/FLAG536ed2de0 [2025-02-08 07:48:06,830 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:48:06,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2025-02-08 07:48:06,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60cfdaf23/d8a27cb6086e496395e58d58c33ec2cd/FLAG536ed2de0 [2025-02-08 07:48:07,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60cfdaf23/d8a27cb6086e496395e58d58c33ec2cd [2025-02-08 07:48:07,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:48:07,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:48:07,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:48:07,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:48:07,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:48:07,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:07,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de2fe72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07, skipping insertion in model container [2025-02-08 07:48:07,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:07,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:48:07,443 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 07:48:07,480 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 07:48:07,482 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 07:48:07,484 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 07:48:07,490 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 07:48:07,514 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 07:48:07,515 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 07:48:07,519 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 07:48:07,519 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 07:48:07,521 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 07:48:07,522 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 07:48:07,522 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 07:48:07,523 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 07:48:07,525 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 07:48:07,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:48:07,538 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-02-08 07:48:07,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:48:07,577 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 07:48:07,587 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 07:48:07,588 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 07:48:07,590 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 07:48:07,593 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 07:48:07,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 07:48:07,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 07:48:07,613 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 07:48:07,613 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 07:48:07,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 07:48:07,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 07:48:07,616 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 07:48:07,616 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 07:48:07,618 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 07:48:07,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:48:07,631 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:48:07,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:48:07,794 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:48:07,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07 WrapperNode [2025-02-08 07:48:07,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:48:07,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:48:07,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:48:07,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:48:07,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:07,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:07,881 INFO L138 Inliner]: procedures = 286, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1033 [2025-02-08 07:48:07,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:48:07,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:48:07,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:48:07,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:48:07,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:07,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:07,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:07,974 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [220, 2, 12, 34]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [0, 2, 10, 0]. The 54 writes are split as follows [49, 0, 1, 4]. [2025-02-08 07:48:07,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:07,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:08,017 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:08,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:08,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:08,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:08,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:48:08,035 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:48:08,035 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:48:08,035 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:48:08,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07" (1/1) ... [2025-02-08 07:48:08,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:48:08,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:48:08,063 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 07:48:08,066 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 07:48:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 07:48:08,084 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 07:48:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-08 07:48:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-08 07:48:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-08 07:48:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-08 07:48:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-08 07:48:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-08 07:48:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-08 07:48:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-08 07:48:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 07:48:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 07:48:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 07:48:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 07:48:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 07:48:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:48:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-08 07:48:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-02-08 07:48:08,087 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 07:48:08,087 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:48:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:48:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-02-08 07:48:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-02-08 07:48:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 07:48:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 07:48:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 07:48:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 07:48:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-02-08 07:48:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-02-08 07:48:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:48:08,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:48:08,296 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:48:08,298 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:48:08,390 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-02-08 07:48:10,824 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 07:48:10,825 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 07:48:10,825 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 07:48:10,825 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: havoc main_#t~mem171#1;havoc main_#t~post172#1; [2025-02-08 07:48:10,825 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: SUMMARY for call write~intINTTYPE4#3(~bvadd~32(1bv32, main_#t~post172#1), main_~#i~0#1.base, main_~#i~0#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,826 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: assume !(1bv1 == #valid[main_~#i~0#1.base]); [2025-02-08 07:48:10,826 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: assume !((~bvule~32(~bvadd~32(4bv32, main_~#i~0#1.offset), #length[main_~#i~0#1.base]) && ~bvule~32(main_~#i~0#1.offset, ~bvadd~32(4bv32, main_~#i~0#1.offset))) && ~bvule~32(0bv32, main_~#i~0#1.offset)); [2025-02-08 07:48:10,826 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-3: main_#t~post172#1 := main_#t~mem171#1; [2025-02-08 07:48:10,826 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-4: SUMMARY for call main_#t~mem171#1 := read~intINTTYPE4#3(main_~#i~0#1.base, main_~#i~0#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,826 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-4: assume !(1bv1 == #valid[main_~#i~0#1.base]); [2025-02-08 07:48:10,826 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-4: assume !((~bvule~32(~bvadd~32(4bv32, main_~#i~0#1.offset), #length[main_~#i~0#1.base]) && ~bvule~32(main_~#i~0#1.offset, ~bvadd~32(4bv32, main_~#i~0#1.offset))) && ~bvule~32(0bv32, main_~#i~0#1.offset)); [2025-02-08 07:48:10,826 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 07:48:10,826 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: assume !(main_~user~0#1.base == 0bv32 && main_~user~0#1.offset == 0bv32); [2025-02-08 07:48:10,826 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L994: havoc main_#t~mem42#1; [2025-02-08 07:48:10,827 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L994-1: SUMMARY for call write~intINTTYPE4#0(main_#t~mem42#1, main_~user~0#1.base, main_~user~0#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L994-1: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L994-1: assume !((~bvule~32(~bvadd~32(4bv32, main_~user~0#1.offset), #length[main_~user~0#1.base]) && ~bvule~32(main_~user~0#1.offset, ~bvadd~32(4bv32, main_~user~0#1.offset))) && ~bvule~32(0bv32, main_~user~0#1.offset)); [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L994-2: SUMMARY for call main_#t~mem42#1 := read~intINTTYPE4#3(main_~#i~0#1.base, main_~#i~0#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L994-2: assume !(1bv1 == #valid[main_~#i~0#1.base]); [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L994-2: assume !((~bvule~32(~bvadd~32(4bv32, main_~#i~0#1.offset), #length[main_~#i~0#1.base]) && ~bvule~32(main_~#i~0#1.offset, ~bvadd~32(4bv32, main_~#i~0#1.offset))) && ~bvule~32(0bv32, main_~#i~0#1.offset)); [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L995: havoc main_#t~mem43#1;havoc main_#t~mem44#1; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-1: SUMMARY for call write~intINTTYPE4#0(~bvmul~32(main_#t~mem43#1, main_#t~mem44#1), main_~user~0#1.base, ~bvadd~32(4bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-1: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-1: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-2: SUMMARY for call main_#t~mem44#1 := read~intINTTYPE4#3(main_~#i~0#1.base, main_~#i~0#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-2: assume !(1bv1 == #valid[main_~#i~0#1.base]); [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-2: assume !((~bvule~32(~bvadd~32(4bv32, main_~#i~0#1.offset), #length[main_~#i~0#1.base]) && ~bvule~32(main_~#i~0#1.offset, ~bvadd~32(4bv32, main_~#i~0#1.offset))) && ~bvule~32(0bv32, main_~#i~0#1.offset)); [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-3: SUMMARY for call main_#t~mem43#1 := read~intINTTYPE4#3(main_~#i~0#1.base, main_~#i~0#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-3: assume !(1bv1 == #valid[main_~#i~0#1.base]); [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-3: assume !((~bvule~32(~bvadd~32(4bv32, main_~#i~0#1.offset), #length[main_~#i~0#1.base]) && ~bvule~32(main_~#i~0#1.offset, ~bvadd~32(4bv32, main_~#i~0#1.offset))) && ~bvule~32(0bv32, main_~#i~0#1.offset)); [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996: assume true;havoc main_~_ha_hashv~0#1; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996: assume !true; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-1: assume false; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-1: assume !false; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-2: havoc main_~_ha_hashv~0#1; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-3: assume true; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-3: assume !true; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-4: assume false; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-4: assume !false; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-5: assume true;havoc main_~_ha_bkt~0#1; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-5: assume !true; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-6: assume false; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-6: assume !false; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-7: havoc main_~_ha_bkt~0#1; [2025-02-08 07:48:10,828 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-8: assume true; [2025-02-08 07:48:10,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-8: assume !true; [2025-02-08 07:48:10,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-9: assume false; [2025-02-08 07:48:10,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-9: assume !false; [2025-02-08 07:48:10,829 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 07:48:10,829 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; [2025-02-08 07:48:10,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-11: assume !true; [2025-02-08 07:48:10,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-12: assume false; [2025-02-08 07:48:10,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-12: assume !false; [2025-02-08 07:48:10,829 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 07:48:10,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-14: 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 07:48:10,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-15: SUMMARY for call write~intINTTYPE4#0(1bv32, main_#t~mem170#1.base, ~bvadd~32(36bv32, main_#t~mem170#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-15: assume !(1bv1 == #valid[main_#t~mem170#1.base]); [2025-02-08 07:48:10,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-15: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(36bv32, main_#t~mem170#1.offset)), #length[main_#t~mem170#1.base]) && ~bvule~32(~bvadd~32(36bv32, main_#t~mem170#1.offset), ~bvadd~32(4bv32, ~bvadd~32(36bv32, main_#t~mem170#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(36bv32, main_#t~mem170#1.offset))); [2025-02-08 07:48:10,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-16: SUMMARY for call main_#t~mem170#1.base, main_#t~mem170#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,829 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-16: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-16: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-17: 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 07:48:10,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-17: 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 07:48:10,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-18: SUMMARY for call main_#t~mem169#1 := read~intINTTYPE4#0(main_#t~mem168#1.base, ~bvadd~32(32bv32, main_#t~mem168#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-18: assume !(1bv1 == #valid[main_#t~mem168#1.base]); [2025-02-08 07:48:10,830 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-18: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(32bv32, main_#t~mem168#1.offset)), #length[main_#t~mem168#1.base]) && ~bvule~32(~bvadd~32(32bv32, main_#t~mem168#1.offset), ~bvadd~32(4bv32, ~bvadd~32(32bv32, main_#t~mem168#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(32bv32, main_#t~mem168#1.offset))); [2025-02-08 07:48:10,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-19: SUMMARY for call main_#t~mem168#1.base, main_#t~mem168#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-19: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,831 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-19: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-20: 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; [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-21: SUMMARY for call write~intINTTYPE4#0(main_#t~ite167#1, main_#t~mem160#1.base, ~bvadd~32(32bv32, main_#t~mem160#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-21: assume !(1bv1 == #valid[main_#t~mem160#1.base]); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-21: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(32bv32, main_#t~mem160#1.offset)), #length[main_#t~mem160#1.base]) && ~bvule~32(~bvadd~32(32bv32, main_#t~mem160#1.offset), ~bvadd~32(4bv32, ~bvadd~32(32bv32, main_#t~mem160#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(32bv32, main_#t~mem160#1.offset))); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-22: main_#t~ite167#1 := ~bvadd~32(1bv32, main_#t~mem166#1); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-23: SUMMARY for call main_#t~mem166#1 := read~intINTTYPE4#0(main_#t~mem165#1.base, ~bvadd~32(32bv32, main_#t~mem165#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-23: assume !(1bv1 == #valid[main_#t~mem165#1.base]); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-23: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(32bv32, main_#t~mem165#1.offset)), #length[main_#t~mem165#1.base]) && ~bvule~32(~bvadd~32(32bv32, main_#t~mem165#1.offset), ~bvadd~32(4bv32, ~bvadd~32(32bv32, main_#t~mem165#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(32bv32, main_#t~mem165#1.offset))); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-24: SUMMARY for call main_#t~mem165#1.base, main_#t~mem165#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-24: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-24: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-25: assume ~bvugt~32(main_#t~mem164#1, ~bvlshr~32(main_#t~mem163#1, 1bv32)); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-25: assume !~bvugt~32(main_#t~mem164#1, ~bvlshr~32(main_#t~mem163#1, 1bv32));main_#t~ite167#1 := 0bv32; [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-26: SUMMARY for call main_#t~mem163#1 := read~intINTTYPE4#0(main_#t~mem162#1.base, ~bvadd~32(12bv32, main_#t~mem162#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-26: assume !(1bv1 == #valid[main_#t~mem162#1.base]); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-26: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem162#1.offset)), #length[main_#t~mem162#1.base]) && ~bvule~32(~bvadd~32(12bv32, main_#t~mem162#1.offset), ~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem162#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(12bv32, main_#t~mem162#1.offset))); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-27: SUMMARY for call main_#t~mem162#1.base, main_#t~mem162#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-27: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-27: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-28: SUMMARY for call main_#t~mem164#1 := read~intINTTYPE4#0(main_#t~mem161#1.base, ~bvadd~32(28bv32, main_#t~mem161#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-28: assume !(1bv1 == #valid[main_#t~mem161#1.base]); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-28: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(28bv32, main_#t~mem161#1.offset)), #length[main_#t~mem161#1.base]) && ~bvule~32(~bvadd~32(28bv32, main_#t~mem161#1.offset), ~bvadd~32(4bv32, ~bvadd~32(28bv32, main_#t~mem161#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(28bv32, main_#t~mem161#1.offset))); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-29: SUMMARY for call main_#t~mem161#1.base, main_#t~mem161#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-29: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-29: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-30: SUMMARY for call main_#t~mem160#1.base, main_#t~mem160#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-30: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-30: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,834 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-31: havoc main_#t~mem159#1.base, main_#t~mem159#1.offset; [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-32: SUMMARY for call write~$Pointer$#0(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); srcloc: null [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-32: assume !(1bv1 == #valid[main_#t~mem159#1.base]); [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-32: assume !((~bvule~32(~bvadd~32(4bv32, main_#t~mem159#1.offset), #length[main_#t~mem159#1.base]) && ~bvule~32(main_#t~mem159#1.offset, ~bvadd~32(4bv32, main_#t~mem159#1.offset))) && ~bvule~32(0bv32, main_#t~mem159#1.offset)); [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-33: SUMMARY for call main_#t~mem159#1.base, main_#t~mem159#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-33: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-33: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-34: havoc main_#t~mem156#1.base, main_#t~mem156#1.offset;havoc main_#t~mem157#1;havoc main_#t~post158#1; [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-35: SUMMARY for call write~intINTTYPE4#0(~bvadd~32(1bv32, main_#t~post158#1), main_#t~mem156#1.base, ~bvadd~32(8bv32, main_#t~mem156#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-35: assume !(1bv1 == #valid[main_#t~mem156#1.base]); [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-35: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_#t~mem156#1.offset)), #length[main_#t~mem156#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_#t~mem156#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_#t~mem156#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_#t~mem156#1.offset))); [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-36: main_#t~post158#1 := main_#t~mem157#1; [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-37: SUMMARY for call main_#t~mem157#1 := read~intINTTYPE4#0(main_#t~mem156#1.base, ~bvadd~32(8bv32, main_#t~mem156#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-37: assume !(1bv1 == #valid[main_#t~mem156#1.base]); [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-37: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_#t~mem156#1.offset)), #length[main_#t~mem156#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_#t~mem156#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_#t~mem156#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_#t~mem156#1.offset))); [2025-02-08 07:48:10,835 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-38: SUMMARY for call main_#t~mem156#1.base, main_#t~mem156#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-38: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-38: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-39: havoc main_#t~mem154#1.base, main_#t~mem154#1.offset;havoc main_#t~mem155#1; [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-40: SUMMARY for call write~intINTTYPE4#0(~bvmul~32(2bv32, main_#t~mem155#1), main_#t~mem154#1.base, ~bvadd~32(4bv32, main_#t~mem154#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-40: assume !(1bv1 == #valid[main_#t~mem154#1.base]); [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-40: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem154#1.offset)), #length[main_#t~mem154#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_#t~mem154#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem154#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_#t~mem154#1.offset))); [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-41: SUMMARY for call main_#t~mem155#1 := read~intINTTYPE4#0(main_#t~mem154#1.base, ~bvadd~32(4bv32, main_#t~mem154#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-41: assume !(1bv1 == #valid[main_#t~mem154#1.base]); [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-41: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem154#1.offset)), #length[main_#t~mem154#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_#t~mem154#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem154#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_#t~mem154#1.offset))); [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-42: SUMMARY for call main_#t~mem154#1.base, main_#t~mem154#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-42: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-42: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-43: 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; [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-44: 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 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-45: SUMMARY for call main_#t~mem153#1 := read~intINTTYPE4#0(main_#t~mem152#1.base, ~bvadd~32(4bv32, main_#t~mem152#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-45: assume !(1bv1 == #valid[main_#t~mem152#1.base]); [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-45: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem152#1.offset)), #length[main_#t~mem152#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_#t~mem152#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem152#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_#t~mem152#1.offset))); [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-46: SUMMARY for call main_#t~mem152#1.base, main_#t~mem152#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-46: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-46: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,836 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-47: SUMMARY for call main_#t~mem151#1.base, main_#t~mem151#1.offset := read~$Pointer$#0(main_#t~mem150#1.base, main_#t~mem150#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-47: assume !(1bv1 == #valid[main_#t~mem150#1.base]); [2025-02-08 07:48:10,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-47: assume !((~bvule~32(~bvadd~32(4bv32, main_#t~mem150#1.offset), #length[main_#t~mem150#1.base]) && ~bvule~32(main_#t~mem150#1.offset, ~bvadd~32(4bv32, main_#t~mem150#1.offset))) && ~bvule~32(0bv32, main_#t~mem150#1.offset)); [2025-02-08 07:48:10,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-48: SUMMARY for call main_#t~mem150#1.base, main_#t~mem150#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-48: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-48: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-49: assume true; [2025-02-08 07:48:10,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-49: assume !true; [2025-02-08 07:48:10,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-50: assume main_~_he_thh~0#1.base != 0bv32 || main_~_he_thh~0#1.offset != 0bv32; [2025-02-08 07:48:10,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-50: 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 07:48:10,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-51: 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 07:48:10,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-52: SUMMARY for call write~$Pointer$#0(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); srcloc: null [2025-02-08 07:48:10,837 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-52: assume !(1bv1 == #valid[main_~_he_newbkt~0#1.base]); [2025-02-08 07:48:10,838 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-52: assume !((~bvule~32(~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset), #length[main_~_he_newbkt~0#1.base]) && ~bvule~32(main_~_he_newbkt~0#1.offset, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset))) && ~bvule~32(0bv32, main_~_he_newbkt~0#1.offset)); [2025-02-08 07:48:10,838 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-53: havoc main_#t~mem148#1.base, main_#t~mem148#1.offset; [2025-02-08 07:48:10,838 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-54: SUMMARY for call write~$Pointer$#0(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); srcloc: null [2025-02-08 07:48:10,839 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-54: assume !(1bv1 == #valid[main_#t~mem148#1.base]); [2025-02-08 07:48:10,839 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-54: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem148#1.offset)), #length[main_#t~mem148#1.base]) && ~bvule~32(~bvadd~32(12bv32, main_#t~mem148#1.offset), ~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem148#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(12bv32, main_#t~mem148#1.offset))); [2025-02-08 07:48:10,839 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-55: SUMMARY for call main_#t~mem148#1.base, main_#t~mem148#1.offset := read~$Pointer$#0(main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,839 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-55: assume !(1bv1 == #valid[main_~_he_newbkt~0#1.base]); [2025-02-08 07:48:10,839 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-55: assume !((~bvule~32(~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset), #length[main_~_he_newbkt~0#1.base]) && ~bvule~32(main_~_he_newbkt~0#1.offset, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset))) && ~bvule~32(0bv32, main_~_he_newbkt~0#1.offset)); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-56: 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 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-56: 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 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-57: SUMMARY for call main_#t~mem147#1.base, main_#t~mem147#1.offset := read~$Pointer$#0(main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-57: assume !(1bv1 == #valid[main_~_he_newbkt~0#1.base]); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-57: assume !((~bvule~32(~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset), #length[main_~_he_newbkt~0#1.base]) && ~bvule~32(main_~_he_newbkt~0#1.offset, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset))) && ~bvule~32(0bv32, main_~_he_newbkt~0#1.offset)); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-58: havoc main_#t~mem146#1.base, main_#t~mem146#1.offset; [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-59: SUMMARY for call write~$Pointer$#0(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); srcloc: null [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-59: assume !(1bv1 == #valid[main_~_he_thh~0#1.base]); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-59: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(16bv32, main_~_he_thh~0#1.offset)), #length[main_~_he_thh~0#1.base]) && ~bvule~32(~bvadd~32(16bv32, main_~_he_thh~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(16bv32, main_~_he_thh~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(16bv32, main_~_he_thh~0#1.offset))); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-60: SUMMARY for call main_#t~mem146#1.base, main_#t~mem146#1.offset := read~$Pointer$#0(main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-60: assume !(1bv1 == #valid[main_~_he_newbkt~0#1.base]); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-60: assume !((~bvule~32(~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset), #length[main_~_he_newbkt~0#1.base]) && ~bvule~32(main_~_he_newbkt~0#1.offset, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset))) && ~bvule~32(0bv32, main_~_he_newbkt~0#1.offset)); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-61: SUMMARY for call write~$Pointer$#0(0bv32, 0bv32, main_~_he_thh~0#1.base, ~bvadd~32(12bv32, main_~_he_thh~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-61: assume !(1bv1 == #valid[main_~_he_thh~0#1.base]); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-61: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(12bv32, main_~_he_thh~0#1.offset)), #length[main_~_he_thh~0#1.base]) && ~bvule~32(~bvadd~32(12bv32, main_~_he_thh~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(12bv32, main_~_he_thh~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(12bv32, main_~_he_thh~0#1.offset))); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-62: havoc main_#t~mem144#1;havoc main_#t~post145#1; [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-63: SUMMARY for call write~intINTTYPE4#0(~bvadd~32(1bv32, main_#t~post145#1), main_~_he_newbkt~0#1.base, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-63: assume !(1bv1 == #valid[main_~_he_newbkt~0#1.base]); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-63: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset)), #length[main_~_he_newbkt~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset))); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-64: main_#t~post145#1 := main_#t~mem144#1; [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-65: SUMMARY for call main_#t~mem144#1 := read~intINTTYPE4#0(main_~_he_newbkt~0#1.base, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-65: assume !(1bv1 == #valid[main_~_he_newbkt~0#1.base]); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-65: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset)), #length[main_~_he_newbkt~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset))); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-66: 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 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-66: 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 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-67: SUMMARY for call main_#t~mem142#1 := read~intINTTYPE4#0(main_#t~mem140#1.base, ~bvadd~32(24bv32, main_#t~mem140#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-67: assume !(1bv1 == #valid[main_#t~mem140#1.base]); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-67: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(24bv32, main_#t~mem140#1.offset)), #length[main_#t~mem140#1.base]) && ~bvule~32(~bvadd~32(24bv32, main_#t~mem140#1.offset), ~bvadd~32(4bv32, ~bvadd~32(24bv32, main_#t~mem140#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(24bv32, main_#t~mem140#1.offset))); [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-68: SUMMARY for call main_#t~mem140#1.base, main_#t~mem140#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,840 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-68: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-68: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-69: SUMMARY for call main_#t~mem141#1 := read~intINTTYPE4#0(main_~_he_newbkt~0#1.base, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-69: assume !(1bv1 == #valid[main_~_he_newbkt~0#1.base]); [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-69: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset)), #length[main_~_he_newbkt~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~_he_newbkt~0#1.offset))); [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-70: SUMMARY for call main_#t~mem143#1 := read~intINTTYPE4#0(main_~_he_newbkt~0#1.base, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-70: assume !(1bv1 == #valid[main_~_he_newbkt~0#1.base]); [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-70: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset)), #length[main_~_he_newbkt~0#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset))); [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-71: havoc main_#t~mem137#1.base, main_#t~mem137#1.offset;havoc main_#t~mem138#1;havoc main_#t~post139#1; [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-72: SUMMARY for call write~intINTTYPE4#0(~bvadd~32(1bv32, main_#t~post139#1), main_#t~mem137#1.base, ~bvadd~32(28bv32, main_#t~mem137#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-72: assume !(1bv1 == #valid[main_#t~mem137#1.base]); [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-72: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(28bv32, main_#t~mem137#1.offset)), #length[main_#t~mem137#1.base]) && ~bvule~32(~bvadd~32(28bv32, main_#t~mem137#1.offset), ~bvadd~32(4bv32, ~bvadd~32(28bv32, main_#t~mem137#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(28bv32, main_#t~mem137#1.offset))); [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-73: main_#t~post139#1 := main_#t~mem138#1; [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-74: SUMMARY for call main_#t~mem138#1 := read~intINTTYPE4#0(main_#t~mem137#1.base, ~bvadd~32(28bv32, main_#t~mem137#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-74: assume !(1bv1 == #valid[main_#t~mem137#1.base]); [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-74: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(28bv32, main_#t~mem137#1.offset)), #length[main_#t~mem137#1.base]) && ~bvule~32(~bvadd~32(28bv32, main_#t~mem137#1.offset), ~bvadd~32(4bv32, ~bvadd~32(28bv32, main_#t~mem137#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(28bv32, main_#t~mem137#1.offset))); [2025-02-08 07:48:10,841 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-75: SUMMARY for call main_#t~mem137#1.base, main_#t~mem137#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-75: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-75: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-76: 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 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-76: 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 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-77: SUMMARY for call main_#t~mem136#1 := read~intINTTYPE4#0(main_#t~mem135#1.base, ~bvadd~32(24bv32, main_#t~mem135#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-77: assume !(1bv1 == #valid[main_#t~mem135#1.base]); [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-77: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(24bv32, main_#t~mem135#1.offset)), #length[main_#t~mem135#1.base]) && ~bvule~32(~bvadd~32(24bv32, main_#t~mem135#1.offset), ~bvadd~32(4bv32, ~bvadd~32(24bv32, main_#t~mem135#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(24bv32, main_#t~mem135#1.offset))); [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-78: SUMMARY for call main_#t~mem135#1.base, main_#t~mem135#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-78: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-78: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-79: SUMMARY for call write~intINTTYPE4#0(~bvadd~32(1bv32, main_#t~mem133#1), main_~_he_newbkt~0#1.base, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-79: assume !(1bv1 == #valid[main_~_he_newbkt~0#1.base]); [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-79: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset)), #length[main_~_he_newbkt~0#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset))); [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-80: main_#t~pre134#1 := ~bvadd~32(1bv32, main_#t~mem133#1); [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-81: SUMMARY for call main_#t~mem133#1 := read~intINTTYPE4#0(main_~_he_newbkt~0#1.base, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-81: assume !(1bv1 == #valid[main_~_he_newbkt~0#1.base]); [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-81: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset)), #length[main_~_he_newbkt~0#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_~_he_newbkt~0#1.offset))); [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-82: 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)); [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-83: assume true; [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-83: assume !true; [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-84: assume false; [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-84: assume !false; [2025-02-08 07:48:10,842 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-85: 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 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-86: SUMMARY for call main_#t~mem131#1 := read~intINTTYPE4#0(main_#t~mem130#1.base, ~bvadd~32(4bv32, main_#t~mem130#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-86: assume !(1bv1 == #valid[main_#t~mem130#1.base]); [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-86: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem130#1.offset)), #length[main_#t~mem130#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_#t~mem130#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem130#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_#t~mem130#1.offset))); [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-87: SUMMARY for call main_#t~mem130#1.base, main_#t~mem130#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-87: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-87: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-88: SUMMARY for call main_#t~mem132#1 := read~intINTTYPE4#0(main_~_he_thh~0#1.base, ~bvadd~32(28bv32, main_~_he_thh~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-88: assume !(1bv1 == #valid[main_~_he_thh~0#1.base]); [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-88: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(28bv32, main_~_he_thh~0#1.offset)), #length[main_~_he_thh~0#1.base]) && ~bvule~32(~bvadd~32(28bv32, main_~_he_thh~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(28bv32, main_~_he_thh~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(28bv32, main_~_he_thh~0#1.offset))); [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-89: 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 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-90: SUMMARY for call main_#t~mem129#1.base, main_#t~mem129#1.offset := read~$Pointer$#0(main_~_he_thh~0#1.base, ~bvadd~32(16bv32, main_~_he_thh~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-90: assume !(1bv1 == #valid[main_~_he_thh~0#1.base]); [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-90: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(16bv32, main_~_he_thh~0#1.offset)), #length[main_~_he_thh~0#1.base]) && ~bvule~32(~bvadd~32(16bv32, main_~_he_thh~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(16bv32, main_~_he_thh~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(16bv32, main_~_he_thh~0#1.offset))); [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-91: 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 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-92: SUMMARY for call main_#t~mem128#1.base, main_#t~mem128#1.offset := read~$Pointer$#0(main_#t~mem127#1.base, ~bvadd~32(main_#t~mem127#1.offset, ~bvmul~32(12bv32, main_~_he_bkt_i~0#1)), 4bv32); srcloc: null [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-92: assume !(1bv1 == #valid[main_#t~mem127#1.base]); [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-92: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(main_#t~mem127#1.offset, ~bvmul~32(12bv32, main_~_he_bkt_i~0#1))), #length[main_#t~mem127#1.base]) && ~bvule~32(~bvadd~32(main_#t~mem127#1.offset, ~bvmul~32(12bv32, main_~_he_bkt_i~0#1)), ~bvadd~32(4bv32, ~bvadd~32(main_#t~mem127#1.offset, ~bvmul~32(12bv32, main_~_he_bkt_i~0#1))))) && ~bvule~32(0bv32, ~bvadd~32(main_#t~mem127#1.offset, ~bvmul~32(12bv32, main_~_he_bkt_i~0#1)))); [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-93: SUMMARY for call main_#t~mem127#1.base, main_#t~mem127#1.offset := read~$Pointer$#0(main_#t~mem126#1.base, main_#t~mem126#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-93: assume !(1bv1 == #valid[main_#t~mem126#1.base]); [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-93: assume !((~bvule~32(~bvadd~32(4bv32, main_#t~mem126#1.offset), #length[main_#t~mem126#1.base]) && ~bvule~32(main_#t~mem126#1.offset, ~bvadd~32(4bv32, main_#t~mem126#1.offset))) && ~bvule~32(0bv32, main_#t~mem126#1.offset)); [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-94: SUMMARY for call main_#t~mem126#1.base, main_#t~mem126#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,844 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-94: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-94: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-95: 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 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-95: 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 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-96: SUMMARY for call main_#t~mem125#1 := read~intINTTYPE4#0(main_#t~mem124#1.base, ~bvadd~32(4bv32, main_#t~mem124#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-96: assume !(1bv1 == #valid[main_#t~mem124#1.base]); [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-96: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem124#1.offset)), #length[main_#t~mem124#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_#t~mem124#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem124#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_#t~mem124#1.offset))); [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-97: SUMMARY for call main_#t~mem124#1.base, main_#t~mem124#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-97: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-97: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-98: havoc main_#t~mem123#1.base, main_#t~mem123#1.offset;main_~_he_bkt_i~0#1 := 0bv32; [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-99: SUMMARY for call write~intINTTYPE4#0(0bv32, main_#t~mem123#1.base, ~bvadd~32(28bv32, main_#t~mem123#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-99: assume !(1bv1 == #valid[main_#t~mem123#1.base]); [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-99: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(28bv32, main_#t~mem123#1.offset)), #length[main_#t~mem123#1.base]) && ~bvule~32(~bvadd~32(28bv32, main_#t~mem123#1.offset), ~bvadd~32(4bv32, ~bvadd~32(28bv32, main_#t~mem123#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(28bv32, main_#t~mem123#1.offset))); [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-100: SUMMARY for call main_#t~mem123#1.base, main_#t~mem123#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-100: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-100: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-101: 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; [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-102: SUMMARY for call write~intINTTYPE4#0(~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); srcloc: null [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-102: assume !(1bv1 == #valid[main_#t~mem114#1.base]); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-102: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(24bv32, main_#t~mem114#1.offset)), #length[main_#t~mem114#1.base]) && ~bvule~32(~bvadd~32(24bv32, main_#t~mem114#1.offset), ~bvadd~32(4bv32, ~bvadd~32(24bv32, main_#t~mem114#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(24bv32, main_#t~mem114#1.offset))); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-103: SUMMARY for call main_#t~mem121#1 := read~intINTTYPE4#0(main_#t~mem120#1.base, ~bvadd~32(4bv32, main_#t~mem120#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-103: assume !(1bv1 == #valid[main_#t~mem120#1.base]); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-103: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem120#1.offset)), #length[main_#t~mem120#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_#t~mem120#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem120#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_#t~mem120#1.offset))); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-104: SUMMARY for call main_#t~mem120#1.base, main_#t~mem120#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-104: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-104: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-105: SUMMARY for call main_#t~mem122#1 := read~intINTTYPE4#0(main_#t~mem119#1.base, ~bvadd~32(12bv32, main_#t~mem119#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-105: assume !(1bv1 == #valid[main_#t~mem119#1.base]); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-105: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem119#1.offset)), #length[main_#t~mem119#1.base]) && ~bvule~32(~bvadd~32(12bv32, main_#t~mem119#1.offset), ~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem119#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(12bv32, main_#t~mem119#1.offset))); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-106: SUMMARY for call main_#t~mem119#1.base, main_#t~mem119#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-106: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-106: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-107: SUMMARY for call main_#t~mem117#1 := read~intINTTYPE4#0(main_#t~mem116#1.base, ~bvadd~32(8bv32, main_#t~mem116#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-107: assume !(1bv1 == #valid[main_#t~mem116#1.base]); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-107: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_#t~mem116#1.offset)), #length[main_#t~mem116#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_#t~mem116#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_#t~mem116#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_#t~mem116#1.offset))); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-108: SUMMARY for call main_#t~mem116#1.base, main_#t~mem116#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-108: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-108: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-109: SUMMARY for call main_#t~mem118#1 := read~intINTTYPE4#0(main_#t~mem115#1.base, ~bvadd~32(12bv32, main_#t~mem115#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-109: assume !(1bv1 == #valid[main_#t~mem115#1.base]); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-109: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem115#1.offset)), #length[main_#t~mem115#1.base]) && ~bvule~32(~bvadd~32(12bv32, main_#t~mem115#1.offset), ~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem115#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(12bv32, main_#t~mem115#1.offset))); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L999-17: 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 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L999-17: 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 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-110: SUMMARY for call main_#t~mem115#1.base, main_#t~mem115#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-110: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-110: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,847 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-111: SUMMARY for call main_#t~mem114#1.base, main_#t~mem114#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,848 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-111: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,848 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-111: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,848 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-112: havoc main_#t~mem112#1.base, main_#t~mem112#1.offset;havoc main_#t~mem113#1; [2025-02-08 07:48:10,848 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-113: 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 07:48:10,848 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-114: SUMMARY for call main_#t~mem113#1 := read~intINTTYPE4#0(main_#t~mem112#1.base, ~bvadd~32(4bv32, main_#t~mem112#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,848 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-114: assume !(1bv1 == #valid[main_#t~mem112#1.base]); [2025-02-08 07:48:10,848 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-114: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem112#1.offset)), #length[main_#t~mem112#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_#t~mem112#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem112#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_#t~mem112#1.offset))); [2025-02-08 07:48:10,848 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-115: SUMMARY for call main_#t~mem112#1.base, main_#t~mem112#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,848 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-115: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-115: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-116: assume main_~_he_new_buckets~0#1.base == 0bv32 && main_~_he_new_buckets~0#1.offset == 0bv32;assume false; [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-116: assume !(main_~_he_new_buckets~0#1.base == 0bv32 && main_~_he_new_buckets~0#1.offset == 0bv32); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-117: 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 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-118: 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 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-119: SUMMARY for call main_#t~mem110#1 := read~intINTTYPE4#0(main_#t~mem109#1.base, ~bvadd~32(4bv32, main_#t~mem109#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-119: assume !(1bv1 == #valid[main_#t~mem109#1.base]); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-119: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem109#1.offset)), #length[main_#t~mem109#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_#t~mem109#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem109#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_#t~mem109#1.offset))); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-120: SUMMARY for call main_#t~mem109#1.base, main_#t~mem109#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-120: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-120: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-121: 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 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-121: 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 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-122: main_#t~short108#1 := 0bv32 == main_#t~mem107#1; [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-123: SUMMARY for call main_#t~mem107#1 := read~intINTTYPE4#0(main_#t~mem106#1.base, ~bvadd~32(36bv32, main_#t~mem106#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-123: assume !(1bv1 == #valid[main_#t~mem106#1.base]); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-123: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(36bv32, main_#t~mem106#1.offset)), #length[main_#t~mem106#1.base]) && ~bvule~32(~bvadd~32(36bv32, main_#t~mem106#1.offset), ~bvadd~32(4bv32, ~bvadd~32(36bv32, main_#t~mem106#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(36bv32, main_#t~mem106#1.offset))); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-124: SUMMARY for call main_#t~mem106#1.base, main_#t~mem106#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-124: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-124: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-125: assume main_#t~short108#1; [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-125: assume !main_#t~short108#1; [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-126: main_#t~short108#1 := ~bvuge~32(main_#t~mem105#1, ~bvmul~32(10bv32, ~bvadd~32(1bv32, main_#t~mem104#1))); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-127: SUMMARY for call main_#t~mem104#1 := read~intINTTYPE4#0(main_~_ha_head~0#1.base, ~bvadd~32(8bv32, main_~_ha_head~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-127: assume !(1bv1 == #valid[main_~_ha_head~0#1.base]); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-127: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~_ha_head~0#1.offset)), #length[main_~_ha_head~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~_ha_head~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~_ha_head~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~_ha_head~0#1.offset))); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-128: SUMMARY for call main_#t~mem105#1 := read~intINTTYPE4#0(main_~_ha_head~0#1.base, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-128: assume !(1bv1 == #valid[main_~_ha_head~0#1.base]); [2025-02-08 07:48:10,849 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-128: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset)), #length[main_~_ha_head~0#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_~_ha_head~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset))); [2025-02-08 07:48:10,850 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-129: SUMMARY for call write~$Pointer$#0(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); srcloc: null [2025-02-08 07:48:10,850 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-129: assume !(1bv1 == #valid[main_~_ha_head~0#1.base]); [2025-02-08 07:48:10,850 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-129: assume !((~bvule~32(~bvadd~32(4bv32, main_~_ha_head~0#1.offset), #length[main_~_ha_head~0#1.base]) && ~bvule~32(main_~_ha_head~0#1.offset, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset))) && ~bvule~32(0bv32, main_~_ha_head~0#1.offset)); [2025-02-08 07:48:10,850 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-130: havoc main_#t~mem103#1.base, main_#t~mem103#1.offset; [2025-02-08 07:48:10,850 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-131: SUMMARY for call write~$Pointer$#0(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); srcloc: null [2025-02-08 07:48:10,850 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-131: assume !(1bv1 == #valid[main_#t~mem103#1.base]); [2025-02-08 07:48:10,850 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-131: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem103#1.offset)), #length[main_#t~mem103#1.base]) && ~bvule~32(~bvadd~32(12bv32, main_#t~mem103#1.offset), ~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem103#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(12bv32, main_#t~mem103#1.offset))); [2025-02-08 07:48:10,850 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-132: SUMMARY for call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$#0(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,850 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-132: assume !(1bv1 == #valid[main_~_ha_head~0#1.base]); [2025-02-08 07:48:10,850 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-132: assume !((~bvule~32(~bvadd~32(4bv32, main_~_ha_head~0#1.offset), #length[main_~_ha_head~0#1.base]) && ~bvule~32(main_~_ha_head~0#1.offset, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset))) && ~bvule~32(0bv32, main_~_ha_head~0#1.offset)); [2025-02-08 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-133: 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 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-133: 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 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-134: SUMMARY for call main_#t~mem102#1.base, main_#t~mem102#1.offset := read~$Pointer$#0(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-134: assume !(1bv1 == #valid[main_~_ha_head~0#1.base]); [2025-02-08 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-134: assume !((~bvule~32(~bvadd~32(4bv32, main_~_ha_head~0#1.offset), #length[main_~_ha_head~0#1.base]) && ~bvule~32(main_~_ha_head~0#1.offset, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset))) && ~bvule~32(0bv32, main_~_ha_head~0#1.offset)); [2025-02-08 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-135: SUMMARY for call write~$Pointer$#0(0bv32, 0bv32, main_~user~0#1.base, ~bvadd~32(12bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32); srcloc: null [2025-02-08 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-135: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-135: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(12bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(12bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), ~bvadd~32(4bv32, ~bvadd~32(12bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))))) && ~bvule~32(0bv32, ~bvadd~32(12bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))); [2025-02-08 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-136: havoc main_#t~mem101#1.base, main_#t~mem101#1.offset; [2025-02-08 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-137: SUMMARY for call write~$Pointer$#0(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); srcloc: null [2025-02-08 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-137: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-137: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(16bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(16bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), ~bvadd~32(4bv32, ~bvadd~32(16bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))))) && ~bvule~32(0bv32, ~bvadd~32(16bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))); [2025-02-08 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-138: SUMMARY for call main_#t~mem101#1.base, main_#t~mem101#1.offset := read~$Pointer$#0(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,851 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-138: assume !(1bv1 == #valid[main_~_ha_head~0#1.base]); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-138: assume !((~bvule~32(~bvadd~32(4bv32, main_~_ha_head~0#1.offset), #length[main_~_ha_head~0#1.base]) && ~bvule~32(main_~_ha_head~0#1.offset, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset))) && ~bvule~32(0bv32, main_~_ha_head~0#1.offset)); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-139: havoc main_#t~mem99#1;havoc main_#t~post100#1; [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-140: SUMMARY for call write~intINTTYPE4#0(~bvadd~32(1bv32, main_#t~post100#1), main_~_ha_head~0#1.base, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-140: assume !(1bv1 == #valid[main_~_ha_head~0#1.base]); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-140: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset)), #length[main_~_ha_head~0#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_~_ha_head~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset))); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-141: main_#t~post100#1 := main_#t~mem99#1; [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-142: SUMMARY for call main_#t~mem99#1 := read~intINTTYPE4#0(main_~_ha_head~0#1.base, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-142: assume !(1bv1 == #valid[main_~_ha_head~0#1.base]); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-142: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset)), #length[main_~_ha_head~0#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_~_ha_head~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_~_ha_head~0#1.offset))); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-143: 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; [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-144: SUMMARY for call main_#t~mem98#1.base, main_#t~mem98#1.offset := read~$Pointer$#0(main_#t~mem97#1.base, main_#t~mem97#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-144: assume !(1bv1 == #valid[main_#t~mem97#1.base]); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-144: assume !((~bvule~32(~bvadd~32(4bv32, main_#t~mem97#1.offset), #length[main_#t~mem97#1.base]) && ~bvule~32(main_#t~mem97#1.offset, ~bvadd~32(4bv32, main_#t~mem97#1.offset))) && ~bvule~32(0bv32, main_#t~mem97#1.offset)); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-145: SUMMARY for call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$#0(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-145: assume !(1bv1 == #valid[main_~users~0#1.base]); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-145: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)), #length[main_~users~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~users~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~users~0#1.offset))); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-146: assume true; [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-146: assume !true; [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-147: assume false; [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-147: assume !false; [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-148: 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 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-149: SUMMARY for call main_#t~mem96#1 := read~intINTTYPE4#0(main_#t~mem95#1.base, ~bvadd~32(4bv32, main_#t~mem95#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-149: assume !(1bv1 == #valid[main_#t~mem95#1.base]); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-149: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem95#1.offset)), #length[main_#t~mem95#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_#t~mem95#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem95#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_#t~mem95#1.offset))); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-150: SUMMARY for call main_#t~mem95#1.base, main_#t~mem95#1.offset := read~$Pointer$#0(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-150: assume !(1bv1 == #valid[main_~users~0#1.base]); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-150: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)), #length[main_~users~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~users~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~users~0#1.offset))); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-151: havoc main_#t~mem92#1.base, main_#t~mem92#1.offset;havoc main_#t~mem93#1;havoc main_#t~post94#1; [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-152: SUMMARY for call write~intINTTYPE4#0(~bvadd~32(1bv32, main_#t~post94#1), main_#t~mem92#1.base, ~bvadd~32(12bv32, main_#t~mem92#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-152: assume !(1bv1 == #valid[main_#t~mem92#1.base]); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-152: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem92#1.offset)), #length[main_#t~mem92#1.base]) && ~bvule~32(~bvadd~32(12bv32, main_#t~mem92#1.offset), ~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem92#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(12bv32, main_#t~mem92#1.offset))); [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-153: main_#t~post94#1 := main_#t~mem93#1; [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-154: SUMMARY for call main_#t~mem93#1 := read~intINTTYPE4#0(main_#t~mem92#1.base, ~bvadd~32(12bv32, main_#t~mem92#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,852 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-154: assume !(1bv1 == #valid[main_#t~mem92#1.base]); [2025-02-08 07:48:10,853 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-154: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem92#1.offset)), #length[main_#t~mem92#1.base]) && ~bvule~32(~bvadd~32(12bv32, main_#t~mem92#1.offset), ~bvadd~32(4bv32, ~bvadd~32(12bv32, main_#t~mem92#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(12bv32, main_#t~mem92#1.offset))); [2025-02-08 07:48:10,853 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-155: SUMMARY for call main_#t~mem92#1.base, main_#t~mem92#1.offset := read~$Pointer$#0(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,853 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-155: assume !(1bv1 == #valid[main_~users~0#1.base]); [2025-02-08 07:48:10,853 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-155: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)), #length[main_~users~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~users~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~users~0#1.offset))); [2025-02-08 07:48:10,853 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-156: main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; [2025-02-08 07:48:10,853 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-157: assume true; [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-157: assume !true; [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-158: assume false; [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-158: assume !false; [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-159: havoc main_#t~mem81#1.base, main_#t~mem81#1.offset; [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-160: SUMMARY for call alt_free(main_#t~mem81#1.base, main_#t~mem81#1.offset, 44bv32); srcloc: null [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-161: SUMMARY for call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-161: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-161: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-162: 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 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-163: SUMMARY for call alt_bzero(main_#t~mem83#1.base, main_#t~mem83#1.offset, 384bv32); srcloc: null [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-164: SUMMARY for call main_#t~mem83#1.base, main_#t~mem83#1.offset := read~$Pointer$#0(main_#t~mem82#1.base, main_#t~mem82#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-164: assume !(1bv1 == #valid[main_#t~mem82#1.base]); [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-164: assume !((~bvule~32(~bvadd~32(4bv32, main_#t~mem82#1.offset), #length[main_#t~mem82#1.base]) && ~bvule~32(main_#t~mem82#1.offset, ~bvadd~32(4bv32, main_#t~mem82#1.offset))) && ~bvule~32(0bv32, main_#t~mem82#1.offset)); [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-165: SUMMARY for call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-165: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,854 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-165: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-166: 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; [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-166: 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; [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-167: SUMMARY for call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$#0(main_#t~mem79#1.base, main_#t~mem79#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-167: assume !(1bv1 == #valid[main_#t~mem79#1.base]); [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-167: assume !((~bvule~32(~bvadd~32(4bv32, main_#t~mem79#1.offset), #length[main_#t~mem79#1.base]) && ~bvule~32(main_#t~mem79#1.offset, ~bvadd~32(4bv32, main_#t~mem79#1.offset))) && ~bvule~32(0bv32, main_#t~mem79#1.offset)); [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-168: SUMMARY for call main_#t~mem79#1.base, main_#t~mem79#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-168: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-168: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-169: havoc main_#t~mem78#1.base, main_#t~mem78#1.offset; [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-170: SUMMARY for call write~intINTTYPE4#0(2685476833bv32, main_#t~mem78#1.base, ~bvadd~32(40bv32, main_#t~mem78#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-170: assume !(1bv1 == #valid[main_#t~mem78#1.base]); [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-170: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(40bv32, main_#t~mem78#1.offset)), #length[main_#t~mem78#1.base]) && ~bvule~32(~bvadd~32(40bv32, main_#t~mem78#1.offset), ~bvadd~32(4bv32, ~bvadd~32(40bv32, main_#t~mem78#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(40bv32, main_#t~mem78#1.offset))); [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-171: SUMMARY for call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-171: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-171: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-172: havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;havoc main_#t~ret77#1.base, main_#t~ret77#1.offset; [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-173: SUMMARY for call write~$Pointer$#0(main_#t~ret77#1.base, main_#t~ret77#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, 4bv32); srcloc: null [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-173: assume !(1bv1 == #valid[main_#t~mem76#1.base]); [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-173: assume !((~bvule~32(~bvadd~32(4bv32, main_#t~mem76#1.offset), #length[main_#t~mem76#1.base]) && ~bvule~32(main_#t~mem76#1.offset, ~bvadd~32(4bv32, main_#t~mem76#1.offset))) && ~bvule~32(0bv32, main_#t~mem76#1.offset)); [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-174: SUMMARY for call main_#t~ret77#1.base, main_#t~ret77#1.offset := alt_malloc(384bv32); srcloc: null [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-175: SUMMARY for call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-175: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,855 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-175: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-176: havoc main_#t~mem75#1.base, main_#t~mem75#1.offset; [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-177: SUMMARY for call write~intINTTYPE4#0(~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); srcloc: null [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-177: assume !(1bv1 == #valid[main_#t~mem75#1.base]); [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-177: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(20bv32, main_#t~mem75#1.offset)), #length[main_#t~mem75#1.base]) && ~bvule~32(~bvadd~32(20bv32, main_#t~mem75#1.offset), ~bvadd~32(4bv32, ~bvadd~32(20bv32, main_#t~mem75#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(20bv32, main_#t~mem75#1.offset))); [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-178: SUMMARY for call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-178: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-178: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-179: havoc main_#t~mem74#1.base, main_#t~mem74#1.offset; [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-180: SUMMARY for call write~intINTTYPE4#0(5bv32, main_#t~mem74#1.base, ~bvadd~32(8bv32, main_#t~mem74#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-180: assume !(1bv1 == #valid[main_#t~mem74#1.base]); [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-180: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_#t~mem74#1.offset)), #length[main_#t~mem74#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_#t~mem74#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_#t~mem74#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_#t~mem74#1.offset))); [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-181: SUMMARY for call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-181: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-181: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-182: havoc main_#t~mem73#1.base, main_#t~mem73#1.offset; [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-183: SUMMARY for call write~intINTTYPE4#0(32bv32, main_#t~mem73#1.base, ~bvadd~32(4bv32, main_#t~mem73#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-183: assume !(1bv1 == #valid[main_#t~mem73#1.base]); [2025-02-08 07:48:10,856 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-183: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem73#1.offset)), #length[main_#t~mem73#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_#t~mem73#1.offset), ~bvadd~32(4bv32, ~bvadd~32(4bv32, main_#t~mem73#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_#t~mem73#1.offset))); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-184: SUMMARY for call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-184: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-184: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-185: havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-186: SUMMARY for call write~$Pointer$#0(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); srcloc: null [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-186: assume !(1bv1 == #valid[main_#t~mem72#1.base]); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-186: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(16bv32, main_#t~mem72#1.offset)), #length[main_#t~mem72#1.base]) && ~bvule~32(~bvadd~32(16bv32, main_#t~mem72#1.offset), ~bvadd~32(4bv32, ~bvadd~32(16bv32, main_#t~mem72#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(16bv32, main_#t~mem72#1.offset))); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-187: SUMMARY for call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-187: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-187: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-188: havoc main_#t~mem71#1.base, main_#t~mem71#1.offset; [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-189: SUMMARY for call alt_bzero(main_#t~mem71#1.base, main_#t~mem71#1.offset, 44bv32); srcloc: null [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-190: SUMMARY for call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-190: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-190: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-191: 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 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-191: assume !(main_#t~mem70#1.base == 0bv32 && main_#t~mem70#1.offset == 0bv32);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset; [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-192: SUMMARY for call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$#0(main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-192: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-192: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-193: havoc main_#t~ret69#1.base, main_#t~ret69#1.offset; [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-194: SUMMARY for call write~$Pointer$#0(main_#t~ret69#1.base, main_#t~ret69#1.offset, main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-194: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-194: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-195: SUMMARY for call main_#t~ret69#1.base, main_#t~ret69#1.offset := alt_malloc(44bv32); srcloc: null [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-196: SUMMARY for call write~$Pointer$#0(0bv32, 0bv32, main_~user~0#1.base, ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32); srcloc: null [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-196: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-196: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), ~bvadd~32(4bv32, ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))); [2025-02-08 07:48:10,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-197: SUMMARY for call write~$Pointer$#0(0bv32, 0bv32, main_~user~0#1.base, ~bvadd~32(8bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32); srcloc: null [2025-02-08 07:48:10,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-197: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-197: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), ~bvadd~32(4bv32, ~bvadd~32(8bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))); [2025-02-08 07:48:10,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-198: assume true; [2025-02-08 07:48:10,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-198: assume !true; [2025-02-08 07:48:10,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-199: assume false; [2025-02-08 07:48:10,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-199: assume !false; [2025-02-08 07:48:10,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-200: havoc main_#t~mem91#1.base, main_#t~mem91#1.offset; [2025-02-08 07:48:10,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-201: SUMMARY for call write~$Pointer$#0(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); srcloc: null [2025-02-08 07:48:10,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-201: assume !(1bv1 == #valid[main_#t~mem91#1.base]); [2025-02-08 07:48:10,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-201: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(16bv32, main_#t~mem91#1.offset)), #length[main_#t~mem91#1.base]) && ~bvule~32(~bvadd~32(16bv32, main_#t~mem91#1.offset), ~bvadd~32(4bv32, ~bvadd~32(16bv32, main_#t~mem91#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(16bv32, main_#t~mem91#1.offset))); [2025-02-08 07:48:10,858 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-202: SUMMARY for call main_#t~mem91#1.base, main_#t~mem91#1.offset := read~$Pointer$#0(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-202: assume !(1bv1 == #valid[main_~users~0#1.base]); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-202: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)), #length[main_~users~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~users~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~users~0#1.offset))); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-203: havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1.base, main_#t~mem90#1.offset; [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-204: SUMMARY for call write~$Pointer$#0(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem90#1.base, ~bvadd~32(8bv32, main_#t~mem90#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-204: assume !(1bv1 == #valid[main_#t~mem90#1.base]); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-204: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_#t~mem90#1.offset)), #length[main_#t~mem90#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_#t~mem90#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_#t~mem90#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_#t~mem90#1.offset))); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-205: SUMMARY for call main_#t~mem90#1.base, main_#t~mem90#1.offset := read~$Pointer$#0(main_#t~mem89#1.base, ~bvadd~32(16bv32, main_#t~mem89#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-205: assume !(1bv1 == #valid[main_#t~mem89#1.base]); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-205: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(16bv32, main_#t~mem89#1.offset)), #length[main_#t~mem89#1.base]) && ~bvule~32(~bvadd~32(16bv32, main_#t~mem89#1.offset), ~bvadd~32(4bv32, ~bvadd~32(16bv32, main_#t~mem89#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(16bv32, main_#t~mem89#1.offset))); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-206: SUMMARY for call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$#0(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-206: assume !(1bv1 == #valid[main_~users~0#1.base]); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-206: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)), #length[main_~users~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~users~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~users~0#1.offset))); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-207: 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; [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-208: SUMMARY for call write~$Pointer$#0(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); srcloc: null [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-208: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-208: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), ~bvadd~32(4bv32, ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-209: SUMMARY for call main_#t~mem88#1 := read~intINTTYPE4#0(main_#t~mem87#1.base, ~bvadd~32(20bv32, main_#t~mem87#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-209: assume !(1bv1 == #valid[main_#t~mem87#1.base]); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-209: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(20bv32, main_#t~mem87#1.offset)), #length[main_#t~mem87#1.base]) && ~bvule~32(~bvadd~32(20bv32, main_#t~mem87#1.offset), ~bvadd~32(4bv32, ~bvadd~32(20bv32, main_#t~mem87#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(20bv32, main_#t~mem87#1.offset))); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-210: SUMMARY for call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$#0(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-210: assume !(1bv1 == #valid[main_~users~0#1.base]); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-210: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)), #length[main_~users~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~users~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~users~0#1.offset))); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-211: SUMMARY for call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$#0(main_#t~mem85#1.base, ~bvadd~32(16bv32, main_#t~mem85#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-211: assume !(1bv1 == #valid[main_#t~mem85#1.base]); [2025-02-08 07:48:10,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-211: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(16bv32, main_#t~mem85#1.offset)), #length[main_#t~mem85#1.base]) && ~bvule~32(~bvadd~32(16bv32, main_#t~mem85#1.offset), ~bvadd~32(4bv32, ~bvadd~32(16bv32, main_#t~mem85#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(16bv32, main_#t~mem85#1.offset))); [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-212: SUMMARY for call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$#0(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-212: assume !(1bv1 == #valid[main_~users~0#1.base]); [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-212: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)), #length[main_~users~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~users~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~users~0#1.offset))); [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-213: SUMMARY for call write~$Pointer$#0(0bv32, 0bv32, main_~user~0#1.base, ~bvadd~32(8bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32); srcloc: null [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-213: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-213: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), ~bvadd~32(4bv32, ~bvadd~32(8bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))); [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-214: havoc main_#t~mem84#1.base, main_#t~mem84#1.offset; [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-215: SUMMARY for call write~$Pointer$#0(main_#t~mem84#1.base, main_#t~mem84#1.offset, main_~user~0#1.base, ~bvadd~32(8bv32, main_~user~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-215: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-215: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~user~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))); [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-216: SUMMARY for call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$#0(main_~users~0#1.base, ~bvadd~32(8bv32, main_~users~0#1.offset), 4bv32); srcloc: null [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-216: assume !(1bv1 == #valid[main_~users~0#1.base]); [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-216: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)), #length[main_~users~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~users~0#1.offset), ~bvadd~32(4bv32, ~bvadd~32(8bv32, main_~users~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~users~0#1.offset))); [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-217: assume main_~users~0#1.base == 0bv32 && main_~users~0#1.offset == 0bv32; [2025-02-08 07:48:10,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-217: assume !(main_~users~0#1.base == 0bv32 && main_~users~0#1.offset == 0bv32); [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-218: SUMMARY for call write~intINTTYPE4#0(4bv32, main_~user~0#1.base, ~bvadd~32(24bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32); srcloc: null [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-218: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-218: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(24bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(24bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), ~bvadd~32(4bv32, ~bvadd~32(24bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))))) && ~bvule~32(0bv32, ~bvadd~32(24bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))); [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-219: SUMMARY for call write~$Pointer$#0(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); srcloc: null [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-219: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-219: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(20bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(20bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), ~bvadd~32(4bv32, ~bvadd~32(20bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))))) && ~bvule~32(0bv32, ~bvadd~32(20bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))); [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-220: SUMMARY for call write~intINTTYPE4#0(main_~_ha_hashv~0#1, main_~user~0#1.base, ~bvadd~32(28bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), 4bv32); srcloc: null [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-220: assume !(1bv1 == #valid[main_~user~0#1.base]); [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-220: assume !((~bvule~32(~bvadd~32(4bv32, ~bvadd~32(28bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))), #length[main_~user~0#1.base]) && ~bvule~32(~bvadd~32(28bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)), ~bvadd~32(4bv32, ~bvadd~32(28bv32, ~bvadd~32(8bv32, main_~user~0#1.offset))))) && ~bvule~32(0bv32, ~bvadd~32(28bv32, ~bvadd~32(8bv32, main_~user~0#1.offset)))); [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-221: assume true; [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-221: assume !true; [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-222: assume false; [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-222: assume !false; [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-223: 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 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-223: assume !true; [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-224: assume false; [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-224: assume !false; [2025-02-08 07:48:10,861 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-225: 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 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-226: 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 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-226: assume !true; [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-227: assume false; [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-227: assume !false; [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-228: 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 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-229: main_~_hj_i~0#1 := ~bvadd~32(main_~_hj_i~0#1, ~zero_extend~32~8(main_#t~mem68#1)); [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-230: SUMMARY for call main_#t~mem68#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1bv32); srcloc: null [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-230: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-230: assume !((~bvule~32(~bvadd~32(1bv32, main_~_hj_key~0#1.offset), #length[main_~_hj_key~0#1.base]) && ~bvule~32(main_~_hj_key~0#1.offset, ~bvadd~32(1bv32, main_~_hj_key~0#1.offset))) && ~bvule~32(0bv32, main_~_hj_key~0#1.offset)); [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-231: assume main_#t~switch57#1; [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-231: assume !main_#t~switch57#1; [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-232: main_#t~switch57#1 := main_#t~switch57#1 || 1bv32 == main_~_hj_k~0#1; [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-233: 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 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-234: SUMMARY for call main_#t~mem67#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(1bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-234: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-234: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(1bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(1bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(1bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(1bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-235: assume main_#t~switch57#1; [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-235: assume !main_#t~switch57#1; [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-236: main_#t~switch57#1 := main_#t~switch57#1 || 2bv32 == main_~_hj_k~0#1; [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-237: 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 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-238: SUMMARY for call main_#t~mem66#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(2bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-238: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,862 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-238: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(2bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(2bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(2bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(2bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-239: assume main_#t~switch57#1; [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-239: assume !main_#t~switch57#1; [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-240: main_#t~switch57#1 := main_#t~switch57#1 || 3bv32 == main_~_hj_k~0#1; [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-241: 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 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-242: SUMMARY for call main_#t~mem65#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(3bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-242: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-242: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(3bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(3bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(3bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(3bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-243: assume main_#t~switch57#1; [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-243: assume !main_#t~switch57#1; [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-244: main_#t~switch57#1 := main_#t~switch57#1 || 4bv32 == main_~_hj_k~0#1; [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-245: main_~_hj_j~0#1 := ~bvadd~32(main_~_hj_j~0#1, ~zero_extend~32~8(main_#t~mem64#1)); [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-246: SUMMARY for call main_#t~mem64#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(4bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-246: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-246: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(4bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(4bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-247: assume main_#t~switch57#1; [2025-02-08 07:48:10,863 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-247: assume !main_#t~switch57#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-248: main_#t~switch57#1 := main_#t~switch57#1 || 5bv32 == main_~_hj_k~0#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-249: 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 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-250: SUMMARY for call main_#t~mem63#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(5bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-250: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-250: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(5bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(5bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(5bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(5bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-251: assume main_#t~switch57#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-251: assume !main_#t~switch57#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-252: main_#t~switch57#1 := main_#t~switch57#1 || 6bv32 == main_~_hj_k~0#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-253: 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 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-254: SUMMARY for call main_#t~mem62#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(6bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-254: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-254: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(6bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(6bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(6bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(6bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-255: assume main_#t~switch57#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-255: assume !main_#t~switch57#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-256: main_#t~switch57#1 := main_#t~switch57#1 || 7bv32 == main_~_hj_k~0#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-257: 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 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-258: SUMMARY for call main_#t~mem61#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(7bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-258: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-258: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(7bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(7bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(7bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(7bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-259: assume main_#t~switch57#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-259: assume !main_#t~switch57#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-260: main_#t~switch57#1 := main_#t~switch57#1 || 8bv32 == main_~_hj_k~0#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-261: 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 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-262: SUMMARY for call main_#t~mem60#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(8bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-262: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-262: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(8bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(8bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-263: assume main_#t~switch57#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-263: assume !main_#t~switch57#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-264: main_#t~switch57#1 := main_#t~switch57#1 || 9bv32 == main_~_hj_k~0#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-265: 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 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-266: SUMMARY for call main_#t~mem59#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(9bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-266: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-266: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(9bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(9bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(9bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(9bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-267: assume main_#t~switch57#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-267: assume !main_#t~switch57#1; [2025-02-08 07:48:10,864 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-268: main_#t~switch57#1 := main_#t~switch57#1 || 10bv32 == main_~_hj_k~0#1; [2025-02-08 07:48:10,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-269: 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 07:48:10,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-270: SUMMARY for call main_#t~mem58#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(10bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-270: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-270: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(10bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(10bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(10bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(10bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-271: assume main_#t~switch57#1; [2025-02-08 07:48:10,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-271: assume !main_#t~switch57#1; [2025-02-08 07:48:10,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-272: assume ~bvuge~32(main_~_hj_k~0#1, 12bv32); [2025-02-08 07:48:10,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-272: 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 07:48:10,865 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-273: 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 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-274: 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 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-274: assume !true; [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-275: assume false; [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-275: assume !false; [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-276: 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 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-277: SUMMARY for call main_#t~mem56#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(11bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-277: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-277: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(11bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(11bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(11bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(11bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-278: SUMMARY for call main_#t~mem55#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(10bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-278: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-278: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(10bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(10bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(10bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(10bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-279: SUMMARY for call main_#t~mem53#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(9bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-279: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-279: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(9bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(9bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(9bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(9bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-280: SUMMARY for call main_#t~mem54#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(8bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-280: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-280: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(8bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(8bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(8bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(8bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-281: 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; [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-282: SUMMARY for call main_#t~mem52#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(7bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-282: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-282: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(7bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(7bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(7bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(7bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-283: SUMMARY for call main_#t~mem51#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(6bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-283: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,866 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-283: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(6bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(6bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(6bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(6bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-284: SUMMARY for call main_#t~mem49#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(5bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-284: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-284: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(5bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(5bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(5bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(5bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-285: SUMMARY for call main_#t~mem50#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(4bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-285: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-285: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(4bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(4bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(4bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(4bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-286: 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; [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-287: SUMMARY for call main_#t~mem48#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(3bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-287: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-287: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(3bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(3bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(3bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(3bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-288: SUMMARY for call main_#t~mem47#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(2bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-288: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-288: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(2bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(2bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(2bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(2bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-289: SUMMARY for call main_#t~mem45#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, ~bvadd~32(1bv32, main_~_hj_key~0#1.offset), 1bv32); srcloc: null [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-289: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,867 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-289: assume !((~bvule~32(~bvadd~32(1bv32, ~bvadd~32(1bv32, main_~_hj_key~0#1.offset)), #length[main_~_hj_key~0#1.base]) && ~bvule~32(~bvadd~32(1bv32, main_~_hj_key~0#1.offset), ~bvadd~32(1bv32, ~bvadd~32(1bv32, main_~_hj_key~0#1.offset)))) && ~bvule~32(0bv32, ~bvadd~32(1bv32, main_~_hj_key~0#1.offset))); [2025-02-08 07:48:10,868 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-290: SUMMARY for call main_#t~mem46#1 := read~intINTTYPE1#0(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1bv32); srcloc: null [2025-02-08 07:48:10,868 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-290: assume !(1bv1 == #valid[main_~_hj_key~0#1.base]); [2025-02-08 07:48:10,868 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-290: assume !((~bvule~32(~bvadd~32(1bv32, main_~_hj_key~0#1.offset), #length[main_~_hj_key~0#1.base]) && ~bvule~32(main_~_hj_key~0#1.offset, ~bvadd~32(1bv32, main_~_hj_key~0#1.offset))) && ~bvule~32(0bv32, main_~_hj_key~0#1.offset)); [2025-02-08 07:48:10,897 INFO L? ?]: Removed 452 outVars from TransFormulas that were not future-live. [2025-02-08 07:48:10,898 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:48:10,912 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:48:10,912 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 07:48:10,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:48:10 BoogieIcfgContainer [2025-02-08 07:48:10,912 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:48:10,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:48:10,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:48:10,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:48:10,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:48:07" (1/3) ... [2025-02-08 07:48:10,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47106473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:48:10, skipping insertion in model container [2025-02-08 07:48:10,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:48:07" (2/3) ... [2025-02-08 07:48:10,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47106473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:48:10, skipping insertion in model container [2025-02-08 07:48:10,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:48:10" (3/3) ... [2025-02-08 07:48:10,918 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-1.i [2025-02-08 07:48:10,927 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:48:10,928 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test6-1.i that has 6 procedures, 477 locations, 1 initial locations, 36 loop locations, and 522 error locations. [2025-02-08 07:48:10,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:48:10,968 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;@7972b8f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:48:10,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 522 error locations. [2025-02-08 07:48:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 462 states, 242 states have (on average 2.1074380165289255) internal successors, (510), 451 states have internal predecessors, (510), 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 07:48:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:48:10,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:48:10,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:48:10,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr510REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2025-02-08 07:48:10,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:48:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash 39679, now seen corresponding path program 1 times [2025-02-08 07:48:10,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:48:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846946946] [2025-02-08 07:48:10,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:48:10,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:48:10,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:48:10,996 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 07:48:10,998 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 07:48:11,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:48:11,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:48:11,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:48:11,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:48:11,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:48:11,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:48:11,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-08 07:48:11,182 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 07:48:11,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:48:11,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:48:11,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846946946] [2025-02-08 07:48:11,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846946946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:48:11,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:48:11,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:48:11,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975960098] [2025-02-08 07:48:11,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:48:11,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:48:11,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:48:11,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:48:11,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:48:11,205 INFO L87 Difference]: Start difference. First operand has 462 states, 242 states have (on average 2.1074380165289255) internal successors, (510), 451 states have internal predecessors, (510), 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 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 07:48:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:48:11,692 INFO L93 Difference]: Finished difference Result 457 states and 488 transitions. [2025-02-08 07:48:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:48:11,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2025-02-08 07:48:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:48:11,702 INFO L225 Difference]: With dead ends: 457 [2025-02-08 07:48:11,702 INFO L226 Difference]: Without dead ends: 453 [2025-02-08 07:48:11,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:48:11,705 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 416 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:48:11,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 324 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 07:48:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-02-08 07:48:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 444. [2025-02-08 07:48:11,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 236 states have (on average 1.9533898305084745) internal successors, (461), 435 states have internal predecessors, (461), 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 07:48:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 475 transitions. [2025-02-08 07:48:11,757 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 475 transitions. Word has length 2 [2025-02-08 07:48:11,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:48:11,757 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 475 transitions. [2025-02-08 07:48:11,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 07:48:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 475 transitions. [2025-02-08 07:48:11,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:48:11,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:48:11,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:48:11,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 07:48:11,962 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 07:48:11,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr511REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2025-02-08 07:48:11,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:48:11,963 INFO L85 PathProgramCache]: Analyzing trace with hash 39680, now seen corresponding path program 1 times [2025-02-08 07:48:11,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:48:11,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [408658378] [2025-02-08 07:48:11,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:48:11,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:48:11,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:48:11,965 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 07:48:11,967 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 07:48:12,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:48:12,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:48:12,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:48:12,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:48:12,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 07:48:12,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:48:12,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-08 07:48:12,097 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 07:48:12,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:48:12,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:48:12,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408658378] [2025-02-08 07:48:12,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408658378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:48:12,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:48:12,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:48:12,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313978475] [2025-02-08 07:48:12,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:48:12,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:48:12,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:48:12,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:48:12,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:48:12,098 INFO L87 Difference]: Start difference. First operand 444 states and 475 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 07:48:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:48:12,585 INFO L93 Difference]: Finished difference Result 438 states and 469 transitions. [2025-02-08 07:48:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:48:12,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) Word has length 2 [2025-02-08 07:48:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:48:12,586 INFO L225 Difference]: With dead ends: 438 [2025-02-08 07:48:12,587 INFO L226 Difference]: Without dead ends: 438 [2025-02-08 07:48:12,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:48:12,587 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 423 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:48:12,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 308 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:48:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-02-08 07:48:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-02-08 07:48:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 236 states have (on average 1.9279661016949152) internal successors, (455), 429 states have internal predecessors, (455), 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 07:48:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 469 transitions. [2025-02-08 07:48:12,597 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 469 transitions. Word has length 2 [2025-02-08 07:48:12,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:48:12,597 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 469 transitions. [2025-02-08 07:48:12,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 07:48:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 469 transitions. [2025-02-08 07:48:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 07:48:12,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:48:12,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:48:12,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 07:48:12,798 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 07:48:12,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2025-02-08 07:48:12,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:48:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2125816921, now seen corresponding path program 1 times [2025-02-08 07:48:12,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:48:12,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1724378591] [2025-02-08 07:48:12,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:48:12,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:48:12,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:48:12,804 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 07:48:12,805 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 07:48:12,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 07:48:12,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 07:48:12,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:48:12,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:48:12,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 07:48:12,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:48:12,974 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 07:48:12,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:48:12,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:48:12,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724378591] [2025-02-08 07:48:12,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724378591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:48:12,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:48:12,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:48:12,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250769835] [2025-02-08 07:48:12,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:48:12,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:48:12,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:48:12,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:48:12,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:48:12,975 INFO L87 Difference]: Start difference. First operand 438 states and 469 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 07:48:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:48:13,148 INFO L93 Difference]: Finished difference Result 735 states and 811 transitions. [2025-02-08 07:48:13,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:48:13,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2025-02-08 07:48:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:48:13,151 INFO L225 Difference]: With dead ends: 735 [2025-02-08 07:48:13,151 INFO L226 Difference]: Without dead ends: 735 [2025-02-08 07:48:13,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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 07:48:13,151 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 310 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:48:13,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1509 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:48:13,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-02-08 07:48:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 600. [2025-02-08 07:48:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 398 states have (on average 1.9422110552763818) internal successors, (773), 591 states have internal predecessors, (773), 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 07:48:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 787 transitions. [2025-02-08 07:48:13,174 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 787 transitions. Word has length 14 [2025-02-08 07:48:13,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:48:13,174 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 787 transitions. [2025-02-08 07:48:13,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 07:48:13,174 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 787 transitions. [2025-02-08 07:48:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 07:48:13,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:48:13,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:48:13,182 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 07:48:13,379 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 07:48:13,379 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr188REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2025-02-08 07:48:13,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:48:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1760883156, now seen corresponding path program 1 times [2025-02-08 07:48:13,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:48:13,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620575185] [2025-02-08 07:48:13,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:48:13,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:48:13,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:48:13,383 INFO L229 MonitoredProcess]: Starting monitored process 5 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 07:48:13,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 07:48:13,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 07:48:13,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 07:48:13,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:48:13,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:48:13,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 07:48:13,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:48:13,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2025-02-08 07:48:13,538 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 07:48:13,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:48:13,539 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:48:13,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620575185] [2025-02-08 07:48:13,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620575185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:48:13,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:48:13,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:48:13,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824338843] [2025-02-08 07:48:13,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:48:13,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:48:13,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:48:13,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:48:13,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:48:13,540 INFO L87 Difference]: Start difference. First operand 600 states and 787 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 07:48:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:48:14,052 INFO L93 Difference]: Finished difference Result 594 states and 758 transitions. [2025-02-08 07:48:14,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:48:14,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2025-02-08 07:48:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:48:14,054 INFO L225 Difference]: With dead ends: 594 [2025-02-08 07:48:14,054 INFO L226 Difference]: Without dead ends: 594 [2025-02-08 07:48:14,054 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 07:48:14,054 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 460 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:48:14,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 482 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:48:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-02-08 07:48:14,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 577. [2025-02-08 07:48:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 398 states have (on average 1.8266331658291457) internal successors, (727), 568 states have internal predecessors, (727), 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 07:48:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 741 transitions. [2025-02-08 07:48:14,067 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 741 transitions. Word has length 14 [2025-02-08 07:48:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:48:14,068 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 741 transitions. [2025-02-08 07:48:14,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 07:48:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 741 transitions. [2025-02-08 07:48:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 07:48:14,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:48:14,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:48:14,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 07:48:14,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:48:14,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr189REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2025-02-08 07:48:14,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:48:14,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1760883155, now seen corresponding path program 1 times [2025-02-08 07:48:14,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:48:14,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2023823237] [2025-02-08 07:48:14,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:48:14,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:48:14,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:48:14,278 INFO L229 MonitoredProcess]: Starting monitored process 6 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 07:48:14,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 07:48:14,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 07:48:14,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 07:48:14,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:48:14,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:48:14,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 07:48:14,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:48:14,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-08 07:48:14,485 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 07:48:14,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:48:14,485 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:48:14,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023823237] [2025-02-08 07:48:14,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023823237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:48:14,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:48:14,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:48:14,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155732431] [2025-02-08 07:48:14,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:48:14,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:48:14,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:48:14,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:48:14,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:48:14,486 INFO L87 Difference]: Start difference. First operand 577 states and 741 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 07:48:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:48:15,029 INFO L93 Difference]: Finished difference Result 532 states and 665 transitions. [2025-02-08 07:48:15,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:48:15,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2025-02-08 07:48:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:48:15,031 INFO L225 Difference]: With dead ends: 532 [2025-02-08 07:48:15,031 INFO L226 Difference]: Without dead ends: 532 [2025-02-08 07:48:15,032 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 07:48:15,032 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 399 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:48:15,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 464 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:48:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-08 07:48:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 511. [2025-02-08 07:48:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 347 states have (on average 1.8155619596541788) internal successors, (630), 502 states have internal predecessors, (630), 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 07:48:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 644 transitions. [2025-02-08 07:48:15,042 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 644 transitions. Word has length 14 [2025-02-08 07:48:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:48:15,042 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 644 transitions. [2025-02-08 07:48:15,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 07:48:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 644 transitions. [2025-02-08 07:48:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 07:48:15,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:48:15,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:48:15,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 07:48:15,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:48:15,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr165REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2025-02-08 07:48:15,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:48:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1247152832, now seen corresponding path program 1 times [2025-02-08 07:48:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:48:15,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917434440] [2025-02-08 07:48:15,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:48:15,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:48:15,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:48:15,250 INFO L229 MonitoredProcess]: Starting monitored process 7 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 07:48:15,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 07:48:15,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 07:48:15,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 07:48:15,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:48:15,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:48:15,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:48:15,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:48:15,405 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 07:48:15,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:48:15,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:48:15,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917434440] [2025-02-08 07:48:15,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917434440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:48:15,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:48:15,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:48:15,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819280685] [2025-02-08 07:48:15,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:48:15,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:48:15,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:48:15,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:48:15,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:48:15,406 INFO L87 Difference]: Start difference. First operand 511 states and 644 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 07:48:15,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:48:15,493 INFO L93 Difference]: Finished difference Result 502 states and 627 transitions. [2025-02-08 07:48:15,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:48:15,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 15 [2025-02-08 07:48:15,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:48:15,496 INFO L225 Difference]: With dead ends: 502 [2025-02-08 07:48:15,496 INFO L226 Difference]: Without dead ends: 502 [2025-02-08 07:48:15,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 07:48:15,498 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 42 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:48:15,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1066 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:48:15,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-08 07:48:15,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2025-02-08 07:48:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 346 states have (on average 1.7716763005780347) internal successors, (613), 493 states have internal predecessors, (613), 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 07:48:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 627 transitions. [2025-02-08 07:48:15,509 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 627 transitions. Word has length 15 [2025-02-08 07:48:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:48:15,509 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 627 transitions. [2025-02-08 07:48:15,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 07:48:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 627 transitions. [2025-02-08 07:48:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 07:48:15,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:48:15,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:48:15,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 07:48:15,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:48:15,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2025-02-08 07:48:15,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:48:15,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1389006853, now seen corresponding path program 1 times [2025-02-08 07:48:15,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 07:48:15,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1709406668] [2025-02-08 07:48:15,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:48:15,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:48:15,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:48:15,717 INFO L229 MonitoredProcess]: Starting monitored process 8 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 07:48:15,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 07:48:15,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 07:48:15,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 07:48:15,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:48:15,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:48:15,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 07:48:15,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:48:15,847 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:48:15,847 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:48:15,848 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 07:48:15,849 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 07:48:15,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:48:15,893 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 07:48:15,902 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 07:48:15,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 07:48:15,902 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 07:48:15,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709406668] [2025-02-08 07:48:15,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709406668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:48:15,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:48:15,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:48:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661137961] [2025-02-08 07:48:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:48:15,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:48:15,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 07:48:15,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:48:15,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:48:15,904 INFO L87 Difference]: Start difference. First operand 502 states and 627 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 07:48:15,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:48:15,928 INFO L93 Difference]: Finished difference Result 5 states and 4 transitions. [2025-02-08 07:48:15,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:48:15,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 17 [2025-02-08 07:48:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:48:15,929 INFO L225 Difference]: With dead ends: 5 [2025-02-08 07:48:15,929 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 07:48:15,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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 07:48:15,929 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:48:15,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:48:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 07:48:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 07:48:15,929 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 07:48:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 07:48:15,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2025-02-08 07:48:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:48:15,930 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 07:48:15,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 07:48:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 07:48:15,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 07:48:15,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (521 of 522 remaining) [2025-02-08 07:48:15,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (520 of 522 remaining) [2025-02-08 07:48:15,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (519 of 522 remaining) [2025-02-08 07:48:15,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location alt_freeErr0ASSERT_VIOLATIONMEMORY_FREE (518 of 522 remaining) [2025-02-08 07:48:15,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location alt_freeErr1ASSERT_VIOLATIONMEMORY_FREE (517 of 522 remaining) [2025-02-08 07:48:15,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location alt_freeErr2ASSERT_VIOLATIONMEMORY_FREE (516 of 522 remaining) [2025-02-08 07:48:15,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location alt_freeErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (515 of 522 remaining) [2025-02-08 07:48:15,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location alt_freeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (514 of 522 remaining) [2025-02-08 07:48:15,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (513 of 522 remaining) [2025-02-08 07:48:15,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (512 of 522 remaining) [2025-02-08 07:48:15,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (511 of 522 remaining) [2025-02-08 07:48:15,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (510 of 522 remaining) [2025-02-08 07:48:15,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (509 of 522 remaining) [2025-02-08 07:48:15,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (508 of 522 remaining) [2025-02-08 07:48:15,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (507 of 522 remaining) [2025-02-08 07:48:15,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (506 of 522 remaining) [2025-02-08 07:48:15,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (505 of 522 remaining) [2025-02-08 07:48:15,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (504 of 522 remaining) [2025-02-08 07:48:15,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (503 of 522 remaining) [2025-02-08 07:48:15,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (502 of 522 remaining) [2025-02-08 07:48:15,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (501 of 522 remaining) [2025-02-08 07:48:15,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (500 of 522 remaining) [2025-02-08 07:48:15,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (499 of 522 remaining) [2025-02-08 07:48:15,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (498 of 522 remaining) [2025-02-08 07:48:15,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (497 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (496 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (495 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (494 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (493 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (492 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (491 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (490 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (489 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (488 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (487 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (486 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (485 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (484 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (483 of 522 remaining) [2025-02-08 07:48:15,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (482 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (481 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (480 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (479 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (478 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (477 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (476 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (475 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (474 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (473 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (472 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (471 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (470 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (469 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (468 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (467 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (466 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (465 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (464 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (463 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (462 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (461 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (460 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (459 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (458 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (457 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (456 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (455 of 522 remaining) [2025-02-08 07:48:15,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (454 of 522 remaining) [2025-02-08 07:48:15,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (453 of 522 remaining) [2025-02-08 07:48:15,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (452 of 522 remaining) [2025-02-08 07:48:15,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (451 of 522 remaining) [2025-02-08 07:48:15,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (450 of 522 remaining) [2025-02-08 07:48:15,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (449 of 522 remaining) [2025-02-08 07:48:15,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (448 of 522 remaining) [2025-02-08 07:48:15,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (447 of 522 remaining) [2025-02-08 07:48:15,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (446 of 522 remaining) [2025-02-08 07:48:15,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (445 of 522 remaining) [2025-02-08 07:48:15,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (444 of 522 remaining) [2025-02-08 07:48:15,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (443 of 522 remaining) [2025-02-08 07:48:15,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (442 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (441 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (440 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (439 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (438 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (437 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (436 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (435 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (434 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (433 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (432 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (431 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (430 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (429 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (428 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (427 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (426 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (425 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (424 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (423 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (422 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (421 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (420 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (419 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (418 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE (417 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE (416 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE (415 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE (414 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE (413 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE (412 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE (411 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE (410 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE (409 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE (408 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE (407 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE (406 of 522 remaining) [2025-02-08 07:48:15,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE (405 of 522 remaining) [2025-02-08 07:48:15,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE (404 of 522 remaining) [2025-02-08 07:48:15,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE (403 of 522 remaining) [2025-02-08 07:48:15,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE (402 of 522 remaining) [2025-02-08 07:48:15,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE (401 of 522 remaining) [2025-02-08 07:48:15,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE (400 of 522 remaining) [2025-02-08 07:48:15,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE (399 of 522 remaining) [2025-02-08 07:48:15,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE (398 of 522 remaining) [2025-02-08 07:48:15,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONMEMORY_DEREFERENCE (397 of 522 remaining) [2025-02-08 07:48:15,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONMEMORY_DEREFERENCE (396 of 522 remaining) [2025-02-08 07:48:15,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONMEMORY_DEREFERENCE (395 of 522 remaining) [2025-02-08 07:48:15,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONMEMORY_DEREFERENCE (394 of 522 remaining) [2025-02-08 07:48:15,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE (393 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE (392 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE (391 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121REQUIRES_VIOLATIONMEMORY_DEREFERENCE (390 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122REQUIRES_VIOLATIONMEMORY_DEREFERENCE (389 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE (388 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124REQUIRES_VIOLATIONMEMORY_DEREFERENCE (387 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125REQUIRES_VIOLATIONMEMORY_DEREFERENCE (386 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126REQUIRES_VIOLATIONMEMORY_DEREFERENCE (385 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127REQUIRES_VIOLATIONMEMORY_DEREFERENCE (384 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128REQUIRES_VIOLATIONMEMORY_DEREFERENCE (383 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129REQUIRES_VIOLATIONMEMORY_DEREFERENCE (382 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130REQUIRES_VIOLATIONMEMORY_DEREFERENCE (381 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131REQUIRES_VIOLATIONMEMORY_DEREFERENCE (380 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE (379 of 522 remaining) [2025-02-08 07:48:15,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE (378 of 522 remaining) [2025-02-08 07:48:15,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134REQUIRES_VIOLATIONMEMORY_DEREFERENCE (377 of 522 remaining) [2025-02-08 07:48:15,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE (376 of 522 remaining) [2025-02-08 07:48:15,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE (375 of 522 remaining) [2025-02-08 07:48:15,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE (374 of 522 remaining) [2025-02-08 07:48:15,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE (373 of 522 remaining) [2025-02-08 07:48:15,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE (372 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE (371 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141REQUIRES_VIOLATIONMEMORY_DEREFERENCE (370 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE (369 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE (368 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE (367 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE (366 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE (365 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE (364 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE (363 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE (362 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr150REQUIRES_VIOLATIONMEMORY_DEREFERENCE (361 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE (360 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE (359 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE (358 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr154REQUIRES_VIOLATIONMEMORY_DEREFERENCE (357 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE (356 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE (355 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE (354 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE (353 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr159REQUIRES_VIOLATIONMEMORY_DEREFERENCE (352 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr160REQUIRES_VIOLATIONMEMORY_DEREFERENCE (351 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE (350 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE (349 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE (348 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE (347 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr165REQUIRES_VIOLATIONMEMORY_DEREFERENCE (346 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr166REQUIRES_VIOLATIONMEMORY_DEREFERENCE (345 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr167REQUIRES_VIOLATIONMEMORY_DEREFERENCE (344 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr168REQUIRES_VIOLATIONMEMORY_DEREFERENCE (343 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr169REQUIRES_VIOLATIONMEMORY_DEREFERENCE (342 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr170REQUIRES_VIOLATIONMEMORY_DEREFERENCE (341 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr171REQUIRES_VIOLATIONMEMORY_DEREFERENCE (340 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr172REQUIRES_VIOLATIONMEMORY_DEREFERENCE (339 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr173REQUIRES_VIOLATIONMEMORY_DEREFERENCE (338 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr174REQUIRES_VIOLATIONMEMORY_DEREFERENCE (337 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr175REQUIRES_VIOLATIONMEMORY_DEREFERENCE (336 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr176REQUIRES_VIOLATIONMEMORY_DEREFERENCE (335 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr177REQUIRES_VIOLATIONMEMORY_DEREFERENCE (334 of 522 remaining) [2025-02-08 07:48:15,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr178REQUIRES_VIOLATIONMEMORY_DEREFERENCE (333 of 522 remaining) [2025-02-08 07:48:15,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr179REQUIRES_VIOLATIONMEMORY_DEREFERENCE (332 of 522 remaining) [2025-02-08 07:48:15,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr180REQUIRES_VIOLATIONMEMORY_DEREFERENCE (331 of 522 remaining) [2025-02-08 07:48:15,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr181REQUIRES_VIOLATIONMEMORY_DEREFERENCE (330 of 522 remaining) [2025-02-08 07:48:15,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr182REQUIRES_VIOLATIONMEMORY_DEREFERENCE (329 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr183REQUIRES_VIOLATIONMEMORY_DEREFERENCE (328 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr184REQUIRES_VIOLATIONMEMORY_DEREFERENCE (327 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr185REQUIRES_VIOLATIONMEMORY_DEREFERENCE (326 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr186REQUIRES_VIOLATIONMEMORY_DEREFERENCE (325 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr187REQUIRES_VIOLATIONMEMORY_DEREFERENCE (324 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr188REQUIRES_VIOLATIONMEMORY_DEREFERENCE (323 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr189REQUIRES_VIOLATIONMEMORY_DEREFERENCE (322 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr190REQUIRES_VIOLATIONMEMORY_DEREFERENCE (321 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr191REQUIRES_VIOLATIONMEMORY_DEREFERENCE (320 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr192REQUIRES_VIOLATIONMEMORY_DEREFERENCE (319 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr193REQUIRES_VIOLATIONMEMORY_DEREFERENCE (318 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr194REQUIRES_VIOLATIONMEMORY_DEREFERENCE (317 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr195REQUIRES_VIOLATIONMEMORY_DEREFERENCE (316 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr196REQUIRES_VIOLATIONMEMORY_DEREFERENCE (315 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr197REQUIRES_VIOLATIONMEMORY_DEREFERENCE (314 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr198REQUIRES_VIOLATIONMEMORY_DEREFERENCE (313 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr199REQUIRES_VIOLATIONMEMORY_DEREFERENCE (312 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr200REQUIRES_VIOLATIONMEMORY_DEREFERENCE (311 of 522 remaining) [2025-02-08 07:48:15,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr201REQUIRES_VIOLATIONMEMORY_DEREFERENCE (310 of 522 remaining) [2025-02-08 07:48:15,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr202REQUIRES_VIOLATIONMEMORY_DEREFERENCE (309 of 522 remaining) [2025-02-08 07:48:15,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr203REQUIRES_VIOLATIONMEMORY_DEREFERENCE (308 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr204REQUIRES_VIOLATIONMEMORY_DEREFERENCE (307 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE (306 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr206REQUIRES_VIOLATIONMEMORY_DEREFERENCE (305 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr207REQUIRES_VIOLATIONMEMORY_DEREFERENCE (304 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr208REQUIRES_VIOLATIONMEMORY_DEREFERENCE (303 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE (302 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr210REQUIRES_VIOLATIONMEMORY_DEREFERENCE (301 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr211REQUIRES_VIOLATIONMEMORY_DEREFERENCE (300 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr212REQUIRES_VIOLATIONMEMORY_DEREFERENCE (299 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE (298 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr214REQUIRES_VIOLATIONMEMORY_DEREFERENCE (297 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr215REQUIRES_VIOLATIONMEMORY_DEREFERENCE (296 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr216REQUIRES_VIOLATIONMEMORY_DEREFERENCE (295 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE (294 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr218REQUIRES_VIOLATIONMEMORY_DEREFERENCE (293 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr219REQUIRES_VIOLATIONMEMORY_DEREFERENCE (292 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr220REQUIRES_VIOLATIONMEMORY_DEREFERENCE (291 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE (290 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr222REQUIRES_VIOLATIONMEMORY_DEREFERENCE (289 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr223REQUIRES_VIOLATIONMEMORY_DEREFERENCE (288 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr224REQUIRES_VIOLATIONMEMORY_DEREFERENCE (287 of 522 remaining) [2025-02-08 07:48:15,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr225REQUIRES_VIOLATIONMEMORY_DEREFERENCE (286 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr226REQUIRES_VIOLATIONMEMORY_DEREFERENCE (285 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr227REQUIRES_VIOLATIONMEMORY_DEREFERENCE (284 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr228REQUIRES_VIOLATIONMEMORY_DEREFERENCE (283 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr229REQUIRES_VIOLATIONMEMORY_DEREFERENCE (282 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr230REQUIRES_VIOLATIONMEMORY_DEREFERENCE (281 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr231REQUIRES_VIOLATIONMEMORY_DEREFERENCE (280 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr232REQUIRES_VIOLATIONMEMORY_DEREFERENCE (279 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr233REQUIRES_VIOLATIONMEMORY_DEREFERENCE (278 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr234REQUIRES_VIOLATIONMEMORY_DEREFERENCE (277 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr235REQUIRES_VIOLATIONMEMORY_DEREFERENCE (276 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr236REQUIRES_VIOLATIONMEMORY_DEREFERENCE (275 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr237REQUIRES_VIOLATIONMEMORY_DEREFERENCE (274 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr238REQUIRES_VIOLATIONMEMORY_DEREFERENCE (273 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr239REQUIRES_VIOLATIONMEMORY_DEREFERENCE (272 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr240REQUIRES_VIOLATIONMEMORY_DEREFERENCE (271 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr241REQUIRES_VIOLATIONMEMORY_DEREFERENCE (270 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr242REQUIRES_VIOLATIONMEMORY_DEREFERENCE (269 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr243REQUIRES_VIOLATIONMEMORY_DEREFERENCE (268 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr244REQUIRES_VIOLATIONMEMORY_DEREFERENCE (267 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr245REQUIRES_VIOLATIONMEMORY_DEREFERENCE (266 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr246REQUIRES_VIOLATIONMEMORY_DEREFERENCE (265 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr247REQUIRES_VIOLATIONMEMORY_DEREFERENCE (264 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr248REQUIRES_VIOLATIONMEMORY_DEREFERENCE (263 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr249REQUIRES_VIOLATIONMEMORY_DEREFERENCE (262 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr250REQUIRES_VIOLATIONMEMORY_DEREFERENCE (261 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr251REQUIRES_VIOLATIONMEMORY_DEREFERENCE (260 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr252REQUIRES_VIOLATIONMEMORY_DEREFERENCE (259 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr253REQUIRES_VIOLATIONMEMORY_DEREFERENCE (258 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr254REQUIRES_VIOLATIONMEMORY_DEREFERENCE (257 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr255REQUIRES_VIOLATIONMEMORY_DEREFERENCE (256 of 522 remaining) [2025-02-08 07:48:15,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr256REQUIRES_VIOLATIONMEMORY_DEREFERENCE (255 of 522 remaining) [2025-02-08 07:48:15,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr257REQUIRES_VIOLATIONMEMORY_DEREFERENCE (254 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr258REQUIRES_VIOLATIONMEMORY_DEREFERENCE (253 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr259REQUIRES_VIOLATIONMEMORY_DEREFERENCE (252 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr260REQUIRES_VIOLATIONMEMORY_DEREFERENCE (251 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr261REQUIRES_VIOLATIONMEMORY_DEREFERENCE (250 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr262REQUIRES_VIOLATIONMEMORY_DEREFERENCE (249 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr263REQUIRES_VIOLATIONMEMORY_DEREFERENCE (248 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr264REQUIRES_VIOLATIONMEMORY_DEREFERENCE (247 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr265REQUIRES_VIOLATIONMEMORY_DEREFERENCE (246 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr266REQUIRES_VIOLATIONMEMORY_DEREFERENCE (245 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr267REQUIRES_VIOLATIONMEMORY_DEREFERENCE (244 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr268REQUIRES_VIOLATIONMEMORY_DEREFERENCE (243 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr269REQUIRES_VIOLATIONMEMORY_DEREFERENCE (242 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr270REQUIRES_VIOLATIONMEMORY_DEREFERENCE (241 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr271REQUIRES_VIOLATIONMEMORY_DEREFERENCE (240 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr272REQUIRES_VIOLATIONMEMORY_DEREFERENCE (239 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr273REQUIRES_VIOLATIONMEMORY_DEREFERENCE (238 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr274REQUIRES_VIOLATIONMEMORY_DEREFERENCE (237 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr275REQUIRES_VIOLATIONMEMORY_DEREFERENCE (236 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr276REQUIRES_VIOLATIONMEMORY_DEREFERENCE (235 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr277REQUIRES_VIOLATIONMEMORY_DEREFERENCE (234 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr278REQUIRES_VIOLATIONMEMORY_DEREFERENCE (233 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr279REQUIRES_VIOLATIONMEMORY_DEREFERENCE (232 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr280REQUIRES_VIOLATIONMEMORY_DEREFERENCE (231 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr281REQUIRES_VIOLATIONMEMORY_DEREFERENCE (230 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr282REQUIRES_VIOLATIONMEMORY_DEREFERENCE (229 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr283REQUIRES_VIOLATIONMEMORY_DEREFERENCE (228 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr284REQUIRES_VIOLATIONMEMORY_DEREFERENCE (227 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr285REQUIRES_VIOLATIONMEMORY_DEREFERENCE (226 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr286REQUIRES_VIOLATIONMEMORY_DEREFERENCE (225 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr287REQUIRES_VIOLATIONMEMORY_DEREFERENCE (224 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr288REQUIRES_VIOLATIONMEMORY_DEREFERENCE (223 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr289REQUIRES_VIOLATIONMEMORY_DEREFERENCE (222 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr290REQUIRES_VIOLATIONMEMORY_DEREFERENCE (221 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr291REQUIRES_VIOLATIONMEMORY_DEREFERENCE (220 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr292REQUIRES_VIOLATIONMEMORY_DEREFERENCE (219 of 522 remaining) [2025-02-08 07:48:15,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr293REQUIRES_VIOLATIONMEMORY_DEREFERENCE (218 of 522 remaining) [2025-02-08 07:48:15,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr294REQUIRES_VIOLATIONMEMORY_DEREFERENCE (217 of 522 remaining) [2025-02-08 07:48:15,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr295REQUIRES_VIOLATIONMEMORY_DEREFERENCE (216 of 522 remaining) [2025-02-08 07:48:15,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE (215 of 522 remaining) [2025-02-08 07:48:15,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE (214 of 522 remaining) [2025-02-08 07:48:15,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr298REQUIRES_VIOLATIONMEMORY_DEREFERENCE (213 of 522 remaining) [2025-02-08 07:48:15,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr299REQUIRES_VIOLATIONMEMORY_DEREFERENCE (212 of 522 remaining) [2025-02-08 07:48:15,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE (211 of 522 remaining) [2025-02-08 07:48:15,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE (210 of 522 remaining) [2025-02-08 07:48:15,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr302REQUIRES_VIOLATIONMEMORY_DEREFERENCE (209 of 522 remaining) [2025-02-08 07:48:15,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE (208 of 522 remaining) [2025-02-08 07:48:15,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE (207 of 522 remaining) [2025-02-08 07:48:15,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE (206 of 522 remaining) [2025-02-08 07:48:15,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr306REQUIRES_VIOLATIONMEMORY_DEREFERENCE (205 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE (204 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE (203 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE (202 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr310REQUIRES_VIOLATIONMEMORY_DEREFERENCE (201 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE (200 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE (199 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE (198 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE (197 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE (196 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE (195 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE (194 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE (193 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE (192 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE (191 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr321REQUIRES_VIOLATIONMEMORY_DEREFERENCE (190 of 522 remaining) [2025-02-08 07:48:15,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE (189 of 522 remaining) [2025-02-08 07:48:15,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr323REQUIRES_VIOLATIONMEMORY_DEREFERENCE (188 of 522 remaining) [2025-02-08 07:48:15,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE (187 of 522 remaining) [2025-02-08 07:48:15,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr325REQUIRES_VIOLATIONMEMORY_DEREFERENCE (186 of 522 remaining) [2025-02-08 07:48:15,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr326REQUIRES_VIOLATIONMEMORY_DEREFERENCE (185 of 522 remaining) [2025-02-08 07:48:15,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr327REQUIRES_VIOLATIONMEMORY_DEREFERENCE (184 of 522 remaining) [2025-02-08 07:48:15,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr328REQUIRES_VIOLATIONMEMORY_DEREFERENCE (183 of 522 remaining) [2025-02-08 07:48:15,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr329REQUIRES_VIOLATIONMEMORY_DEREFERENCE (182 of 522 remaining) [2025-02-08 07:48:15,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE (181 of 522 remaining) [2025-02-08 07:48:15,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE (180 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr332REQUIRES_VIOLATIONMEMORY_DEREFERENCE (179 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr333REQUIRES_VIOLATIONMEMORY_DEREFERENCE (178 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE (177 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr335REQUIRES_VIOLATIONMEMORY_DEREFERENCE (176 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr336REQUIRES_VIOLATIONMEMORY_DEREFERENCE (175 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr337REQUIRES_VIOLATIONMEMORY_DEREFERENCE (174 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr338REQUIRES_VIOLATIONMEMORY_DEREFERENCE (173 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr339REQUIRES_VIOLATIONMEMORY_DEREFERENCE (172 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE (171 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE (170 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr342REQUIRES_VIOLATIONMEMORY_DEREFERENCE (169 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr343REQUIRES_VIOLATIONMEMORY_DEREFERENCE (168 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr344REQUIRES_VIOLATIONMEMORY_DEREFERENCE (167 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr345REQUIRES_VIOLATIONMEMORY_DEREFERENCE (166 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr346REQUIRES_VIOLATIONMEMORY_DEREFERENCE (165 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr347REQUIRES_VIOLATIONMEMORY_DEREFERENCE (164 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE (163 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr349REQUIRES_VIOLATIONMEMORY_DEREFERENCE (162 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr350REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr351REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr352REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr353REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr356REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr357REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr358REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr359REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr360REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr361REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 522 remaining) [2025-02-08 07:48:15,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr365REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 522 remaining) [2025-02-08 07:48:15,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr366REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 522 remaining) [2025-02-08 07:48:15,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr367REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 522 remaining) [2025-02-08 07:48:15,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 522 remaining) [2025-02-08 07:48:15,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 522 remaining) [2025-02-08 07:48:15,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 522 remaining) [2025-02-08 07:48:15,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr371REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 522 remaining) [2025-02-08 07:48:15,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 522 remaining) [2025-02-08 07:48:15,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 522 remaining) [2025-02-08 07:48:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr374REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 522 remaining) [2025-02-08 07:48:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr375REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 522 remaining) [2025-02-08 07:48:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 522 remaining) [2025-02-08 07:48:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr377REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 522 remaining) [2025-02-08 07:48:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr378REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 522 remaining) [2025-02-08 07:48:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr379REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 522 remaining) [2025-02-08 07:48:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr380REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 522 remaining) [2025-02-08 07:48:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 522 remaining) [2025-02-08 07:48:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr382REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 522 remaining) [2025-02-08 07:48:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr383REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 522 remaining) [2025-02-08 07:48:15,976 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr385REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr386REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr387REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr388REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr389REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr390REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr391REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr392REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr393REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr394REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr395REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr398REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr399REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 522 remaining) [2025-02-08 07:48:15,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr401REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr402REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr403REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr404REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr405REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr406REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr409REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr410REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr411REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr412REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr413REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr417REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr420REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr423REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr424REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr425REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr426REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 522 remaining) [2025-02-08 07:48:15,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr428REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr429REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr430REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr431REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr432REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr433REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr434REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr435REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr436REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr438REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr439REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr440REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr441REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr442REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr443REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr444REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 522 remaining) [2025-02-08 07:48:15,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr445REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr446REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr447REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr448REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr449REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr450REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr451REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr452REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr453REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr454REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr455REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr456REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr457REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr458REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr459REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr460REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr461REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr462REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr463REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr464REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr465REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr466REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr467REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr468REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr469REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr470REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr471REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr472REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr473REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr474REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr475REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr476REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr477REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr478REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr479REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr480REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr481REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr482REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr483REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr484REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr485REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 522 remaining) [2025-02-08 07:48:15,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr486REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 522 remaining) [2025-02-08 07:48:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr487REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 522 remaining) [2025-02-08 07:48:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr488REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 522 remaining) [2025-02-08 07:48:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr489REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 522 remaining) [2025-02-08 07:48:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr490REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 522 remaining) [2025-02-08 07:48:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr491REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 522 remaining) [2025-02-08 07:48:15,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr492REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 522 remaining) [2025-02-08 07:48:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr493REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 522 remaining) [2025-02-08 07:48:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr494REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 522 remaining) [2025-02-08 07:48:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr495REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 522 remaining) [2025-02-08 07:48:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr496REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 522 remaining) [2025-02-08 07:48:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr497REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 522 remaining) [2025-02-08 07:48:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr498REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 522 remaining) [2025-02-08 07:48:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr499REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 522 remaining) [2025-02-08 07:48:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr500REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 522 remaining) [2025-02-08 07:48:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr501REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 522 remaining) [2025-02-08 07:48:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr502REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 522 remaining) [2025-02-08 07:48:15,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr503REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 522 remaining) [2025-02-08 07:48:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr504REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 522 remaining) [2025-02-08 07:48:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr505REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 522 remaining) [2025-02-08 07:48:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr506REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 522 remaining) [2025-02-08 07:48:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr507REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 522 remaining) [2025-02-08 07:48:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr508REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 522 remaining) [2025-02-08 07:48:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 522 remaining) [2025-02-08 07:48:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr510REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 522 remaining) [2025-02-08 07:48:15,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr511REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 522 remaining) [2025-02-08 07:48:15,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 07:48:16,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:48:16,189 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:48:16,194 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 07:48:16,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 07:48:16 BoogieIcfgContainer [2025-02-08 07:48:16,202 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 07:48:16,202 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 07:48:16,203 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 07:48:16,204 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 07:48:16,204 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:48:10" (3/4) ... [2025-02-08 07:48:16,206 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 07:48:16,210 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reach_error [2025-02-08 07:48:16,210 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure alt_malloc [2025-02-08 07:48:16,210 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 07:48:16,210 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure alt_free [2025-02-08 07:48:16,210 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure alt_bzero [2025-02-08 07:48:16,219 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-02-08 07:48:16,220 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 07:48:16,220 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 07:48:16,221 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 07:48:16,298 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 07:48:16,299 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 07:48:16,299 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 07:48:16,299 INFO L158 Benchmark]: Toolchain (without parser) took 9212.39ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 89.5MB in the beginning and 123.1MB in the end (delta: -33.6MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2025-02-08 07:48:16,300 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 61.3MB in the beginning and 61.3MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 07:48:16,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 708.57ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 84.6MB in the end (delta: 4.9MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2025-02-08 07:48:16,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.92ms. Allocated memory is still 117.4MB. Free memory was 84.6MB in the beginning and 77.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 07:48:16,300 INFO L158 Benchmark]: Boogie Preprocessor took 149.44ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 59.4MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 07:48:16,300 INFO L158 Benchmark]: IcfgBuilder took 2876.97ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 59.4MB in the beginning and 68.9MB in the end (delta: -9.5MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2025-02-08 07:48:16,300 INFO L158 Benchmark]: TraceAbstraction took 5288.43ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 68.9MB in the beginning and 135.2MB in the end (delta: -66.3MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2025-02-08 07:48:16,301 INFO L158 Benchmark]: Witness Printer took 96.49ms. Allocated memory is still 184.5MB. Free memory was 135.2MB in the beginning and 123.1MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 07:48:16,302 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.20ms. Allocated memory is still 83.9MB. Free memory was 61.3MB in the beginning and 61.3MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 708.57ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 84.6MB in the end (delta: 4.9MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.92ms. Allocated memory is still 117.4MB. Free memory was 84.6MB in the beginning and 77.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 149.44ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 59.4MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 2876.97ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 59.4MB in the beginning and 68.9MB in the end (delta: -9.5MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5288.43ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 68.9MB in the beginning and 135.2MB in the end (delta: -66.3MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. * Witness Printer took 96.49ms. Allocated memory is still 184.5MB. Free memory was 135.2MB in the beginning and 123.1MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. 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: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 963]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 963]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 963]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 985]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 983]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 983]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 983]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 969]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 969]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 969]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 969]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 477 locations, 522 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2068 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2051 mSDsluCounter, 4158 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2161 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1325 IncrementalHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 1997 mSDtfsCounter, 1325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=3, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 182 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 418 SizeOfPredicates, 7 NumberOfNonLiveVariables, 830 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 522 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 07:48:16,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE