./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 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml', '-i', '../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-memcleanup) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:53:53,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:53:53,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-07 15:53:53,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:53:53,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:53:53,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:53:53,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:53:53,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:53:53,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 15:53:53,492 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 15:53:53,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:53:53,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:53:53,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:53:53,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:53:53,492 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:53:53,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:53:53,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:53:53,492 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:53:53,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:53:53,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:53:53,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:53:53,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:53:53,493 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 15:53:53,493 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 15:53:53,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:53:53,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:53:53,493 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 15:53:53,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:53:53,493 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:53:53,494 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:53:53,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:53:53,494 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:53:53,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:53:53,494 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:53:53,494 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 15:53:53,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:53:53,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:53:53,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:53:53,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:53:53,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:53:53,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:53:53,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:53:53,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:53:53,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:53:53,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:53:53,495 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2024-11-07 15:53:53,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:53:53,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:53:53,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:53:53,746 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:53:53,746 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:53:53,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-07 15:53:54,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:53:55,194 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:53:55,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-07 15:53:55,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e54a76b5b/054426114c5f45bfbe911422ab69654b/FLAG7d1a1c402 [2024-11-07 15:53:55,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e54a76b5b/054426114c5f45bfbe911422ab69654b [2024-11-07 15:53:55,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:53:55,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:53:55,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:53:55,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:53:55,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:53:55,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:53:55" (1/1) ... [2024-11-07 15:53:55,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee84a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:55, skipping insertion in model container [2024-11-07 15:53:55,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:53:55" (1/1) ... [2024-11-07 15:53:55,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:53:55,848 WARN L608 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-07 15:53:55,850 WARN L608 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-07 15:53:55,851 WARN L608 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2024-11-07 15:53:55,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:53:55,881 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) [2024-11-07 15:53:55,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5d33c6b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:55, skipping insertion in model container [2024-11-07 15:53:55,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:53:55,882 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 15:53:55,884 INFO L158 Benchmark]: Toolchain (without parser) took 369.35ms. Allocated memory is still 100.7MB. Free memory was 75.4MB in the beginning and 61.0MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 15:53:55,885 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:53:55,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.66ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 61.0MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 15:53:55,886 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 83.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.66ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 61.0MB in the end (delta: 14.2MB). 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:53:57,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:53:57,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-07 15:53:57,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:53:57,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:53:57,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:53:57,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:53:57,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:53:57,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 15:53:57,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 15:53:57,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:53:57,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:53:57,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:53:57,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:53:57,769 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:53:57,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:53:57,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:53:57,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:53:57,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:53:57,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:53:57,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:53:57,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:53:57,769 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 15:53:57,770 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 15:53:57,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:53:57,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:53:57,770 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 15:53:57,770 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 15:53:57,770 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:53:57,770 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 15:53:57,770 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:53:57,770 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:53:57,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:53:57,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:53:57,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:53:57,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:53:57,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 15:53:57,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:53:57,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:53:57,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:53:57,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:53:57,772 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 15:53:57,772 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 15:53:57,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:53:57,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:53:57,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:53:57,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:53:57,772 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2024-11-07 15:53:58,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:53:58,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:53:58,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:53:58,040 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:53:58,041 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:53:58,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-07 15:53:59,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:53:59,528 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:53:59,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-07 15:53:59,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bac87fc1b/9af275a14ba94a5799982f80cea5962d/FLAG70a566c54 [2024-11-07 15:53:59,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bac87fc1b/9af275a14ba94a5799982f80cea5962d [2024-11-07 15:53:59,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:53:59,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:53:59,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:53:59,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:53:59,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:53:59,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:53:59" (1/1) ... [2024-11-07 15:53:59,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359f7a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:53:59, skipping insertion in model container [2024-11-07 15:53:59,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:53:59" (1/1) ... [2024-11-07 15:53:59,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:53:59,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:53:59,908 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 15:53:59,914 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:53:59,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:53:59,978 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:54:00,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:54:00,069 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:54:00,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00 WrapperNode [2024-11-07 15:54:00,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:54:00,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:54:00,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:54:00,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:54:00,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00" (1/1) ... [2024-11-07 15:54:00,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00" (1/1) ... [2024-11-07 15:54:00,117 INFO L138 Inliner]: procedures = 235, calls = 76, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 120 [2024-11-07 15:54:00,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:54:00,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:54:00,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:54:00,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:54:00,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00" (1/1) ... [2024-11-07 15:54:00,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00" (1/1) ... [2024-11-07 15:54:00,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00" (1/1) ... [2024-11-07 15:54:00,196 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]. [2024-11-07 15:54:00,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00" (1/1) ... [2024-11-07 15:54:00,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00" (1/1) ... [2024-11-07 15:54:00,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00" (1/1) ... [2024-11-07 15:54:00,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00" (1/1) ... [2024-11-07 15:54:00,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00" (1/1) ... [2024-11-07 15:54:00,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00" (1/1) ... [2024-11-07 15:54:00,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:54:00,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:54:00,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:54:00,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:54:00,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00" (1/1) ... [2024-11-07 15:54:00,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:54:00,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:54:00,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 15:54:00,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 15:54:00,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 15:54:00,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 15:54:00,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 15:54:00,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 15:54:00,273 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-11-07 15:54:00,273 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-11-07 15:54:00,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 15:54:00,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 15:54:00,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 15:54:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-07 15:54:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-07 15:54:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 15:54:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 15:54:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-11-07 15:54:00,274 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-11-07 15:54:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-07 15:54:00,274 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-07 15:54:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:54:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:54:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 15:54:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 15:54:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-11-07 15:54:00,275 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-11-07 15:54:00,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:54:00,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:54:00,408 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:54:00,410 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:54:00,789 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2024-11-07 15:54:00,789 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:54:00,796 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:54:00,798 INFO L316 CfgBuilder]: Removed 41 assume(true) statements. [2024-11-07 15:54:00,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:54:00 BoogieIcfgContainer [2024-11-07 15:54:00,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:54:00,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:54:00,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:54:00,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:54:00,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:53:59" (1/3) ... [2024-11-07 15:54:00,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3636d70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:54:00, skipping insertion in model container [2024-11-07 15:54:00,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:00" (2/3) ... [2024-11-07 15:54:00,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3636d70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:54:00, skipping insertion in model container [2024-11-07 15:54:00,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:54:00" (3/3) ... [2024-11-07 15:54:00,807 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2024-11-07 15:54:00,837 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:54:00,837 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 15:54:00,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:54:00,876 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;@49bbc9cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:54:00,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 15:54:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 92 states have (on average 1.7391304347826086) internal successors, (160), 112 states have internal predecessors, (160), 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) [2024-11-07 15:54:00,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 15:54:00,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:54:00,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:54:00,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 15:54:00,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:54:00,890 INFO L85 PathProgramCache]: Analyzing trace with hash 949299624, now seen corresponding path program 1 times [2024-11-07 15:54:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 15:54:00,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999323355] [2024-11-07 15:54:00,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:54:00,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 15:54:00,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 15:54:00,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 15:54:00,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 15:54:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:54:00,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 15:54:00,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:54:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:54:00,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:54:00,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 15:54:00,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999323355] [2024-11-07 15:54:00,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999323355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:54:00,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:54:00,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:54:00,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322724704] [2024-11-07 15:54:00,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:54:00,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 15:54:00,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 15:54:01,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 15:54:01,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 15:54:01,015 INFO L87 Difference]: Start difference. First operand has 122 states, 92 states have (on average 1.7391304347826086) internal successors, (160), 112 states have internal predecessors, (160), 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) [2024-11-07 15:54:01,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:54:01,034 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2024-11-07 15:54:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 15:54:01,036 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 [2024-11-07 15:54:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:54:01,042 INFO L225 Difference]: With dead ends: 117 [2024-11-07 15:54:01,042 INFO L226 Difference]: Without dead ends: 115 [2024-11-07 15:54:01,044 INFO L431 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 [2024-11-07 15:54:01,047 INFO L432 NwaCegarLoop]: 139 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, 139 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 [2024-11-07 15:54:01,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 15:54:01,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-07 15:54:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-07 15:54:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 104 states have internal predecessors, (110), 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) [2024-11-07 15:54:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2024-11-07 15:54:01,085 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 11 [2024-11-07 15:54:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:54:01,086 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2024-11-07 15:54:01,086 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) [2024-11-07 15:54:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2024-11-07 15:54:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 15:54:01,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:54:01,088 INFO L215 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] [2024-11-07 15:54:01,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 15:54:01,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 15:54:01,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 15:54:01,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:54:01,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1891587604, now seen corresponding path program 1 times [2024-11-07 15:54:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 15:54:01,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394287694] [2024-11-07 15:54:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:54:01,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 15:54:01,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 15:54:01,297 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 15:54:01,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 15:54:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:54:01,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 15:54:01,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:54:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:54:01,513 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:54:01,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 15:54:01,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394287694] [2024-11-07 15:54:01,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394287694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:54:01,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:54:01,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 15:54:01,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557905934] [2024-11-07 15:54:01,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:54:01,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 15:54:01,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 15:54:01,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 15:54:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:54:01,518 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-07 15:54:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:54:01,763 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2024-11-07 15:54:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 15:54:01,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 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 23 [2024-11-07 15:54:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:54:01,764 INFO L225 Difference]: With dead ends: 114 [2024-11-07 15:54:01,765 INFO L226 Difference]: Without dead ends: 114 [2024-11-07 15:54:01,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 15:54:01,765 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 179 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 15:54:01,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 264 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 15:54:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-07 15:54:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-07 15:54:01,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 103 states have internal predecessors, (109), 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) [2024-11-07 15:54:01,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2024-11-07 15:54:01,779 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 23 [2024-11-07 15:54:01,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:54:01,780 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2024-11-07 15:54:01,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-11-07 15:54:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2024-11-07 15:54:01,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 15:54:01,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:54:01,780 INFO L215 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] [2024-11-07 15:54:01,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 15:54:01,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 15:54:01,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 15:54:01,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:54:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1913163680, now seen corresponding path program 1 times [2024-11-07 15:54:01,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 15:54:01,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386687188] [2024-11-07 15:54:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:54:01,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 15:54:01,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 15:54:01,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 15:54:01,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 15:54:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:54:02,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 15:54:02,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:54:02,303 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 15:54:02,304 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 [2024-11-07 15:54:02,374 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 [2024-11-07 15:54:02,411 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 [2024-11-07 15:54:02,438 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 [2024-11-07 15:54:02,442 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 [2024-11-07 15:54:02,494 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-07 15:54:02,494 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 [2024-11-07 15:54:02,531 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 [2024-11-07 15:54:02,540 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 [2024-11-07 15:54:02,569 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 [2024-11-07 15:54:02,588 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 [2024-11-07 15:54:02,652 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 [2024-11-07 15:54:04,806 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-07 15:54:04,806 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 [2024-11-07 15:54:04,835 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 [2024-11-07 15:54:05,544 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-07 15:54:05,545 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 [2024-11-07 15:54:07,244 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (select |c_#memory_$Pointer$#1.base| (_ bv3 32)))) (or (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 (= (store (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_arrayElimArr_2) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_1) (_ bv3 32) v_arrayElimArr_2) |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add___list_add_~new#1.offset_7| (_ bv3 32)) (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|) (_ bv3 32))) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse0) (= (select v_arrayElimArr_2 (bvadd (_ bv4 32) |v_list_add___list_add_~next#1.offset_7|)) |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (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 (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| (select v_DerPreprocessor_13 |v_list_add___list_add_~new#1.offset_7|)) (= .cse0 (store (select (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_12) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_13) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (select v_DerPreprocessor_13 (bvadd (_ bv4 32) |v_list_add___list_add_~new#1.offset_7|)) (_ bv3 32)))) (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_ULTIMATE.start_gl_insert_~node~1#1.base|) (= (store (select (store (store (store |c_#memory_$Pointer$#1.base| (_ bv3 32) v_DerPreprocessor_8) |v_list_add___list_add_~next#1.base_7| v_arrayElimArr_8) |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_7) (_ bv3 32) v_DerPreprocessor_8) |v_list_add___list_add_~next#1.base_7| v_arrayElimArr_8) |c_ULTIMATE.start_gl_insert_~node~1#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|) (_ bv3 32))) (_ bv3 32)) |c_~#gl_list~0.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse0) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| |v_list_add___list_add_~next#1.base_7|)) (not (= (_ bv3 32) |v_list_add___list_add_~next#1.base_7|)))))) (not (= (_ bv3 32) |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (= (_ bv3 32) |c_~#gl_list~0.base|)) is different from true [2024-11-07 15:54:07,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 15:54:07,289 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 [2024-11-07 15:54:07,296 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 [2024-11-07 15:54:07,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 15:54:07,305 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 [2024-11-07 15:54:07,309 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 [2024-11-07 15:54:07,333 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-07 15:54:07,334 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 [2024-11-07 15:54:07,343 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 [2024-11-07 15:54:07,389 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 [2024-11-07 15:54:07,397 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 [2024-11-07 15:54:07,401 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 [2024-11-07 15:54:07,645 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 [2024-11-07 15:54:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:54:07,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:54:07,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 15:54:07,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386687188] [2024-11-07 15:54:07,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386687188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:54:07,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:54:07,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:54:07,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067221294] [2024-11-07 15:54:07,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:54:07,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:54:07,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 15:54:07,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:54:07,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=4, NotChecked=16, Total=110 [2024-11-07 15:54:07,677 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 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) [2024-11-07 15:54:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:54:13,047 INFO L93 Difference]: Finished difference Result 216 states and 255 transitions. [2024-11-07 15:54:13,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 15:54:13,048 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 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 26 [2024-11-07 15:54:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:54:13,050 INFO L225 Difference]: With dead ends: 216 [2024-11-07 15:54:13,050 INFO L226 Difference]: Without dead ends: 216 [2024-11-07 15:54:13,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=82, Invalid=216, Unknown=12, NotChecked=32, Total=342 [2024-11-07 15:54:13,051 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 475 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 71 mSolverCounterUnsat, 135 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 135 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:54:13,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 520 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 406 Invalid, 135 Unknown, 253 Unchecked, 4.4s Time] [2024-11-07 15:54:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-07 15:54:13,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 183. [2024-11-07 15:54:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 153 states have (on average 1.2418300653594772) internal successors, (190), 168 states have internal predecessors, (190), 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) [2024-11-07 15:54:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 222 transitions. [2024-11-07 15:54:13,067 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 222 transitions. Word has length 26 [2024-11-07 15:54:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:54:13,067 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 222 transitions. [2024-11-07 15:54:13,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 7 states have internal predecessors, (22), 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) [2024-11-07 15:54:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 222 transitions. [2024-11-07 15:54:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 15:54:13,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:54:13,067 INFO L215 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] [2024-11-07 15:54:13,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 15:54:13,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 15:54:13,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 15:54:13,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:54:13,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1706864921, now seen corresponding path program 1 times [2024-11-07 15:54:13,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 15:54:13,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792488877] [2024-11-07 15:54:13,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:54:13,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 15:54:13,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 15:54:13,271 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 15:54:13,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 15:54:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:54:13,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-07 15:54:13,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:54:13,470 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 15:54:13,471 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 [2024-11-07 15:54:13,509 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 [2024-11-07 15:54:13,515 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 [2024-11-07 15:54:13,645 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 [2024-11-07 15:54:13,650 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 45 treesize of output 47 [2024-11-07 15:54:13,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 15:54:13,722 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 25 treesize of output 14 [2024-11-07 15:54:13,725 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 24 treesize of output 15 [2024-11-07 15:54:13,867 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 [2024-11-07 15:54:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:54:13,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:54:13,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 15:54:13,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792488877] [2024-11-07 15:54:13,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792488877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:54:13,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:54:13,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:54:13,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571943335] [2024-11-07 15:54:13,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:54:13,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:54:13,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 15:54:13,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:54:13,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=87, Unknown=3, NotChecked=0, Total=110 [2024-11-07 15:54:13,888 INFO L87 Difference]: Start difference. First operand 183 states and 222 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 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) [2024-11-07 15:54:16,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 15:54:21,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 15:54:26,935 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] [2024-11-07 15:54:31,195 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] [2024-11-07 15:54:35,218 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] [2024-11-07 15:54:39,392 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] [2024-11-07 15:54:43,417 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] [2024-11-07 15:54:47,583 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] [2024-11-07 15:54:51,740 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] [2024-11-07 15:54:55,763 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] [2024-11-07 15:55:00,222 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] [2024-11-07 15:55:04,369 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] [2024-11-07 15:55:08,385 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] [2024-11-07 15:55:12,414 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] [2024-11-07 15:55:16,431 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] [2024-11-07 15:55:18,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 15:55:21,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 15:55:21,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:55:21,655 INFO L93 Difference]: Finished difference Result 293 states and 350 transitions. [2024-11-07 15:55:21,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 15:55:21,656 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 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 29 [2024-11-07 15:55:21,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:55:21,658 INFO L225 Difference]: With dead ends: 293 [2024-11-07 15:55:21,658 INFO L226 Difference]: Without dead ends: 293 [2024-11-07 15:55:21,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=208, Unknown=8, NotChecked=0, Total=272 [2024-11-07 15:55:21,659 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 233 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 34 mSolverCounterUnsat, 116 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 116 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.4s IncrementalHoareTripleChecker+Time [2024-11-07 15:55:21,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 464 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 960 Invalid, 116 Unknown, 0 Unchecked, 67.4s Time] [2024-11-07 15:55:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-07 15:55:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 268. [2024-11-07 15:55:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 230 states have (on average 1.2347826086956522) internal successors, (284), 246 states have internal predecessors, (284), 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) [2024-11-07 15:55:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 326 transitions. [2024-11-07 15:55:21,676 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 326 transitions. Word has length 29 [2024-11-07 15:55:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:55:21,676 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 326 transitions. [2024-11-07 15:55:21,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 7 states have internal predecessors, (25), 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) [2024-11-07 15:55:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 326 transitions. [2024-11-07 15:55:21,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 15:55:21,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:55:21,678 INFO L215 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] [2024-11-07 15:55:21,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 15:55:21,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 15:55:21,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 15:55:21,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:55:21,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1462457616, now seen corresponding path program 1 times [2024-11-07 15:55:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 15:55:21,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239736539] [2024-11-07 15:55:21,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:55:21,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 15:55:21,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 15:55:21,881 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 15:55:21,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 15:55:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:55:22,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-07 15:55:22,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:55:22,154 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 15:55:22,154 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 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-07 15:55:22,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-07 15:55:22,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-11-07 15:55:23,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 53 treesize of output 50 [2024-11-07 15:55:23,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 58 treesize of output 57 [2024-11-07 15:55:23,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 15:55:23,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 14 [2024-11-07 15:55:23,677 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 28 treesize of output 26 [2024-11-07 15:55:24,268 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 35 treesize of output 15 [2024-11-07 15:55:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:55:24,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:55:24,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 15:55:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239736539] [2024-11-07 15:55:24,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239736539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:55:24,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:55:24,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 15:55:24,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838159430] [2024-11-07 15:55:24,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:55:24,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 15:55:24,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 15:55:24,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 15:55:24,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 15:55:24,337 INFO L87 Difference]: Start difference. First operand 268 states and 326 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 7 states have internal predecessors, (28), 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) [2024-11-07 15:55:29,193 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] [2024-11-07 15:55:33,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 15:55:33,006 INFO L93 Difference]: Finished difference Result 292 states and 348 transitions. [2024-11-07 15:55:33,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 15:55:33,008 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 7 states have internal predecessors, (28), 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 32 [2024-11-07 15:55:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 15:55:33,012 INFO L225 Difference]: With dead ends: 292 [2024-11-07 15:55:33,012 INFO L226 Difference]: Without dead ends: 292 [2024-11-07 15:55:33,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-07 15:55:33,014 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 271 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-11-07 15:55:33,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 509 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 925 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2024-11-07 15:55:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-07 15:55:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 268. [2024-11-07 15:55:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 230 states have (on average 1.2304347826086957) internal successors, (283), 246 states have internal predecessors, (283), 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) [2024-11-07 15:55:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 325 transitions. [2024-11-07 15:55:33,026 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 325 transitions. Word has length 32 [2024-11-07 15:55:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 15:55:33,026 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 325 transitions. [2024-11-07 15:55:33,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 7 states have internal predecessors, (28), 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) [2024-11-07 15:55:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 325 transitions. [2024-11-07 15:55:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-07 15:55:33,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 15:55:33,027 INFO L215 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] [2024-11-07 15:55:33,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 15:55:33,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 15:55:33,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 15:55:33,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:55:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash -580589948, now seen corresponding path program 1 times [2024-11-07 15:55:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 15:55:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226165362] [2024-11-07 15:55:33,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:55:33,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 15:55:33,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 15:55:33,231 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 15:55:33,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 15:55:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:55:33,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-07 15:55:33,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:55:33,472 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-07 15:55:33,473 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 [2024-11-07 15:55:33,591 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 [2024-11-07 15:55:33,604 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 [2024-11-07 15:55:35,166 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 [2024-11-07 15:55:35,181 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 [2024-11-07 15:55:35,199 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 43 treesize of output 24 [2024-11-07 15:55:35,209 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 11 treesize of output 15 [2024-11-07 15:55:35,249 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 [2024-11-07 15:55:35,281 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 51 treesize of output 48 [2024-11-07 15:55:35,299 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 47 treesize of output 50 [2024-11-07 15:55:35,310 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 55 treesize of output 32 [2024-11-07 15:55:35,321 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 [2024-11-07 15:55:35,488 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 15:55:35,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 60 [2024-11-07 15:55:35,506 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 24 treesize of output 11 [2024-11-07 15:55:36,713 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-11-07 15:55:36,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 71 treesize of output 29 [2024-11-07 15:55:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:55:36,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:55:36,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 15:55:36,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226165362] [2024-11-07 15:55:36,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226165362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:55:36,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:55:36,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 15:55:36,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821978282] [2024-11-07 15:55:36,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:55:36,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 15:55:36,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 15:55:36,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 15:55:36,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-07 15:55:36,787 INFO L87 Difference]: Start difference. First operand 268 states and 325 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 8 states have internal predecessors, (31), 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)