./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.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/uthash-2.0.2/uthash_SFH_test5-3.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', '94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.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 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:12:44,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:12:44,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-07 16:12:44,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:12:44,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:12:44,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:12:44,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:12:44,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:12:44,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:12:44,763 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:12:44,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:12:44,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:12:44,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:12:44,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:12:44,764 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:12:44,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:12:44,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 16:12:44,764 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:12:44,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:12:44,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:12:44,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:12:44,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 16:12:44,765 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:12:44,765 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:12:44,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:12:44,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 16:12:44,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:12:44,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:12:44,766 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:12:44,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:12:44,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 16:12:44,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:12:44,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:12:44,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:12:44,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:12:44,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:12:44,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:12:44,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:12:44,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:12:44,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:12:44,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:12:44,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:12:44,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:12:44,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:12:44,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:12:44,768 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 -> 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 [2024-11-07 16:12:45,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:12:45,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:12:45,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:12:45,071 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:12:45,072 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:12:45,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-07 16:12:46,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:12:46,649 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:12:46,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-07 16:12:46,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19225563b/dc5c828a9b2045e091029de28d27554f/FLAG4aaa792c7 [2024-11-07 16:12:46,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19225563b/dc5c828a9b2045e091029de28d27554f [2024-11-07 16:12:46,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:12:46,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:12:46,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:12:46,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:12:46,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:12:46,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:12:46" (1/1) ... [2024-11-07 16:12:46,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749d5edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:46, skipping insertion in model container [2024-11-07 16:12:46,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:12:46" (1/1) ... [2024-11-07 16:12:46,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:12:47,258 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,283 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,286 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,289 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,295 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,321 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,323 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,328 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,333 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,365 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,369 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,371 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,371 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,372 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,380 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,383 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,383 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,384 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,387 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,387 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,388 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,388 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,391 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:47,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:12:47,422 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 16:12:47,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6dc53601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:47, skipping insertion in model container [2024-11-07 16:12:47,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:12:47,423 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 16:12:47,425 INFO L158 Benchmark]: Toolchain (without parser) took 537.52ms. Allocated memory is still 100.7MB. Free memory was 74.6MB in the beginning and 51.4MB in the end (delta: 23.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:12:47,426 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:12:47,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.65ms. Allocated memory is still 100.7MB. Free memory was 74.5MB in the beginning and 51.4MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 16:12:47,427 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.85ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.65ms. Allocated memory is still 100.7MB. Free memory was 74.5MB in the beginning and 51.4MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 760]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.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 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:12:49,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:12:49,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-07 16:12:49,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:12:49,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:12:49,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:12:49,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:12:49,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:12:49,605 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:12:49,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:12:49,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:12:49,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:12:49,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:12:49,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:12:49,607 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:12:49,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:12:49,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 16:12:49,607 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:12:49,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:12:49,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:12:49,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:12:49,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:12:49,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:12:49,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:12:49,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:12:49,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:12:49,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:12:49,609 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 16:12:49,609 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 16:12:49,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:12:49,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:12:49,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:12:49,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:12:49,609 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 -> 94599b38b669e42115f92cee257d9ed4ed5d4777dca7d2ee690bacb4e0d226f0 [2024-11-07 16:12:49,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:12:49,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:12:49,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:12:49,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:12:49,914 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:12:49,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-07 16:12:51,217 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:12:51,604 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:12:51,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-3.i [2024-11-07 16:12:51,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dee27c14c/183f1929fdaf4178924b5db12e7fe6bb/FLAG23a79f17f [2024-11-07 16:12:51,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dee27c14c/183f1929fdaf4178924b5db12e7fe6bb [2024-11-07 16:12:51,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:12:51,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:12:51,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:12:51,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:12:51,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:12:51,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:12:51" (1/1) ... [2024-11-07 16:12:51,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75af3669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:51, skipping insertion in model container [2024-11-07 16:12:51,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:12:51" (1/1) ... [2024-11-07 16:12:51,705 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:12:52,166 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,197 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,200 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,203 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,213 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,254 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,256 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,259 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,264 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,296 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,297 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,301 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,302 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,303 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,305 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,308 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,309 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,309 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,316 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,316 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,317 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,318 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,321 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:12:52,348 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 16:12:52,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:12:52,399 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,423 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,425 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,427 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,435 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,461 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,462 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,464 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,467 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,491 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,492 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,493 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,496 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,497 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,499 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,500 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,500 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,501 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,504 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,505 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,506 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,506 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,509 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-07 16:12:52,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:12:52,520 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:12:52,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:12:52,697 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:12:52,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52 WrapperNode [2024-11-07 16:12:52,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:12:52,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:12:52,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:12:52,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:12:52,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52" (1/1) ... [2024-11-07 16:12:52,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52" (1/1) ... [2024-11-07 16:12:52,818 INFO L138 Inliner]: procedures = 180, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1728 [2024-11-07 16:12:52,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:12:52,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:12:52,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:12:52,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:12:52,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52" (1/1) ... [2024-11-07 16:12:52,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52" (1/1) ... [2024-11-07 16:12:52,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52" (1/1) ... [2024-11-07 16:12:52,980 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 417, 24]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 98, 1]. [2024-11-07 16:12:52,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52" (1/1) ... [2024-11-07 16:12:52,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52" (1/1) ... [2024-11-07 16:12:53,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52" (1/1) ... [2024-11-07 16:12:53,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52" (1/1) ... [2024-11-07 16:12:53,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52" (1/1) ... [2024-11-07 16:12:53,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52" (1/1) ... [2024-11-07 16:12:53,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:12:53,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:12:53,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:12:53,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:12:53,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52" (1/1) ... [2024-11-07 16:12:53,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:12:53,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:12:53,129 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 16:12:53,132 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 16:12:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-07 16:12:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-07 16:12:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 16:12:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 16:12:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 16:12:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 16:12:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 16:12:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 16:12:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 16:12:53,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 16:12:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-07 16:12:53,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-07 16:12:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-07 16:12:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-07 16:12:53,155 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 16:12:53,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:12:53,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:12:53,442 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:12:53,444 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:13:08,037 INFO L? ?]: Removed 229 outVars from TransFormulas that were not future-live. [2024-11-07 16:13:08,038 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:13:08,050 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:13:08,051 INFO L316 CfgBuilder]: Removed 100 assume(true) statements. [2024-11-07 16:13:08,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:13:08 BoogieIcfgContainer [2024-11-07 16:13:08,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:13:08,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:13:08,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:13:08,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:13:08,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:12:51" (1/3) ... [2024-11-07 16:13:08,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478a278a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:13:08, skipping insertion in model container [2024-11-07 16:13:08,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:12:52" (2/3) ... [2024-11-07 16:13:08,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478a278a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:13:08, skipping insertion in model container [2024-11-07 16:13:08,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:13:08" (3/3) ... [2024-11-07 16:13:08,061 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-3.i [2024-11-07 16:13:08,075 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:13:08,075 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 16:13:08,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:13:08,126 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;@384ac518, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:13:08,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 16:13:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 304 states have (on average 1.6710526315789473) internal successors, (508), 313 states have internal predecessors, (508), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 16:13:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:13:08,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:08,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:08,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:08,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash 334886841, now seen corresponding path program 1 times [2024-11-07 16:13:08,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:08,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635124675] [2024-11-07 16:13:08,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:13:08,152 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 16:13:08,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:08,156 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 16:13:08,157 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 16:13:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:13:08,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 16:13:08,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:08,397 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 16:13:08,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:13:08,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:08,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635124675] [2024-11-07 16:13:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635124675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:13:08,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:13:08,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:13:08,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612806205] [2024-11-07 16:13:08,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:13:08,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 16:13:08,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:08,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 16:13:08,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:13:08,424 INFO L87 Difference]: Start difference. First operand has 323 states, 304 states have (on average 1.6710526315789473) internal successors, (508), 313 states have internal predecessors, (508), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:13:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:13:08,452 INFO L93 Difference]: Finished difference Result 321 states and 422 transitions. [2024-11-07 16:13:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 16:13:08,454 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-07 16:13:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:13:08,461 INFO L225 Difference]: With dead ends: 321 [2024-11-07 16:13:08,462 INFO L226 Difference]: Without dead ends: 319 [2024-11-07 16:13:08,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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 16:13:08,467 INFO L432 NwaCegarLoop]: 422 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, 422 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 16:13:08,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:13:08,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-07 16:13:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-11-07 16:13:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 302 states have (on average 1.3112582781456954) internal successors, (396), 309 states have internal predecessors, (396), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 16:13:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 420 transitions. [2024-11-07 16:13:08,516 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 420 transitions. Word has length 10 [2024-11-07 16:13:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:13:08,516 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 420 transitions. [2024-11-07 16:13:08,516 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:13:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 420 transitions. [2024-11-07 16:13:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 16:13:08,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:08,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:08,521 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 16:13:08,718 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 16:13:08,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:08,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:08,719 INFO L85 PathProgramCache]: Analyzing trace with hash 909565367, now seen corresponding path program 1 times [2024-11-07 16:13:08,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:08,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969973991] [2024-11-07 16:13:08,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:13:08,720 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 16:13:08,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:08,722 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 16:13:08,724 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 16:13:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:13:08,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 16:13:08,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:08,930 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 16:13:08,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:13:08,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:08,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969973991] [2024-11-07 16:13:08,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969973991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:13:08,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:13:08,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:13:08,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005183011] [2024-11-07 16:13:08,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:13:08,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:13:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:08,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:13:08,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:13:08,935 INFO L87 Difference]: Start difference. First operand 319 states and 420 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:13:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:13:09,228 INFO L93 Difference]: Finished difference Result 566 states and 749 transitions. [2024-11-07 16:13:09,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:13:09,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-07 16:13:09,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:13:09,235 INFO L225 Difference]: With dead ends: 566 [2024-11-07 16:13:09,236 INFO L226 Difference]: Without dead ends: 566 [2024-11-07 16:13:09,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:13:09,237 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 304 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:13:09,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 860 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:13:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-07 16:13:09,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 321. [2024-11-07 16:13:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 304 states have (on average 1.3092105263157894) internal successors, (398), 311 states have internal predecessors, (398), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 16:13:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 422 transitions. [2024-11-07 16:13:09,257 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 422 transitions. Word has length 11 [2024-11-07 16:13:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:13:09,258 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 422 transitions. [2024-11-07 16:13:09,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:13:09,258 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 422 transitions. [2024-11-07 16:13:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 16:13:09,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:09,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:09,267 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 16:13:09,464 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 16:13:09,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:09,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1663298653, now seen corresponding path program 1 times [2024-11-07 16:13:09,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:09,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899479642] [2024-11-07 16:13:09,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:13:09,467 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 16:13:09,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:09,469 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 16:13:09,470 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 16:13:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:13:10,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:13:10,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:13:10,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:13:10,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:10,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899479642] [2024-11-07 16:13:10,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899479642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:13:10,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:13:10,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:13:10,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039773121] [2024-11-07 16:13:10,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:13:10,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:13:10,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:10,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:13:10,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:13:10,094 INFO L87 Difference]: Start difference. First operand 321 states and 422 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:13:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:13:10,207 INFO L93 Difference]: Finished difference Result 324 states and 417 transitions. [2024-11-07 16:13:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:13:10,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-11-07 16:13:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:13:10,210 INFO L225 Difference]: With dead ends: 324 [2024-11-07 16:13:10,210 INFO L226 Difference]: Without dead ends: 324 [2024-11-07 16:13:10,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:13:10,215 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 30 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:13:10,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1151 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:13:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-07 16:13:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-11-07 16:13:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 307 states have (on average 1.280130293159609) internal successors, (393), 314 states have internal predecessors, (393), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 16:13:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 417 transitions. [2024-11-07 16:13:10,236 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 417 transitions. Word has length 152 [2024-11-07 16:13:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:13:10,237 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 417 transitions. [2024-11-07 16:13:10,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:13:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 417 transitions. [2024-11-07 16:13:10,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-07 16:13:10,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:10,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:10,256 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 16:13:10,441 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 16:13:10,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:10,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:10,442 INFO L85 PathProgramCache]: Analyzing trace with hash -287494633, now seen corresponding path program 1 times [2024-11-07 16:13:10,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:10,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578089057] [2024-11-07 16:13:10,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:13:10,444 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 16:13:10,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:10,446 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 16:13:10,449 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 16:13:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:13:11,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:13:11,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:13:11,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:13:11,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:11,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578089057] [2024-11-07 16:13:11,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578089057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:13:11,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:13:11,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 16:13:11,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331921282] [2024-11-07 16:13:11,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:13:11,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 16:13:11,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:11,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 16:13:11,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:13:11,394 INFO L87 Difference]: Start difference. First operand 324 states and 417 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:13:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:13:12,186 INFO L93 Difference]: Finished difference Result 420 states and 534 transitions. [2024-11-07 16:13:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 16:13:12,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-11-07 16:13:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:13:12,191 INFO L225 Difference]: With dead ends: 420 [2024-11-07 16:13:12,191 INFO L226 Difference]: Without dead ends: 420 [2024-11-07 16:13:12,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 16:13:12,192 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 73 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 16:13:12,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 820 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 16:13:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-07 16:13:12,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 366. [2024-11-07 16:13:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 349 states have (on average 1.2578796561604584) internal successors, (439), 356 states have internal predecessors, (439), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-07 16:13:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 463 transitions. [2024-11-07 16:13:12,202 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 463 transitions. Word has length 152 [2024-11-07 16:13:12,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:13:12,203 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 463 transitions. [2024-11-07 16:13:12,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:13:12,203 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 463 transitions. [2024-11-07 16:13:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 16:13:12,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:12,208 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:12,223 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 16:13:12,408 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 16:13:12,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:12,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash -126033427, now seen corresponding path program 1 times [2024-11-07 16:13:12,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:12,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119176051] [2024-11-07 16:13:12,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:13:12,410 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 16:13:12,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:12,412 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 16:13:12,414 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 16:13:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:13:13,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:13:13,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:13:13,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:13:13,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:13,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119176051] [2024-11-07 16:13:13,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119176051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:13:13,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:13:13,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:13:13,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013927164] [2024-11-07 16:13:13,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:13:13,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:13:13,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:13,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:13:13,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:13:13,121 INFO L87 Difference]: Start difference. First operand 366 states and 463 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:13:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:13:13,183 INFO L93 Difference]: Finished difference Result 369 states and 468 transitions. [2024-11-07 16:13:13,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:13:13,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 167 [2024-11-07 16:13:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:13:13,186 INFO L225 Difference]: With dead ends: 369 [2024-11-07 16:13:13,186 INFO L226 Difference]: Without dead ends: 369 [2024-11-07 16:13:13,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:13:13,187 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 0 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:13:13,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1208 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:13:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-07 16:13:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-11-07 16:13:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 351 states have (on average 1.2592592592592593) internal successors, (442), 359 states have internal predecessors, (442), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-07 16:13:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 468 transitions. [2024-11-07 16:13:13,199 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 468 transitions. Word has length 167 [2024-11-07 16:13:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:13:13,200 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 468 transitions. [2024-11-07 16:13:13,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:13:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 468 transitions. [2024-11-07 16:13:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-07 16:13:13,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:13,203 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:13,222 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 16:13:13,403 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 16:13:13,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:13,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash -36784469, now seen corresponding path program 1 times [2024-11-07 16:13:13,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:13,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319916432] [2024-11-07 16:13:13,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:13:13,405 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 16:13:13,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:13,407 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 16:13:13,408 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 16:13:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:13:14,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:13:14,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 16:13:14,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:13:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 16:13:14,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:14,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319916432] [2024-11-07 16:13:14,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319916432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:13:14,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:13:14,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 16:13:14,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709180645] [2024-11-07 16:13:14,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:13:14,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:13:14,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:14,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:13:14,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:13:14,210 INFO L87 Difference]: Start difference. First operand 369 states and 468 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:13:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:13:14,436 INFO L93 Difference]: Finished difference Result 380 states and 485 transitions. [2024-11-07 16:13:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:13:14,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 169 [2024-11-07 16:13:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:13:14,438 INFO L225 Difference]: With dead ends: 380 [2024-11-07 16:13:14,439 INFO L226 Difference]: Without dead ends: 380 [2024-11-07 16:13:14,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:13:14,439 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 5 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:13:14,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2002 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:13:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-07 16:13:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2024-11-07 16:13:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 359 states have (on average 1.2701949860724233) internal successors, (456), 367 states have internal predecessors, (456), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-07 16:13:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 482 transitions. [2024-11-07 16:13:14,452 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 482 transitions. Word has length 169 [2024-11-07 16:13:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:13:14,453 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 482 transitions. [2024-11-07 16:13:14,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:13:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 482 transitions. [2024-11-07 16:13:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 16:13:14,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:14,456 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:14,473 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 (7)] Ended with exit code 0 [2024-11-07 16:13:14,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 16:13:14,657 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:14,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash -560402163, now seen corresponding path program 2 times [2024-11-07 16:13:14,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759854037] [2024-11-07 16:13:14,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:13:14,658 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 16:13:14,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:14,660 INFO L229 MonitoredProcess]: Starting monitored process 8 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 16:13:14,661 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 (8)] Waiting until timeout for monitored process [2024-11-07 16:13:15,065 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 16:13:15,065 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:13:15,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:13:15,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-07 16:13:15,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:13:15,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:15,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759854037] [2024-11-07 16:13:15,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759854037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:13:15,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:13:15,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:13:15,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121949170] [2024-11-07 16:13:15,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:13:15,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:13:15,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:15,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:13:15,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:13:15,106 INFO L87 Difference]: Start difference. First operand 378 states and 482 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:13:15,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:13:15,235 INFO L93 Difference]: Finished difference Result 381 states and 477 transitions. [2024-11-07 16:13:15,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:13:15,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2024-11-07 16:13:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:13:15,238 INFO L225 Difference]: With dead ends: 381 [2024-11-07 16:13:15,238 INFO L226 Difference]: Without dead ends: 381 [2024-11-07 16:13:15,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:13:15,239 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 33 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:13:15,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1115 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:13:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-07 16:13:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-11-07 16:13:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 362 states have (on average 1.2458563535911602) internal successors, (451), 370 states have internal predecessors, (451), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-07 16:13:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 477 transitions. [2024-11-07 16:13:15,252 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 477 transitions. Word has length 173 [2024-11-07 16:13:15,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:13:15,253 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 477 transitions. [2024-11-07 16:13:15,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:13:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 477 transitions. [2024-11-07 16:13:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 16:13:15,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:15,255 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:15,260 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 (8)] Ended with exit code 0 [2024-11-07 16:13:15,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 16:13:15,456 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:15,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:15,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2091914171, now seen corresponding path program 1 times [2024-11-07 16:13:15,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:15,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198081328] [2024-11-07 16:13:15,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:13:15,458 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 16:13:15,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:15,460 INFO L229 MonitoredProcess]: Starting monitored process 9 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 16:13:15,462 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 (9)] Waiting until timeout for monitored process [2024-11-07 16:13:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:13:16,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 16:13:16,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:13:16,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:13:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 16:13:16,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:16,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198081328] [2024-11-07 16:13:16,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198081328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:13:16,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:13:16,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-07 16:13:16,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683336065] [2024-11-07 16:13:16,541 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:13:16,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 16:13:16,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:16,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 16:13:16,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:13:16,542 INFO L87 Difference]: Start difference. First operand 381 states and 477 transitions. Second operand has 14 states, 14 states have (on average 12.714285714285714) internal successors, (178), 14 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:13:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:13:17,250 INFO L93 Difference]: Finished difference Result 396 states and 500 transitions. [2024-11-07 16:13:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:13:17,251 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.714285714285714) internal successors, (178), 14 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 173 [2024-11-07 16:13:17,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:13:17,253 INFO L225 Difference]: With dead ends: 396 [2024-11-07 16:13:17,253 INFO L226 Difference]: Without dead ends: 392 [2024-11-07 16:13:17,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-07 16:13:17,255 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 8 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2733 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:13:17,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2733 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:13:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-07 16:13:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2024-11-07 16:13:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 371 states have (on average 1.247978436657682) internal successors, (463), 379 states have internal predecessors, (463), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-07 16:13:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 489 transitions. [2024-11-07 16:13:17,269 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 489 transitions. Word has length 173 [2024-11-07 16:13:17,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:13:17,269 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 489 transitions. [2024-11-07 16:13:17,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.714285714285714) internal successors, (178), 14 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:13:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 489 transitions. [2024-11-07 16:13:17,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 16:13:17,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:17,272 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:17,289 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 (9)] Ended with exit code 0 [2024-11-07 16:13:17,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 16:13:17,476 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:17,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1271566494, now seen corresponding path program 2 times [2024-11-07 16:13:17,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:17,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999058194] [2024-11-07 16:13:17,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:13:17,477 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 16:13:17,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:17,479 INFO L229 MonitoredProcess]: Starting monitored process 10 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 16:13:17,480 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 (10)] Waiting until timeout for monitored process [2024-11-07 16:13:17,874 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 16:13:17,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:13:17,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 16:13:17,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-07 16:13:17,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:13:17,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:17,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999058194] [2024-11-07 16:13:17,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999058194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:13:17,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:13:17,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:13:17,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816508755] [2024-11-07 16:13:17,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:13:17,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 16:13:17,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:17,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 16:13:17,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:13:17,966 INFO L87 Difference]: Start difference. First operand 390 states and 489 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:13:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:13:18,028 INFO L93 Difference]: Finished difference Result 384 states and 479 transitions. [2024-11-07 16:13:18,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:13:18,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 182 [2024-11-07 16:13:18,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:13:18,032 INFO L225 Difference]: With dead ends: 384 [2024-11-07 16:13:18,032 INFO L226 Difference]: Without dead ends: 384 [2024-11-07 16:13:18,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:13:18,033 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 8 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:13:18,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1115 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:13:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-07 16:13:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-07 16:13:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 365 states have (on average 1.2410958904109588) internal successors, (453), 373 states have internal predecessors, (453), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-07 16:13:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 479 transitions. [2024-11-07 16:13:18,049 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 479 transitions. Word has length 182 [2024-11-07 16:13:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:13:18,050 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 479 transitions. [2024-11-07 16:13:18,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:13:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 479 transitions. [2024-11-07 16:13:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 16:13:18,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:18,052 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:18,057 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 (10)] Ended with exit code 0 [2024-11-07 16:13:18,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 16:13:18,253 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:18,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1733672280, now seen corresponding path program 1 times [2024-11-07 16:13:18,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:18,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743993935] [2024-11-07 16:13:18,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:13:18,254 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 16:13:18,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:18,256 INFO L229 MonitoredProcess]: Starting monitored process 11 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 16:13:18,257 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 (11)] Waiting until timeout for monitored process [2024-11-07 16:13:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:13:18,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 16:13:18,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 16:13:19,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:13:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 1 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 16:13:19,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:19,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743993935] [2024-11-07 16:13:19,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743993935] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:13:19,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:13:19,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-07 16:13:19,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897075707] [2024-11-07 16:13:19,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:13:19,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 16:13:19,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:19,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 16:13:19,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-07 16:13:19,794 INFO L87 Difference]: Start difference. First operand 384 states and 479 transitions. Second operand has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:13:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:13:21,403 INFO L93 Difference]: Finished difference Result 408 states and 520 transitions. [2024-11-07 16:13:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-07 16:13:21,403 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 182 [2024-11-07 16:13:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:13:21,405 INFO L225 Difference]: With dead ends: 408 [2024-11-07 16:13:21,405 INFO L226 Difference]: Without dead ends: 404 [2024-11-07 16:13:21,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 16:13:21,407 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 13 mSDsluCounter, 4249 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4638 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 16:13:21,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4638 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 16:13:21,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-07 16:13:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 402. [2024-11-07 16:13:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 383 states have (on average 1.2454308093994777) internal successors, (477), 391 states have internal predecessors, (477), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-07 16:13:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 503 transitions. [2024-11-07 16:13:21,420 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 503 transitions. Word has length 182 [2024-11-07 16:13:21,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:13:21,420 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 503 transitions. [2024-11-07 16:13:21,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:13:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 503 transitions. [2024-11-07 16:13:21,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-07 16:13:21,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:21,423 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:21,441 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 (11)] Ended with exit code 0 [2024-11-07 16:13:21,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 16:13:21,624 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:21,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:21,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2132704952, now seen corresponding path program 2 times [2024-11-07 16:13:21,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:21,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60587111] [2024-11-07 16:13:21,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:13:21,626 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 16:13:21,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:21,627 INFO L229 MonitoredProcess]: Starting monitored process 12 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 16:13:21,628 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 (12)] Waiting until timeout for monitored process [2024-11-07 16:13:22,438 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:13:22,438 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:13:22,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 16:13:22,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-07 16:13:23,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:13:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 1 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-07 16:13:24,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:24,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60587111] [2024-11-07 16:13:24,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60587111] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:13:24,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:13:24,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-07 16:13:24,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471387497] [2024-11-07 16:13:24,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:13:24,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-07 16:13:24,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:24,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-07 16:13:24,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-07 16:13:24,684 INFO L87 Difference]: Start difference. First operand 402 states and 503 transitions. Second operand has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:13:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:13:30,888 INFO L93 Difference]: Finished difference Result 442 states and 576 transitions. [2024-11-07 16:13:30,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-07 16:13:30,888 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 200 [2024-11-07 16:13:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:13:30,890 INFO L225 Difference]: With dead ends: 442 [2024-11-07 16:13:30,890 INFO L226 Difference]: Without dead ends: 438 [2024-11-07 16:13:30,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-07 16:13:30,894 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 26 mSDsluCounter, 8882 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9271 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:13:30,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9271 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 16:13:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-07 16:13:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 436. [2024-11-07 16:13:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 417 states have (on average 1.2541966426858513) internal successors, (523), 425 states have internal predecessors, (523), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-07 16:13:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 549 transitions. [2024-11-07 16:13:30,906 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 549 transitions. Word has length 200 [2024-11-07 16:13:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:13:30,906 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 549 transitions. [2024-11-07 16:13:30,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 16:13:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 549 transitions. [2024-11-07 16:13:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-07 16:13:30,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:30,909 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:30,931 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 (12)] Ended with exit code 0 [2024-11-07 16:13:31,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 16:13:31,109 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:31,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:31,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1385395288, now seen corresponding path program 3 times [2024-11-07 16:13:31,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:31,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126914775] [2024-11-07 16:13:31,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 16:13:31,111 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 16:13:31,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:31,113 INFO L229 MonitoredProcess]: Starting monitored process 13 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 16:13:31,114 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 (13)] Waiting until timeout for monitored process [2024-11-07 16:13:31,821 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-07 16:13:31,821 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:13:31,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:13:31,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2024-11-07 16:13:31,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:13:31,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:31,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126914775] [2024-11-07 16:13:31,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126914775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:13:31,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:13:31,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:13:31,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497533770] [2024-11-07 16:13:31,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:13:31,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:13:31,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:31,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:13:31,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:13:31,868 INFO L87 Difference]: Start difference. First operand 436 states and 549 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:13:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:13:31,962 INFO L93 Difference]: Finished difference Result 439 states and 544 transitions. [2024-11-07 16:13:31,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:13:31,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 234 [2024-11-07 16:13:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:13:31,965 INFO L225 Difference]: With dead ends: 439 [2024-11-07 16:13:31,965 INFO L226 Difference]: Without dead ends: 439 [2024-11-07 16:13:31,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:13:31,966 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 30 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:13:31,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1073 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:13:31,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-07 16:13:31,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2024-11-07 16:13:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 420 states have (on average 1.2333333333333334) internal successors, (518), 428 states have internal predecessors, (518), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-07 16:13:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 544 transitions. [2024-11-07 16:13:31,978 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 544 transitions. Word has length 234 [2024-11-07 16:13:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:13:31,978 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 544 transitions. [2024-11-07 16:13:31,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 16:13:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 544 transitions. [2024-11-07 16:13:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-07 16:13:31,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:31,980 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:31,997 INFO L540 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 (13)] Forceful destruction successful, exit code 0 [2024-11-07 16:13:32,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 16:13:32,181 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:32,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:32,182 INFO L85 PathProgramCache]: Analyzing trace with hash 119238068, now seen corresponding path program 1 times [2024-11-07 16:13:32,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:32,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876266140] [2024-11-07 16:13:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:13:32,183 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 16:13:32,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:32,185 INFO L229 MonitoredProcess]: Starting monitored process 14 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 16:13:32,188 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 (14)] Waiting until timeout for monitored process [2024-11-07 16:13:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:13:33,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 16:13:33,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-07 16:13:33,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:13:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-07 16:13:35,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:35,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876266140] [2024-11-07 16:13:35,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876266140] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:13:35,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:13:35,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-07 16:13:35,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804794395] [2024-11-07 16:13:35,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:13:35,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-07 16:13:35,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:35,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-07 16:13:35,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-07 16:13:35,656 INFO L87 Difference]: Start difference. First operand 439 states and 544 transitions. Second operand has 52 states, 52 states have (on average 4.076923076923077) internal successors, (212), 52 states have internal predecessors, (212), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:13:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:13:42,671 INFO L93 Difference]: Finished difference Result 468 states and 600 transitions. [2024-11-07 16:13:42,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-07 16:13:42,672 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.076923076923077) internal successors, (212), 52 states have internal predecessors, (212), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 234 [2024-11-07 16:13:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:13:42,673 INFO L225 Difference]: With dead ends: 468 [2024-11-07 16:13:42,674 INFO L226 Difference]: Without dead ends: 468 [2024-11-07 16:13:42,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-07 16:13:42,677 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 26 mSDsluCounter, 8955 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9332 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:13:42,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9332 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-07 16:13:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-07 16:13:42,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464. [2024-11-07 16:13:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 445 states have (on average 1.2764044943820225) internal successors, (568), 453 states have internal predecessors, (568), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-07 16:13:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 594 transitions. [2024-11-07 16:13:42,686 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 594 transitions. Word has length 234 [2024-11-07 16:13:42,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:13:42,687 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 594 transitions. [2024-11-07 16:13:42,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.076923076923077) internal successors, (212), 52 states have internal predecessors, (212), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:13:42,687 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 594 transitions. [2024-11-07 16:13:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-07 16:13:42,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:13:42,689 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:13:42,717 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 (14)] Ended with exit code 0 [2024-11-07 16:13:42,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 16:13:42,889 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:13:42,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:13:42,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1816448941, now seen corresponding path program 2 times [2024-11-07 16:13:42,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:13:42,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594318630] [2024-11-07 16:13:42,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:13:42,891 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 16:13:42,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:13:42,893 INFO L229 MonitoredProcess]: Starting monitored process 15 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 16:13:42,894 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 (15)] Waiting until timeout for monitored process [2024-11-07 16:13:44,864 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:13:44,864 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:13:44,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-07 16:13:44,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:13:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-07 16:13:46,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:13:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-07 16:13:52,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:13:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594318630] [2024-11-07 16:13:52,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594318630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:13:52,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:13:52,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-07 16:13:52,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209898804] [2024-11-07 16:13:52,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:13:52,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-07 16:13:52,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:13:52,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-07 16:13:52,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-07 16:13:52,510 INFO L87 Difference]: Start difference. First operand 464 states and 594 transitions. Second operand has 102 states, 102 states have (on average 2.5686274509803924) internal successors, (262), 102 states have internal predecessors, (262), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)