./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:03:33,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:03:33,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-04 07:03:33,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:03:33,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:03:33,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:03:33,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:03:33,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:03:33,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:03:33,232 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:03:33,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:03:33,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:03:33,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:03:33,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:03:33,233 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:03:33,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:03:33,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:03:33,233 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:03:33,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:03:33,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:03:33,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:03:33,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:03:33,233 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:03:33,233 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:03:33,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:03:33,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:03:33,234 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:03:33,234 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:03:33,234 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:03:33,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:03:33,234 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:03:33,234 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:03:33,234 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:03:33,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:03:33,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:03:33,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:03:33,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:03:33,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:03:33,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:03:33,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:03:33,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:03:33,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:03:33,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:03:33,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:03:33,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:03:33,235 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2025-03-04 07:03:33,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:03:33,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:03:33,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:03:33,469 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:03:33,470 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:03:33,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2025-03-04 07:03:34,606 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22f2c697/f37b3419d50a4d1197c6b69ccc75463d/FLAG97b10ae92 [2025-03-04 07:03:34,903 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:03:34,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2025-03-04 07:03:34,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22f2c697/f37b3419d50a4d1197c6b69ccc75463d/FLAG97b10ae92 [2025-03-04 07:03:34,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22f2c697/f37b3419d50a4d1197c6b69ccc75463d [2025-03-04 07:03:34,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:03:34,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:03:34,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:03:34,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:03:34,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:03:34,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:03:34" (1/1) ... [2025-03-04 07:03:34,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7973a023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:34, skipping insertion in model container [2025-03-04 07:03:34,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:03:34" (1/1) ... [2025-03-04 07:03:34,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:03:35,192 WARN L617 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2025-03-04 07:03:35,193 WARN L617 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2025-03-04 07:03:35,194 WARN L617 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2025-03-04 07:03:35,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:03:35,225 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-03-04 07:03:35,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7e42e0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:35, skipping insertion in model container [2025-03-04 07:03:35,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:03:35,226 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-04 07:03:35,228 INFO L158 Benchmark]: Toolchain (without parser) took 287.41ms. Allocated memory is still 201.3MB. Free memory was 158.4MB in the beginning and 143.9MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:03:35,228 INFO L158 Benchmark]: CDTParser took 3.47ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:03:35,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.90ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 143.9MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:03:35,229 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.47ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.90ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 143.9MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:03:36,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:03:36,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-03-04 07:03:36,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:03:36,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:03:36,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:03:36,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:03:36,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:03:36,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:03:36,975 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:03:36,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:03:36,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:03:36,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:03:36,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:03:36,976 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:03:36,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:03:36,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:03:36,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:03:36,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:03:36,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:03:36,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:03:36,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:03:36,976 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:03:36,976 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:03:36,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:03:36,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:03:36,980 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:03:36,980 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:03:36,980 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:03:36,980 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:03:36,981 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:03:36,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:03:36,981 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:03:36,981 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:03:36,981 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:03:36,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:03:36,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:03:36,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:03:36,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:03:36,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:03:36,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:03:36,982 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:03:36,982 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:03:36,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:03:36,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:03:36,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:03:36,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:03:36,983 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2025-03-04 07:03:37,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:03:37,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:03:37,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:03:37,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:03:37,250 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:03:37,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2025-03-04 07:03:38,462 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe271a51/2ced34fbba2d47f7bb18838afcd1d824/FLAG6f8a5b736 [2025-03-04 07:03:38,747 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:03:38,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2025-03-04 07:03:38,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe271a51/2ced34fbba2d47f7bb18838afcd1d824/FLAG6f8a5b736 [2025-03-04 07:03:39,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe271a51/2ced34fbba2d47f7bb18838afcd1d824 [2025-03-04 07:03:39,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:03:39,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:03:39,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:03:39,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:03:39,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:03:39,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa36660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39, skipping insertion in model container [2025-03-04 07:03:39,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:03:39,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:03:39,304 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-04 07:03:39,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:03:39,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:03:39,359 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:03:39,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:03:39,445 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:03:39,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39 WrapperNode [2025-03-04 07:03:39,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:03:39,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:03:39,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:03:39,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:03:39,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,482 INFO L138 Inliner]: procedures = 235, calls = 76, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 116 [2025-03-04 07:03:39,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:03:39,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:03:39,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:03:39,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:03:39,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,536 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2025-03-04 07:03:39,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,546 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:03:39,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:03:39,555 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:03:39,555 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:03:39,555 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39" (1/1) ... [2025-03-04 07:03:39,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:03:39,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:03:39,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:03:39,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:03:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 07:03:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 07:03:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:03:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:03:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2025-03-04 07:03:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2025-03-04 07:03:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:03:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 07:03:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 07:03:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:03:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:03:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:03:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:03:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2025-03-04 07:03:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2025-03-04 07:03:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-03-04 07:03:39,602 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-03-04 07:03:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:03:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:03:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:03:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:03:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-03-04 07:03:39,603 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-03-04 07:03:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:03:39,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:03:39,713 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:03:39,715 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:03:39,737 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc #t~mem54; [2025-03-04 07:03:40,145 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2025-03-04 07:03:40,145 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:03:40,153 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:03:40,154 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:03:40,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:03:40 BoogieIcfgContainer [2025-03-04 07:03:40,155 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:03:40,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:03:40,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:03:40,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:03:40,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:03:39" (1/3) ... [2025-03-04 07:03:40,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37913917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:03:40, skipping insertion in model container [2025-03-04 07:03:40,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:03:39" (2/3) ... [2025-03-04 07:03:40,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37913917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:03:40, skipping insertion in model container [2025-03-04 07:03:40,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:03:40" (3/3) ... [2025-03-04 07:03:40,165 INFO L128 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2025-03-04 07:03:40,175 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:03:40,177 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubble_sort_linux-2.i that has 5 procedures, 120 locations, 1 initial locations, 23 loop locations, and 2 error locations. [2025-03-04 07:03:40,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:03:40,219 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;@18c33f43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:03:40,219 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 07:03:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 90 states have (on average 1.7444444444444445) internal successors, (157), 110 states have internal predecessors, (157), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 07:03:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:03:40,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:03:40,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:03:40,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:03:40,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:03:40,234 INFO L85 PathProgramCache]: Analyzing trace with hash 441400570, now seen corresponding path program 1 times [2025-03-04 07:03:40,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:03:40,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616595244] [2025-03-04 07:03:40,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:03:40,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:03:40,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:03:40,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:03:40,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:03:40,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:03:40,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:03:40,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:03:40,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:03:40,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 07:03:40,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:03:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:03:40,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:03:40,333 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:03:40,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616595244] [2025-03-04 07:03:40,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616595244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:03:40,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:03:40,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:03:40,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927368103] [2025-03-04 07:03:40,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:03:40,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:03:40,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:03:40,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:03:40,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:03:40,357 INFO L87 Difference]: Start difference. First operand has 120 states, 90 states have (on average 1.7444444444444445) internal successors, (157), 110 states have internal predecessors, (157), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-03-04 07:03:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:03:40,370 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2025-03-04 07:03:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:03:40,371 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 11 [2025-03-04 07:03:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:03:40,377 INFO L225 Difference]: With dead ends: 115 [2025-03-04 07:03:40,377 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 07:03:40,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:03:40,380 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:03:40,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:03:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 07:03:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-04 07:03:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 102 states have internal predecessors, (108), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:03:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2025-03-04 07:03:40,411 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 11 [2025-03-04 07:03:40,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:03:40,411 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2025-03-04 07:03:40,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-03-04 07:03:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2025-03-04 07:03:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:03:40,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:03:40,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:03:40,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:03:40,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:03:40,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:03:40,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:03:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1896228344, now seen corresponding path program 1 times [2025-03-04 07:03:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:03:40,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [38607853] [2025-03-04 07:03:40,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:03:40,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:03:40,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:03:40,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:03:40,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:03:40,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:03:40,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:03:40,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:03:40,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:03:40,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:03:40,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:03:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:03:40,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:03:40,822 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:03:40,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38607853] [2025-03-04 07:03:40,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38607853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:03:40,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:03:40,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:03:40,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656840705] [2025-03-04 07:03:40,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:03:40,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:03:40,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:03:40,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:03:40,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:03:40,826 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:03:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:03:40,966 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2025-03-04 07:03:40,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:03:40,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 07:03:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:03:40,967 INFO L225 Difference]: With dead ends: 112 [2025-03-04 07:03:40,967 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 07:03:40,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:03:40,968 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 177 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:03:40,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 260 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:03:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 07:03:40,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-04 07:03:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 101 states have internal predecessors, (107), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:03:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2025-03-04 07:03:40,975 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 22 [2025-03-04 07:03:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:03:40,976 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2025-03-04 07:03:40,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:03:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2025-03-04 07:03:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:03:40,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:03:40,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:03:40,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:03:41,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:03:41,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:03:41,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:03:41,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1508643499, now seen corresponding path program 1 times [2025-03-04 07:03:41,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:03:41,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257593853] [2025-03-04 07:03:41,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:03:41,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:03:41,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:03:41,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:03:41,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:03:41,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:03:41,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:03:41,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:03:41,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:03:41,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:03:41,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:03:41,330 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:03:41,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:03:41,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2025-03-04 07:03:41,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2025-03-04 07:03:41,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2025-03-04 07:03:41,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 45 [2025-03-04 07:03:41,512 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2025-03-04 07:03:41,512 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 1 case distinctions, treesize of input 18 treesize of output 26 [2025-03-04 07:03:41,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2025-03-04 07:03:41,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2025-03-04 07:03:41,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2025-03-04 07:03:41,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2025-03-04 07:03:41,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2025-03-04 07:03:46,290 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2025-03-04 07:03:46,291 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 1 case distinctions, treesize of input 18 treesize of output 26 [2025-03-04 07:03:46,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2025-03-04 07:03:47,215 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2025-03-04 07:03:47,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 30 [2025-03-04 07:03:48,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:03:48,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 78 [2025-03-04 07:03:48,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2025-03-04 07:03:48,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:03:48,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 65 [2025-03-04 07:03:48,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2025-03-04 07:03:48,934 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2025-03-04 07:03:48,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 72 [2025-03-04 07:03:48,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2025-03-04 07:03:48,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-04 07:03:48,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-04 07:03:49,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-03-04 07:03:49,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:03:49,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:03:49,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:03:49,216 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:03:49,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257593853] [2025-03-04 07:03:49,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257593853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:03:49,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:03:49,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:03:49,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440539464] [2025-03-04 07:03:49,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:03:49,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:03:49,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:03:49,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:03:49,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=80, Unknown=4, NotChecked=0, Total=110 [2025-03-04 07:03:49,217 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:03:49,636 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= |c_list_add_#in~new#1.base| |c_list_add_#in~head#1.base|))) (let ((.cse2 (not .cse0)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_list_add_#in~head#1.base|))) (or (and .cse0 (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_7| (_ BitVec 32)) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~head#1.base| v_DerPreprocessor_10) |c_list_add_#in~new#1.base| v_DerPreprocessor_11) |c_list_add_#in~head#1.base|))) (and (= |c_list_add_#in~new#1.base| (select v_DerPreprocessor_11 |v_list_add___list_add_~new#1.offset_7|)) (= (select |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base|) (store .cse1 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)) (= .cse1 v_DerPreprocessor_10) (= |c_list_add_#in~new#1.base| (select v_DerPreprocessor_11 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|))) (= (select v_DerPreprocessor_11 (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|)) |c_list_add_#in~head#1.base|))))) (and .cse2 (exists ((|v_list_add___list_add_~next#1.base_7| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_7| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_8 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|)) |c_list_add_#in~new#1.base|) (= .cse3 (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~head#1.base| v_DerPreprocessor_8) |v_list_add___list_add_~next#1.base_7| v_arrayElimArr_8) |c_list_add_#in~new#1.base| (store (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_7) |c_list_add_#in~head#1.base| v_DerPreprocessor_8) |v_list_add___list_add_~next#1.base_7| v_arrayElimArr_8) |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_7| |v_list_add___list_add_~next#1.base_7|) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|) |c_list_add_#in~head#1.base|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)) (not (= |c_list_add_#in~new#1.base| |v_list_add___list_add_~next#1.base_7|)) (not (= |v_list_add___list_add_~next#1.base_7| |c_list_add_#in~head#1.base|))))) (and (exists ((v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_7| (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32))) (and (= .cse3 (store (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~head#1.base| v_arrayElimArr_2) |c_list_add_#in~new#1.base| (store (store (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~new#1.base| v_DerPreprocessor_1) |c_list_add_#in~head#1.base| v_arrayElimArr_2) |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_7| |c_list_add_#in~head#1.base|) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|) |c_list_add_#in~head#1.base|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)) (= |c_list_add_#in~new#1.base| (select v_arrayElimArr_2 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|))))) .cse2) (and .cse0 (exists ((|v_list_add___list_add_~next#1.base_7| (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_7| (_ BitVec 32)) (v_arrayElimArr_6 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32))) (and (not (= |c_list_add_#in~new#1.base| |v_list_add___list_add_~next#1.base_7|)) (= (store (select (let ((.cse4 (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~head#1.base| v_DerPreprocessor_5) |v_list_add___list_add_~next#1.base_7| v_arrayElimArr_6))) (store .cse4 |c_list_add_#in~new#1.base| (store (store (select .cse4 |c_list_add_#in~new#1.base|) |v_list_add___list_add_~new#1.offset_7| |v_list_add___list_add_~next#1.base_7|) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|) |c_list_add_#in~head#1.base|))) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|) .cse3) (= (select v_arrayElimArr_6 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|)) |c_list_add_#in~new#1.base|)))) (and .cse0 (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~next#1.offset_7| (_ BitVec 32)) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32)) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~head#1.base| v_DerPreprocessor_3) |c_list_add_#in~new#1.base| v_DerPreprocessor_4) |c_list_add_#in~head#1.base|))) (and (= (select .cse5 |v_list_add___list_add_~new#1.offset_7|) |c_list_add_#in~head#1.base|) (= |c_list_add_#in~new#1.base| (select .cse5 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|))) (= .cse3 (store .cse5 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)) (= v_DerPreprocessor_3 .cse5) (= (select .cse5 (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|)) |c_list_add_#in~head#1.base|))))) (and .cse2 (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_7| (_ BitVec 32))) (and (= (select v_DerPreprocessor_13 (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|)) |c_list_add_#in~head#1.base|) (= (store (select (store (store |c_#memory_$Pointer$#1.base| |c_list_add_#in~head#1.base| v_DerPreprocessor_12) |c_list_add_#in~new#1.base| v_DerPreprocessor_13) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|) .cse3) (= |c_list_add_#in~new#1.base| (select v_DerPreprocessor_13 |v_list_add___list_add_~new#1.offset_7|)))))))) (= (_ bv3 32) |c_~#gl_list~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (_ bv3 32))))) is different from true [2025-03-04 07:03:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:03:54,082 INFO L93 Difference]: Finished difference Result 213 states and 252 transitions. [2025-03-04 07:03:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:03:54,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 07:03:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:03:54,087 INFO L225 Difference]: With dead ends: 213 [2025-03-04 07:03:54,087 INFO L226 Difference]: Without dead ends: 213 [2025-03-04 07:03:54,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=83, Invalid=215, Unknown=12, NotChecked=32, Total=342 [2025-03-04 07:03:54,088 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 551 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 89 mSolverCounterUnsat, 140 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 140 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:03:54,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 508 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 401 Invalid, 140 Unknown, 8 Unchecked, 4.3s Time] [2025-03-04 07:03:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-04 07:03:54,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 180. [2025-03-04 07:03:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 165 states have internal predecessors, (187), 23 states have call successors, (23), 6 states have call predecessors, (23), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 07:03:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 219 transitions. [2025-03-04 07:03:54,097 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 219 transitions. Word has length 25 [2025-03-04 07:03:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:03:54,098 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 219 transitions. [2025-03-04 07:03:54,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:03:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 219 transitions. [2025-03-04 07:03:54,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:03:54,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:03:54,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:03:54,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:03:54,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:03:54,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:03:54,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:03:54,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2142399221, now seen corresponding path program 1 times [2025-03-04 07:03:54,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:03:54,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86987899] [2025-03-04 07:03:54,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:03:54,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:03:54,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:03:54,303 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:03:54,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:03:54,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:03:54,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:03:54,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:03:54,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:03:54,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 07:03:54,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:03:54,462 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:03:54,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:03:54,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:03:54,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:03:54,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2025-03-04 07:03:54,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:03:54,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 19 [2025-03-04 07:03:54,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-03-04 07:03:54,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:03:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:03:54,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:03:54,878 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:03:54,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86987899] [2025-03-04 07:03:54,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86987899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:03:54,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:03:54,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:03:54,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684917675] [2025-03-04 07:03:54,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:03:54,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:03:54,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:03:54,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:03:54,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=88, Unknown=2, NotChecked=0, Total=110 [2025-03-04 07:03:54,879 INFO L87 Difference]: Start difference. First operand 180 states and 219 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:03:58,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:04:02,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:04:07,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:04:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:10,034 INFO L93 Difference]: Finished difference Result 288 states and 345 transitions. [2025-03-04 07:04:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:04:10,035 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-04 07:04:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:10,036 INFO L225 Difference]: With dead ends: 288 [2025-03-04 07:04:10,036 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 07:04:10,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=209, Unknown=7, NotChecked=0, Total=272 [2025-03-04 07:04:10,037 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 230 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 34 mSolverCounterUnsat, 74 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 74 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:10,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 455 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 956 Invalid, 74 Unknown, 0 Unchecked, 14.8s Time] [2025-03-04 07:04:10,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 07:04:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2025-03-04 07:04:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 225 states have (on average 1.24) internal successors, (279), 241 states have internal predecessors, (279), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:04:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 321 transitions. [2025-03-04 07:04:10,052 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 321 transitions. Word has length 28 [2025-03-04 07:04:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:10,053 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 321 transitions. [2025-03-04 07:04:10,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:04:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 321 transitions. [2025-03-04 07:04:10,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:04:10,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:10,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:10,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:04:10,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:10,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:10,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash -11550703, now seen corresponding path program 1 times [2025-03-04 07:04:10,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:04:10,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548363425] [2025-03-04 07:04:10,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:10,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:10,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:10,257 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:10,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:04:10,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:04:10,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:04:10,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:10,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:10,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 07:04:10,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:10,419 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:04:10,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:04:10,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:04:10,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:04:10,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2025-03-04 07:04:10,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2025-03-04 07:04:10,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-04 07:04:10,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2025-03-04 07:04:10,941 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-03-04 07:04:10,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 78 [2025-03-04 07:04:10,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2025-03-04 07:04:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:04:11,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:04:11,300 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:04:11,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548363425] [2025-03-04 07:04:11,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548363425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:04:11,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:04:11,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:04:11,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116972215] [2025-03-04 07:04:11,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:04:11,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:04:11,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:04:11,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:04:11,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:04:11,302 INFO L87 Difference]: Start difference. First operand 263 states and 321 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:04:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:15,577 INFO L93 Difference]: Finished difference Result 287 states and 343 transitions. [2025-03-04 07:04:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:04:15,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-04 07:04:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:15,578 INFO L225 Difference]: With dead ends: 287 [2025-03-04 07:04:15,578 INFO L226 Difference]: Without dead ends: 287 [2025-03-04 07:04:15,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:04:15,579 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 268 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:15,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 480 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 903 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-04 07:04:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-04 07:04:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2025-03-04 07:04:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 225 states have (on average 1.2355555555555555) internal successors, (278), 241 states have internal predecessors, (278), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:04:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 320 transitions. [2025-03-04 07:04:15,595 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 320 transitions. Word has length 31 [2025-03-04 07:04:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:15,596 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 320 transitions. [2025-03-04 07:04:15,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:04:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 320 transitions. [2025-03-04 07:04:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:04:15,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:15,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:15,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:04:15,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:15,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:15,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:15,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1900442893, now seen corresponding path program 1 times [2025-03-04 07:04:15,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:04:15,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1814479926] [2025-03-04 07:04:15,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:15,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:15,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:15,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:15,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:04:15,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:04:15,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:04:15,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:15,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:15,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-04 07:04:15,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:15,946 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:04:15,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:04:15,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:04:16,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:04:19,364 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 07:04:19,565 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-03-04 07:04:19,766 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2025-03-04 07:04:21,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2025-03-04 07:04:21,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 65 [2025-03-04 07:04:21,265 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 31 treesize of output 26 [2025-03-04 07:04:21,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2025-03-04 07:04:21,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18 [2025-03-04 07:04:21,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2025-03-04 07:04:21,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2025-03-04 07:04:21,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:21,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:21,543 INFO L349 Elim1Store]: treesize reduction 138, result has 9.8 percent of original size [2025-03-04 07:04:21,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 97 treesize of output 76 [2025-03-04 07:04:21,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 60 [2025-03-04 07:04:22,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 48 [2025-03-04 07:04:22,798 INFO L349 Elim1Store]: treesize reduction 108, result has 2.7 percent of original size [2025-03-04 07:04:22,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 75 treesize of output 29 [2025-03-04 07:04:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:04:22,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:04:22,942 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:04:22,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814479926] [2025-03-04 07:04:22,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814479926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:04:22,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:04:22,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 07:04:22,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020251166] [2025-03-04 07:04:22,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:04:22,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:04:22,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:04:22,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:04:22,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=131, Unknown=1, NotChecked=0, Total=156 [2025-03-04 07:04:22,943 INFO L87 Difference]: Start difference. First operand 263 states and 320 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:04:31,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:31,820 INFO L93 Difference]: Finished difference Result 286 states and 341 transitions. [2025-03-04 07:04:31,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:04:31,821 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-04 07:04:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:31,822 INFO L225 Difference]: With dead ends: 286 [2025-03-04 07:04:31,822 INFO L226 Difference]: Without dead ends: 286 [2025-03-04 07:04:31,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=72, Invalid=347, Unknown=1, NotChecked=0, Total=420 [2025-03-04 07:04:31,823 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 265 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:31,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 536 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2025-03-04 07:04:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-04 07:04:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 263. [2025-03-04 07:04:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 225 states have (on average 1.231111111111111) internal successors, (277), 241 states have internal predecessors, (277), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:04:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 319 transitions. [2025-03-04 07:04:31,833 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 319 transitions. Word has length 34 [2025-03-04 07:04:31,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:31,836 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 319 transitions. [2025-03-04 07:04:31,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:04:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 319 transitions. [2025-03-04 07:04:31,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:04:31,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:31,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:31,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:04:32,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:32,038 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:32,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1575642386, now seen corresponding path program 1 times [2025-03-04 07:04:32,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:04:32,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109901316] [2025-03-04 07:04:32,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:32,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:32,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:32,040 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:32,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:04:32,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:04:32,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:04:32,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:32,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:32,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-04 07:04:32,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:32,192 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:04:32,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:04:32,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:04:32,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:04:33,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2025-03-04 07:04:33,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2025-03-04 07:04:33,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2025-03-04 07:04:33,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2025-03-04 07:04:33,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 66 [2025-03-04 07:04:33,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2025-03-04 07:04:33,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:33,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-03-04 07:04:33,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2025-03-04 07:04:33,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:33,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-04 07:04:33,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2025-03-04 07:04:33,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 34 [2025-03-04 07:04:34,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2025-03-04 07:04:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:04:34,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:04:34,740 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:04:34,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109901316] [2025-03-04 07:04:34,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109901316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:04:34,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:04:34,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:04:34,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024567296] [2025-03-04 07:04:34,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:04:34,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:04:34,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:04:34,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:04:34,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:04:34,741 INFO L87 Difference]: Start difference. First operand 263 states and 319 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:04:39,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 07:04:47,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:04:47,381 INFO L93 Difference]: Finished difference Result 285 states and 339 transitions. [2025-03-04 07:04:47,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:04:47,381 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-03-04 07:04:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:04:47,383 INFO L225 Difference]: With dead ends: 285 [2025-03-04 07:04:47,383 INFO L226 Difference]: Without dead ends: 285 [2025-03-04 07:04:47,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:04:47,383 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 255 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2025-03-04 07:04:47,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 572 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1011 Invalid, 1 Unknown, 0 Unchecked, 11.8s Time] [2025-03-04 07:04:47,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-04 07:04:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 263. [2025-03-04 07:04:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 225 states have (on average 1.2266666666666666) internal successors, (276), 241 states have internal predecessors, (276), 28 states have call successors, (28), 9 states have call predecessors, (28), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:04:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 318 transitions. [2025-03-04 07:04:47,392 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 318 transitions. Word has length 37 [2025-03-04 07:04:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:04:47,392 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 318 transitions. [2025-03-04 07:04:47,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 8 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:04:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 318 transitions. [2025-03-04 07:04:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:04:47,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:04:47,394 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:04:47,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:04:47,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:47,595 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:04:47,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:04:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash -998116246, now seen corresponding path program 1 times [2025-03-04 07:04:47,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:04:47,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [833487761] [2025-03-04 07:04:47,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:47,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:04:47,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:04:47,598 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:04:47,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:04:47,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:04:47,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:04:47,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:47,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:47,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-04 07:04:47,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:47,775 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:04:47,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 07:04:47,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:04:47,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:04:48,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2025-03-04 07:04:48,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2025-03-04 07:04:48,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:48,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2025-03-04 07:04:48,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2025-03-04 07:04:48,212 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:04:48,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:04:48,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2025-03-04 07:04:48,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:49,340 INFO L349 Elim1Store]: treesize reduction 156, result has 19.2 percent of original size [2025-03-04 07:04:49,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 333 [2025-03-04 07:04:49,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 328 treesize of output 267 [2025-03-04 07:04:49,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:49,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:49,446 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:04:49,542 INFO L349 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2025-03-04 07:04:49,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 137 [2025-03-04 07:04:49,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2025-03-04 07:04:49,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:04:49,952 INFO L349 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2025-03-04 07:04:49,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 50 [2025-03-04 07:04:49,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2025-03-04 07:04:50,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:50,197 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2025-03-04 07:04:50,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 541 treesize of output 404 [2025-03-04 07:04:50,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:50,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 11 [2025-03-04 07:04:50,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:04:50,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 11 [2025-03-04 07:04:50,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-04 07:04:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:04:50,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:04:51,173 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32))) (|v_list_add___list_add_~new#1.offset_24| (_ BitVec 32)) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_445))) (store .cse0 |c_~#gl_list~0.base| (store (select (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add___list_add_~new#1.offset_24| .cse1) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_24|) |c_~#gl_list~0.base|)) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_438) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|)) |c_~#gl_list~0.base|))) is different from false [2025-03-04 07:04:51,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:04:51,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833487761] [2025-03-04 07:04:51,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833487761] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:51,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [860886535] [2025-03-04 07:04:51,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:04:51,177 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:04:51,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:04:51,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 07:04:51,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-04 07:04:51,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:04:51,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:04:51,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:04:51,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:04:51,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-04 07:04:51,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:04:51,862 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:04:51,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 07:04:51,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:04:51,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:04:52,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2025-03-04 07:04:52,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2025-03-04 07:04:52,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2025-03-04 07:04:52,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18 [2025-03-04 07:04:53,081 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:04:53,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2025-03-04 07:04:53,137 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:04:53,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:04:53,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2025-03-04 07:04:53,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:04:53,390 INFO L349 Elim1Store]: treesize reduction 66, result has 22.4 percent of original size [2025-03-04 07:04:53,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 113 [2025-03-04 07:04:53,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 78 [2025-03-04 07:04:53,443 INFO L349 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2025-03-04 07:04:53,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 39 [2025-03-04 07:04:53,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2025-03-04 07:04:53,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-04 07:04:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:04:53,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:04:54,116 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_562 (_ BitVec 32)) (v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) v_ArrVal_563))) (store .cse0 |c_~#gl_list~0.base| (store (select (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_561) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_562))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_438) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|)) |c_~#gl_list~0.base|))) is different from false [2025-03-04 07:04:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [860886535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:04:54,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:04:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2025-03-04 07:04:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935757093] [2025-03-04 07:04:54,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:04:54,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:04:54,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:04:54,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:04:54,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=614, Unknown=46, NotChecked=106, Total=870 [2025-03-04 07:04:54,120 INFO L87 Difference]: Start difference. First operand 263 states and 318 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 14 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:05:00,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:05:08,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:05:15,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]