./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.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_JEN_test6-1.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G valid-memcleanup) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3'] 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_JEN_test6-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:03:24,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:03:24,194 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:03:24,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:03:24,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:03:24,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:03:24,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:03:24,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:03:24,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:03:24,233 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:03:24,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:03:24,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:03:24,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:03:24,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:03:24,236 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:03:24,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:03:24,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 16:03:24,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:03:24,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:03:24,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:03:24,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:03:24,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 16:03:24,236 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:03:24,236 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:03:24,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:03:24,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 16:03:24,236 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:03:24,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:03:24,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:03:24,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:03:24,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:03:24,238 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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2024-11-07 16:03:24,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:03:24,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:03:24,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:03:24,538 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:03:24,539 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:03:24,540 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_JEN_test6-1.i [2024-11-07 16:03:25,855 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:03:26,216 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:03:26,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-11-07 16:03:26,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6f687f20/ddcea6344e3047d1a31df79b890aed1a/FLAGf6cca9689 [2024-11-07 16:03:26,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6f687f20/ddcea6344e3047d1a31df79b890aed1a [2024-11-07 16:03:26,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:03:26,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:03:26,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:03:26,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:03:26,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:03:26,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:03:26" (1/1) ... [2024-11-07 16:03:26,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6555144f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:26, skipping insertion in model container [2024-11-07 16:03:26,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:03:26" (1/1) ... [2024-11-07 16:03:26,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:03:26,714 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:03:26,746 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:03:26,750 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:03:26,755 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:03:26,764 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:03:26,793 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:03:26,793 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:03:26,801 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:03:26,801 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:03:26,803 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:03:26,805 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:03:26,805 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:03:26,806 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:03:26,809 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:03:26,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:03:26,834 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:03:26,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@73470d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:26, skipping insertion in model container [2024-11-07 16:03:26,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:03:26,835 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-07 16:03:26,838 INFO L158 Benchmark]: Toolchain (without parser) took 571.01ms. Allocated memory is still 117.4MB. Free memory was 89.2MB in the beginning and 68.1MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 16:03:26,841 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 117.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 16:03:26,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.25ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 68.1MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 16:03:26,842 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.76ms. Allocated memory is still 117.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.25ms. Allocated memory is still 117.4MB. Free memory was 89.1MB in the beginning and 68.1MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 16:03:28,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 16:03:28,911 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:03:28,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 16:03:28,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 16:03:28,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 16:03:28,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 16:03:28,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 16:03:28,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 16:03:28,936 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 16:03:28,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 16:03:28,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 16:03:28,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 16:03:28,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 16:03:28,938 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 16:03:28,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 16:03:28,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 16:03:28,938 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 16:03:28,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 16:03:28,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 16:03:28,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 16:03:28,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 16:03:28,939 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-07 16:03:28,939 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-07 16:03:28,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 16:03:28,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 16:03:28,939 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 16:03:28,939 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 16:03:28,939 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 16:03:28,939 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 16:03:28,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 16:03:28,939 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 16:03:28,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 16:03:28,939 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 16:03:28,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 16:03:28,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 16:03:28,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 16:03:28,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 16:03:28,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:03:28,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 16:03:28,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 16:03:28,940 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 16:03:28,940 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 16:03:28,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 16:03:28,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 16:03:28,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 16:03:28,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 16:03:28,940 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 -> 3012c2825f53c0db53d950c12df6540de859b34b2bef033c36a98846352dedd3 [2024-11-07 16:03:29,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 16:03:29,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 16:03:29,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 16:03:29,231 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 16:03:29,231 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 16:03:29,233 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_JEN_test6-1.i [2024-11-07 16:03:30,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 16:03:30,960 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 16:03:30,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-1.i [2024-11-07 16:03:30,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca925af8d/b4193da54d5042d3940de204d233f369/FLAGf4e8afa50 [2024-11-07 16:03:31,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca925af8d/b4193da54d5042d3940de204d233f369 [2024-11-07 16:03:31,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 16:03:31,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 16:03:31,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 16:03:31,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 16:03:31,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 16:03:31,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:03:31" (1/1) ... [2024-11-07 16:03:31,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d4569f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:31, skipping insertion in model container [2024-11-07 16:03:31,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:03:31" (1/1) ... [2024-11-07 16:03:31,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:03:31,458 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:03:31,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:03:31,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:03:31,508 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:03:31,518 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:03:31,551 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:03:31,551 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:03:31,556 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:03:31,557 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:03:31,560 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:03:31,565 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:03:31,566 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:03:31,567 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:03:31,571 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:03:31,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:03:31,589 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-07 16:03:31,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 16:03:31,657 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:03:31,675 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:03:31,681 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:03:31,683 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:03:31,689 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:03:31,716 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:03:31,718 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:03:31,720 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:03:31,720 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:03:31,722 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:03:31,724 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:03:31,727 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:03:31,728 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:03:31,731 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:03:31,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:03:31,745 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 16:03:31,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 16:03:31,917 INFO L204 MainTranslator]: Completed translation [2024-11-07 16:03:31,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:31 WrapperNode [2024-11-07 16:03:31,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 16:03:31,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 16:03:31,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 16:03:31,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 16:03:31,929 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:03:31" (1/1) ... [2024-11-07 16:03:31,966 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:03:31" (1/1) ... [2024-11-07 16:03:32,058 INFO L138 Inliner]: procedures = 286, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1071 [2024-11-07 16:03:32,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 16:03:32,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 16:03:32,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 16:03:32,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 16:03:32,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:31" (1/1) ... [2024-11-07 16:03:32,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:31" (1/1) ... [2024-11-07 16:03:32,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:31" (1/1) ... [2024-11-07 16:03:32,169 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 220, 12, 34]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 54 writes are split as follows [0, 49, 1, 4]. [2024-11-07 16:03:32,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:31" (1/1) ... [2024-11-07 16:03:32,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:31" (1/1) ... [2024-11-07 16:03:32,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:31" (1/1) ... [2024-11-07 16:03:32,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:31" (1/1) ... [2024-11-07 16:03:32,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:31" (1/1) ... [2024-11-07 16:03:32,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:31" (1/1) ... [2024-11-07 16:03:32,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 16:03:32,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 16:03:32,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 16:03:32,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 16:03:32,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:31" (1/1) ... [2024-11-07 16:03:32,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 16:03:32,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 16:03:32,278 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:03:32,280 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:03:32,306 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-07 16:03:32,306 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-07 16:03:32,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-07 16:03:32,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-07 16:03:32,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-07 16:03:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-07 16:03:32,307 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-07 16:03:32,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 16:03:32,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 16:03:32,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 16:03:32,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 16:03:32,308 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-07 16:03:32,308 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-07 16:03:32,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-07 16:03:32,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-07 16:03:32,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-07 16:03:32,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-07 16:03:32,308 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-07 16:03:32,308 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-07 16:03:32,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 16:03:32,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 16:03:32,537 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 16:03:32,539 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 16:03:36,620 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-07 16:03:36,621 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 16:03:36,635 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 16:03:36,635 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-07 16:03:36,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:03:36 BoogieIcfgContainer [2024-11-07 16:03:36,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 16:03:36,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 16:03:36,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 16:03:36,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 16:03:36,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:03:31" (1/3) ... [2024-11-07 16:03:36,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326ceda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:03:36, skipping insertion in model container [2024-11-07 16:03:36,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:03:31" (2/3) ... [2024-11-07 16:03:36,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326ceda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:03:36, skipping insertion in model container [2024-11-07 16:03:36,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:03:36" (3/3) ... [2024-11-07 16:03:36,649 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-1.i [2024-11-07 16:03:36,662 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 16:03:36,662 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 16:03:36,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 16:03:36,718 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;@73c6c898, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 16:03:36,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 16:03:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 214 states have internal predecessors, (336), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 16:03:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 16:03:36,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:03:36,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:03:36,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:03:36,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:03:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1647619846, now seen corresponding path program 1 times [2024-11-07 16:03:36,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:03:36,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076221749] [2024-11-07 16:03:36,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:03:36,744 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:03:36,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:03:36,746 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:03:36,748 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:03:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:03:36,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 16:03:36,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:03:36,970 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:03:36,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:03:36,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:03:36,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076221749] [2024-11-07 16:03:36,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076221749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:03:36,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:03:36,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 16:03:36,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894667432] [2024-11-07 16:03:36,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:03:36,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 16:03:36,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:03:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 16:03:36,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 16:03:37,002 INFO L87 Difference]: Start difference. First operand has 234 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 214 states have internal predecessors, (336), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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:03:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:03:37,037 INFO L93 Difference]: Finished difference Result 229 states and 294 transitions. [2024-11-07 16:03:37,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 16:03:37,039 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:03:37,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:03:37,046 INFO L225 Difference]: With dead ends: 229 [2024-11-07 16:03:37,046 INFO L226 Difference]: Without dead ends: 227 [2024-11-07 16:03:37,048 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:03:37,050 INFO L432 NwaCegarLoop]: 294 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, 294 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:03:37,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:03:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-07 16:03:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2024-11-07 16:03:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 204 states have (on average 1.2843137254901962) internal successors, (262), 209 states have internal predecessors, (262), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 16:03:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 292 transitions. [2024-11-07 16:03:37,103 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 292 transitions. Word has length 10 [2024-11-07 16:03:37,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:03:37,103 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 292 transitions. [2024-11-07 16:03:37,104 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:03:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 292 transitions. [2024-11-07 16:03:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 16:03:37,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:03:37,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:03:37,108 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:03:37,305 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:03:37,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:03:37,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:03:37,306 INFO L85 PathProgramCache]: Analyzing trace with hash -617467811, now seen corresponding path program 1 times [2024-11-07 16:03:37,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:03:37,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537952368] [2024-11-07 16:03:37,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:03:37,307 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:03:37,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:03:37,310 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:03:37,312 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:03:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:03:37,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:03:37,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:03:37,642 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:03:37,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:03:37,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:03:37,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537952368] [2024-11-07 16:03:37,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537952368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:03:37,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:03:37,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:03:37,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820562972] [2024-11-07 16:03:37,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:03:37,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:03:37,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:03:37,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:03:37,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:03:37,646 INFO L87 Difference]: Start difference. First operand 227 states and 292 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:03:40,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 16:03:42,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:03:42,636 INFO L93 Difference]: Finished difference Result 343 states and 444 transitions. [2024-11-07 16:03:42,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:03:42,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 12 [2024-11-07 16:03:42,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:03:42,640 INFO L225 Difference]: With dead ends: 343 [2024-11-07 16:03:42,640 INFO L226 Difference]: Without dead ends: 343 [2024-11-07 16:03:42,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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:03:42,641 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 139 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-07 16:03:42,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 791 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-07 16:03:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-07 16:03:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 339. [2024-11-07 16:03:42,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 316 states have (on average 1.2943037974683544) internal successors, (409), 321 states have internal predecessors, (409), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 16:03:42,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 439 transitions. [2024-11-07 16:03:42,677 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 439 transitions. Word has length 12 [2024-11-07 16:03:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:03:42,677 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 439 transitions. [2024-11-07 16:03:42,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:03:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 439 transitions. [2024-11-07 16:03:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 16:03:42,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:03:42,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 16:03:42,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 16:03:42,878 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:03:42,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:03:42,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:03:42,879 INFO L85 PathProgramCache]: Analyzing trace with hash -559454960, now seen corresponding path program 1 times [2024-11-07 16:03:42,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:03:42,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176222418] [2024-11-07 16:03:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:03:42,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 16:03:42,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:03:42,881 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:03:42,882 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:03:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:03:43,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:03:43,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:03:43,084 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:03:43,085 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:03:43,085 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:03:43,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-07 16:03:43,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:03:43,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-07 16:03:43,169 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:03:43,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:03:43,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:03:43,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176222418] [2024-11-07 16:03:43,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176222418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:03:43,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:03:43,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:03:43,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971969859] [2024-11-07 16:03:43,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:03:43,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:03:43,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:03:43,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:03:43,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:03:43,170 INFO L87 Difference]: Start difference. First operand 339 states and 439 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:03:43,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:03:43,626 INFO L93 Difference]: Finished difference Result 519 states and 679 transitions. [2024-11-07 16:03:43,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:03:43,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 16:03:43,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:03:43,629 INFO L225 Difference]: With dead ends: 519 [2024-11-07 16:03:43,629 INFO L226 Difference]: Without dead ends: 519 [2024-11-07 16:03:43,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 16:03:43,630 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 230 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:03:43,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 824 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:03:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2024-11-07 16:03:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 338. [2024-11-07 16:03:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 315 states have (on average 1.2920634920634921) internal successors, (407), 320 states have internal predecessors, (407), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 16:03:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 437 transitions. [2024-11-07 16:03:43,655 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 437 transitions. Word has length 15 [2024-11-07 16:03:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:03:43,655 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 437 transitions. [2024-11-07 16:03:43,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:03:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 437 transitions. [2024-11-07 16:03:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 16:03:43,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:03:43,657 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] [2024-11-07 16:03:43,664 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:03:43,857 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:03:43,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:03:43,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:03:43,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1940751512, now seen corresponding path program 1 times [2024-11-07 16:03:43,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:03:43,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42150528] [2024-11-07 16:03:43,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:03:43,859 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:03:43,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:03:43,861 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:03:43,862 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:03:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:03:44,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 16:03:44,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:03:44,174 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:03:44,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:03:44,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:03:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42150528] [2024-11-07 16:03:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42150528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:03:44,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:03:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:03:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326760608] [2024-11-07 16:03:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:03:44,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:03:44,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:03:44,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:03:44,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:03:44,179 INFO L87 Difference]: Start difference. First operand 338 states and 437 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:03:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:03:44,293 INFO L93 Difference]: Finished difference Result 344 states and 427 transitions. [2024-11-07 16:03:44,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 16:03:44,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-07 16:03:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:03:44,295 INFO L225 Difference]: With dead ends: 344 [2024-11-07 16:03:44,295 INFO L226 Difference]: Without dead ends: 344 [2024-11-07 16:03:44,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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:03:44,296 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 30 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 767 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:03:44,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 767 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:03:44,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-07 16:03:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2024-11-07 16:03:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 321 states have (on average 1.236760124610592) internal successors, (397), 326 states have internal predecessors, (397), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 16:03:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 427 transitions. [2024-11-07 16:03:44,308 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 427 transitions. Word has length 50 [2024-11-07 16:03:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:03:44,308 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 427 transitions. [2024-11-07 16:03:44,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:03:44,309 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 427 transitions. [2024-11-07 16:03:44,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 16:03:44,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:03:44,310 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] [2024-11-07 16:03:44,317 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:03:44,510 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:03:44,511 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:03:44,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:03:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1486167460, now seen corresponding path program 1 times [2024-11-07 16:03:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:03:44,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247116900] [2024-11-07 16:03:44,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:03:44,512 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:03:44,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:03:44,514 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:03:44,515 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:03:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:03:44,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:03:44,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:03:44,863 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:03:44,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:03:44,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:03:44,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247116900] [2024-11-07 16:03:44,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247116900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:03:44,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:03:44,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 16:03:44,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342320379] [2024-11-07 16:03:44,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:03:44,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:03:44,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:03:44,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:03:44,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:03:44,864 INFO L87 Difference]: Start difference. First operand 344 states and 427 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:03:44,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:03:44,969 INFO L93 Difference]: Finished difference Result 354 states and 437 transitions. [2024-11-07 16:03:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 16:03:44,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-07 16:03:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:03:44,971 INFO L225 Difference]: With dead ends: 354 [2024-11-07 16:03:44,971 INFO L226 Difference]: Without dead ends: 354 [2024-11-07 16:03:44,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:03:44,972 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 9 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:03:44,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1371 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:03:44,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-07 16:03:44,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-11-07 16:03:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 328 states have (on average 1.2347560975609757) internal successors, (405), 334 states have internal predecessors, (405), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 16:03:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 437 transitions. [2024-11-07 16:03:44,982 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 437 transitions. Word has length 50 [2024-11-07 16:03:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:03:44,982 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 437 transitions. [2024-11-07 16:03:44,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 16:03:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 437 transitions. [2024-11-07 16:03:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 16:03:44,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:03:44,984 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 16:03:44,994 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:03:45,184 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:03:45,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:03:45,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:03:45,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1102378676, now seen corresponding path program 1 times [2024-11-07 16:03:45,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:03:45,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749868489] [2024-11-07 16:03:45,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:03:45,186 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:03:45,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:03:45,188 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:03:45,191 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:03:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:03:45,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:03:45,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:03:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:03:45,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:03:45,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:03:45,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749868489] [2024-11-07 16:03:45,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749868489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:03:45,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:03:45,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 16:03:45,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759824244] [2024-11-07 16:03:45,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:03:45,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 16:03:45,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:03:45,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 16:03:45,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 16:03:45,713 INFO L87 Difference]: Start difference. First operand 354 states and 437 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:03:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:03:45,905 INFO L93 Difference]: Finished difference Result 362 states and 447 transitions. [2024-11-07 16:03:45,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 16:03:45,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2024-11-07 16:03:45,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:03:45,909 INFO L225 Difference]: With dead ends: 362 [2024-11-07 16:03:45,909 INFO L226 Difference]: Without dead ends: 362 [2024-11-07 16:03:45,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 16:03:45,911 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 20 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:03:45,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 990 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 16:03:45,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-07 16:03:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 358. [2024-11-07 16:03:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 330 states have (on average 1.2333333333333334) internal successors, (407), 337 states have internal predecessors, (407), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2024-11-07 16:03:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 442 transitions. [2024-11-07 16:03:45,928 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 442 transitions. Word has length 65 [2024-11-07 16:03:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:03:45,928 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 442 transitions. [2024-11-07 16:03:45,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 16:03:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 442 transitions. [2024-11-07 16:03:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-07 16:03:45,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:03:45,929 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] [2024-11-07 16:03:45,942 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:03:46,130 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:03:46,130 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:03:46,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:03:46,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1344249161, now seen corresponding path program 1 times [2024-11-07 16:03:46,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:03:46,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707470278] [2024-11-07 16:03:46,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:03:46,131 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:03:46,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:03:46,133 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:03:46,134 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:03:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:03:46,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 16:03:46,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:03:46,589 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:03:46,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:03:46,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:03:46,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707470278] [2024-11-07 16:03:46,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707470278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:03:46,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:03:46,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:03:46,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039455451] [2024-11-07 16:03:46,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:03:46,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:03:46,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:03:46,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:03:46,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:03:46,590 INFO L87 Difference]: Start difference. First operand 358 states and 442 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:03:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:03:46,637 INFO L93 Difference]: Finished difference Result 362 states and 447 transitions. [2024-11-07 16:03:46,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:03:46,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 70 [2024-11-07 16:03:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:03:46,640 INFO L225 Difference]: With dead ends: 362 [2024-11-07 16:03:46,640 INFO L226 Difference]: Without dead ends: 362 [2024-11-07 16:03:46,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 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:03:46,641 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 0 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 16:03:46,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 826 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 16:03:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-07 16:03:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-11-07 16:03:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 333 states have (on average 1.2342342342342343) internal successors, (411), 341 states have internal predecessors, (411), 19 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-07 16:03:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 447 transitions. [2024-11-07 16:03:46,653 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 447 transitions. Word has length 70 [2024-11-07 16:03:46,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:03:46,654 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 447 transitions. [2024-11-07 16:03:46,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 16:03:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 447 transitions. [2024-11-07 16:03:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-07 16:03:46,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:03:46,655 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] [2024-11-07 16:03:46,666 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 (8)] Forceful destruction successful, exit code 0 [2024-11-07 16:03:46,856 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:03:46,856 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:03:46,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:03:46,856 INFO L85 PathProgramCache]: Analyzing trace with hash 198026384, now seen corresponding path program 1 times [2024-11-07 16:03:46,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:03:46,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832888782] [2024-11-07 16:03:46,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:03:46,857 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:03:46,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:03:46,859 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:03:46,860 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:03:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:03:47,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 16:03:47,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:03:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:03:47,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:03:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 16:03:47,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:03:47,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832888782] [2024-11-07 16:03:47,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832888782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:03:47,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:03:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 16:03:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357049265] [2024-11-07 16:03:47,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:03:47,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:03:47,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:03:47,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:03:47,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:03:47,411 INFO L87 Difference]: Start difference. First operand 362 states and 447 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 16:03:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:03:47,615 INFO L93 Difference]: Finished difference Result 375 states and 465 transitions. [2024-11-07 16:03:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:03:47,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 71 [2024-11-07 16:03:47,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:03:47,617 INFO L225 Difference]: With dead ends: 375 [2024-11-07 16:03:47,618 INFO L226 Difference]: Without dead ends: 375 [2024-11-07 16:03:47,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 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:03:47,618 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 4 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:03:47,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1642 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:03:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-07 16:03:47,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2024-11-07 16:03:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 342 states have (on average 1.2456140350877194) internal successors, (426), 350 states have internal predecessors, (426), 19 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-07 16:03:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 462 transitions. [2024-11-07 16:03:47,628 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 462 transitions. Word has length 71 [2024-11-07 16:03:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:03:47,628 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 462 transitions. [2024-11-07 16:03:47,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 16:03:47,629 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 462 transitions. [2024-11-07 16:03:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-07 16:03:47,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:03:47,630 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-07 16:03:47,640 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 (9)] Forceful destruction successful, exit code 0 [2024-11-07 16:03:47,830 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:03:47,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:03:47,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:03:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash -502361865, now seen corresponding path program 2 times [2024-11-07 16:03:47,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:03:47,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195741409] [2024-11-07 16:03:47,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:03:47,831 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:03:47,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:03:47,834 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:03:47,836 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:03:48,387 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:03:48,387 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:03:48,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 16:03:48,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:03:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 16:03:48,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:03:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 16:03:48,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:03:48,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195741409] [2024-11-07 16:03:48,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195741409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:03:48,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:03:48,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-07 16:03:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980485337] [2024-11-07 16:03:48,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:03:48,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 16:03:48,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:03:48,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 16:03:48,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-07 16:03:48,842 INFO L87 Difference]: Start difference. First operand 372 states and 462 transitions. Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:03:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:03:50,465 INFO L93 Difference]: Finished difference Result 2726 states and 3450 transitions. [2024-11-07 16:03:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-07 16:03:50,465 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 74 [2024-11-07 16:03:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:03:50,482 INFO L225 Difference]: With dead ends: 2726 [2024-11-07 16:03:50,483 INFO L226 Difference]: Without dead ends: 2726 [2024-11-07 16:03:50,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2024-11-07 16:03:50,484 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 2331 mSDsluCounter, 4913 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2357 SdHoareTripleChecker+Valid, 5669 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:03:50,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2357 Valid, 5669 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 16:03:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2024-11-07 16:03:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 1887. [2024-11-07 16:03:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1887 states, 1793 states have (on average 1.2576687116564418) internal successors, (2255), 1807 states have internal predecessors, (2255), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-07 16:03:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1887 states to 1887 states and 2375 transitions. [2024-11-07 16:03:50,568 INFO L78 Accepts]: Start accepts. Automaton has 1887 states and 2375 transitions. Word has length 74 [2024-11-07 16:03:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:03:50,569 INFO L471 AbstractCegarLoop]: Abstraction has 1887 states and 2375 transitions. [2024-11-07 16:03:50,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.75) internal successors, (117), 10 states have internal predecessors, (117), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 16:03:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2375 transitions. [2024-11-07 16:03:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-07 16:03:50,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:03:50,571 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:50,586 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:03:50,771 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:03:50,772 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:03:50,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:03:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1616929423, now seen corresponding path program 1 times [2024-11-07 16:03:50,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:03:50,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797437775] [2024-11-07 16:03:50,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:03:50,775 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:03:50,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:03:50,777 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:03:50,779 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:03:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:03:51,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 16:03:51,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:03:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 16:03:51,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:03:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-07 16:03:51,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:03:51,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797437775] [2024-11-07 16:03:51,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797437775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:03:51,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:03:51,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-07 16:03:51,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737344328] [2024-11-07 16:03:51,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:03:51,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 16:03:51,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:03:51,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 16:03:51,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-07 16:03:51,689 INFO L87 Difference]: Start difference. First operand 1887 states and 2375 transitions. Second operand has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 16:03:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:03:52,218 INFO L93 Difference]: Finished difference Result 1977 states and 2500 transitions. [2024-11-07 16:03:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 16:03:52,219 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2024-11-07 16:03:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:03:52,227 INFO L225 Difference]: With dead ends: 1977 [2024-11-07 16:03:52,227 INFO L226 Difference]: Without dead ends: 1947 [2024-11-07 16:03:52,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 206 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:03:52,228 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 7 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2732 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 16:03:52,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2732 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 16:03:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2024-11-07 16:03:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1932. [2024-11-07 16:03:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1838 states have (on average 1.2595212187159956) internal successors, (2315), 1852 states have internal predecessors, (2315), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-07 16:03:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2435 transitions. [2024-11-07 16:03:52,284 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2435 transitions. Word has length 110 [2024-11-07 16:03:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:03:52,284 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 2435 transitions. [2024-11-07 16:03:52,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.0) internal successors, (112), 14 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-07 16:03:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2435 transitions. [2024-11-07 16:03:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 16:03:52,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:03:52,286 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:52,302 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:03:52,486 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:03:52,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:03:52,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:03:52,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1059147878, now seen corresponding path program 2 times [2024-11-07 16:03:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:03:52,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124444633] [2024-11-07 16:03:52,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:03:52,488 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:03:52,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:03:52,492 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:03:52,493 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:03:52,815 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-07 16:03:52,815 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:03:52,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 16:03:52,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:03:52,831 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:03:52,832 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:03:52,832 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-07 16:03:52,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-07 16:03:52,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:03:52,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-07 16:03:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-07 16:03:52,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:03:52,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:03:52,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124444633] [2024-11-07 16:03:52,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124444633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:03:52,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:03:52,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 16:03:52,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929567129] [2024-11-07 16:03:52,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:03:52,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 16:03:52,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:03:52,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 16:03:52,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 16:03:52,883 INFO L87 Difference]: Start difference. First operand 1932 states and 2435 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 16:03:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:03:53,359 INFO L93 Difference]: Finished difference Result 2702 states and 3455 transitions. [2024-11-07 16:03:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 16:03:53,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 119 [2024-11-07 16:03:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:03:53,369 INFO L225 Difference]: With dead ends: 2702 [2024-11-07 16:03:53,370 INFO L226 Difference]: Without dead ends: 2702 [2024-11-07 16:03:53,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 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:03:53,370 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 215 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:03:53,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 769 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 16:03:53,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2024-11-07 16:03:53,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 1944. [2024-11-07 16:03:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1944 states, 1850 states have (on average 1.2578378378378379) internal successors, (2327), 1864 states have internal predecessors, (2327), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-07 16:03:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 2447 transitions. [2024-11-07 16:03:53,427 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 2447 transitions. Word has length 119 [2024-11-07 16:03:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:03:53,427 INFO L471 AbstractCegarLoop]: Abstraction has 1944 states and 2447 transitions. [2024-11-07 16:03:53,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-07 16:03:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2447 transitions. [2024-11-07 16:03:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 16:03:53,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:03:53,429 INFO L215 NwaCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 16:03:53,435 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 (12)] Forceful destruction successful, exit code 0 [2024-11-07 16:03:53,630 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:03:53,630 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:03:53,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:03:53,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1325047018, now seen corresponding path program 1 times [2024-11-07 16:03:53,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:03:53,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878513988] [2024-11-07 16:03:53,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 16:03:53,632 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:03:53,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:03:53,636 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:03:53,638 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:03:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 16:03:54,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 16:03:54,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:03:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 95 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-07 16:03:54,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:03:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-07 16:03:55,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:03:55,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878513988] [2024-11-07 16:03:55,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878513988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:03:55,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:03:55,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-07 16:03:55,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284927872] [2024-11-07 16:03:55,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:03:55,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 16:03:55,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:03:55,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 16:03:55,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-07 16:03:55,103 INFO L87 Difference]: Start difference. First operand 1944 states and 2447 transitions. Second operand has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 16:03:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:03:57,473 INFO L93 Difference]: Finished difference Result 2079 states and 2662 transitions. [2024-11-07 16:03:57,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-07 16:03:57,474 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2024-11-07 16:03:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:03:57,480 INFO L225 Difference]: With dead ends: 2079 [2024-11-07 16:03:57,480 INFO L226 Difference]: Without dead ends: 2049 [2024-11-07 16:03:57,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 16:03:57,481 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 14 mSDsluCounter, 3006 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3283 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 16:03:57,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3283 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 16:03:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2024-11-07 16:03:57,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2034. [2024-11-07 16:03:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1940 states have (on average 1.261340206185567) internal successors, (2447), 1954 states have internal predecessors, (2447), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-07 16:03:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2567 transitions. [2024-11-07 16:03:57,518 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2567 transitions. Word has length 126 [2024-11-07 16:03:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:03:57,518 INFO L471 AbstractCegarLoop]: Abstraction has 2034 states and 2567 transitions. [2024-11-07 16:03:57,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 16:03:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2567 transitions. [2024-11-07 16:03:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-07 16:03:57,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:03:57,520 INFO L215 NwaCegarLoop]: trace histogram [33, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 16:03:57,537 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 (13)] Ended with exit code 0 [2024-11-07 16:03:57,720 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:03:57,720 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:03:57,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:03:57,721 INFO L85 PathProgramCache]: Analyzing trace with hash -951160330, now seen corresponding path program 2 times [2024-11-07 16:03:57,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:03:57,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448624162] [2024-11-07 16:03:57,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 16:03:57,722 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:03:57,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:03:57,723 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:03:57,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 (14)] Waiting until timeout for monitored process [2024-11-07 16:03:58,957 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 16:03:58,957 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:03:58,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-07 16:03:58,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:03:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 317 proven. 253 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-07 16:03:59,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:04:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-07 16:04:01,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:04:01,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448624162] [2024-11-07 16:04:01,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448624162] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:04:01,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:04:01,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-07 16:04:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236060377] [2024-11-07 16:04:01,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:04:01,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-07 16:04:01,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:04:01,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-07 16:04:01,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-07 16:04:01,380 INFO L87 Difference]: Start difference. First operand 2034 states and 2567 transitions. Second operand has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 16:04:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:04:12,734 INFO L93 Difference]: Finished difference Result 2249 states and 2942 transitions. [2024-11-07 16:04:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-07 16:04:12,736 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 144 [2024-11-07 16:04:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:04:12,743 INFO L225 Difference]: With dead ends: 2249 [2024-11-07 16:04:12,743 INFO L226 Difference]: Without dead ends: 2219 [2024-11-07 16:04:12,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-07 16:04:12,746 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 26 mSDsluCounter, 7366 mSDsCounter, 0 mSdLazyCounter, 2014 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7643 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 16:04:12,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7643 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2014 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 16:04:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2024-11-07 16:04:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2204. [2024-11-07 16:04:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 2110 states have (on average 1.2687203791469195) internal successors, (2677), 2124 states have internal predecessors, (2677), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-07 16:04:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 2797 transitions. [2024-11-07 16:04:12,789 INFO L78 Accepts]: Start accepts. Automaton has 2204 states and 2797 transitions. Word has length 144 [2024-11-07 16:04:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:04:12,789 INFO L471 AbstractCegarLoop]: Abstraction has 2204 states and 2797 transitions. [2024-11-07 16:04:12,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 50 states have internal predecessors, (142), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-07 16:04:12,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2797 transitions. [2024-11-07 16:04:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-07 16:04:12,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:04:12,791 INFO L215 NwaCegarLoop]: trace histogram [67, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 16:04:12,820 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:04:12,991 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:04:12,992 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:04:12,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:04:12,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1179384982, now seen corresponding path program 3 times [2024-11-07 16:04:12,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:04:12,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135241559] [2024-11-07 16:04:12,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 16:04:12,993 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:04:12,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:04:12,996 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:04:12,997 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:04:14,070 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-07 16:04:14,070 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:04:14,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 16:04:14,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:04:14,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2024-11-07 16:04:14,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 334 [2024-11-07 16:04:14,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 214 [2024-11-07 16:04:14,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:04:14,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 94 [2024-11-07 16:04:15,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 116 [2024-11-07 16:04:15,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 68 [2024-11-07 16:04:15,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:04:15,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 20 [2024-11-07 16:04:16,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-07 16:04:16,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 106 [2024-11-07 16:04:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2024-11-07 16:04:16,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 16:04:16,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:04:16,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135241559] [2024-11-07 16:04:16,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135241559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 16:04:16,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 16:04:16,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-07 16:04:16,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028242900] [2024-11-07 16:04:16,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 16:04:16,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-07 16:04:16,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:04:16,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-07 16:04:16,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-07 16:04:16,330 INFO L87 Difference]: Start difference. First operand 2204 states and 2797 transitions. Second operand has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 16:04:19,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 16:04:23,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-07 16:04:26,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-07 16:04:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:04:28,246 INFO L93 Difference]: Finished difference Result 2788 states and 3549 transitions. [2024-11-07 16:04:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 16:04:28,248 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 178 [2024-11-07 16:04:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:04:28,257 INFO L225 Difference]: With dead ends: 2788 [2024-11-07 16:04:28,257 INFO L226 Difference]: Without dead ends: 2773 [2024-11-07 16:04:28,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-07 16:04:28,258 INFO L432 NwaCegarLoop]: 338 mSDtfsCounter, 276 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-07 16:04:28,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 3171 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2024-11-07 16:04:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773 states. [2024-11-07 16:04:28,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2773 to 2467. [2024-11-07 16:04:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2364 states have (on average 1.2584602368866329) internal successors, (2975), 2379 states have internal predecessors, (2975), 62 states have call successors, (62), 36 states have call predecessors, (62), 39 states have return successors, (71), 51 states have call predecessors, (71), 58 states have call successors, (71) [2024-11-07 16:04:28,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3108 transitions. [2024-11-07 16:04:28,301 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3108 transitions. Word has length 178 [2024-11-07 16:04:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:04:28,301 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 3108 transitions. [2024-11-07 16:04:28,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 6.846153846153846) internal successors, (89), 13 states have internal predecessors, (89), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 16:04:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3108 transitions. [2024-11-07 16:04:28,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 16:04:28,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:04:28,303 INFO L215 NwaCegarLoop]: trace histogram [68, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 16:04:28,322 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 (15)] Ended with exit code 0 [2024-11-07 16:04:28,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:04:28,504 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:04:28,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:04:28,504 INFO L85 PathProgramCache]: Analyzing trace with hash 389438833, now seen corresponding path program 4 times [2024-11-07 16:04:28,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:04:28,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575073589] [2024-11-07 16:04:28,505 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 16:04:28,505 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:04:28,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:04:28,507 INFO L229 MonitoredProcess]: Starting monitored process 16 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:04:28,508 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 (16)] Waiting until timeout for monitored process [2024-11-07 16:04:30,384 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 16:04:30,384 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:04:30,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 16:04:30,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:04:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-07 16:04:30,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:04:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-07 16:04:30,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:04:30,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575073589] [2024-11-07 16:04:30,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575073589] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:04:30,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:04:30,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 16:04:30,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401929717] [2024-11-07 16:04:30,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:04:30,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 16:04:30,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:04:30,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 16:04:30,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-07 16:04:30,657 INFO L87 Difference]: Start difference. First operand 2467 states and 3108 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 16:04:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 16:04:30,845 INFO L93 Difference]: Finished difference Result 2497 states and 3128 transitions. [2024-11-07 16:04:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 16:04:30,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 179 [2024-11-07 16:04:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 16:04:30,852 INFO L225 Difference]: With dead ends: 2497 [2024-11-07 16:04:30,852 INFO L226 Difference]: Without dead ends: 2467 [2024-11-07 16:04:30,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-07 16:04:30,853 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 4 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 16:04:30,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1107 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 16:04:30,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2024-11-07 16:04:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2467. [2024-11-07 16:04:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2364 states have (on average 1.252115059221658) internal successors, (2960), 2379 states have internal predecessors, (2960), 62 states have call successors, (62), 36 states have call predecessors, (62), 39 states have return successors, (71), 51 states have call predecessors, (71), 58 states have call successors, (71) [2024-11-07 16:04:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3093 transitions. [2024-11-07 16:04:30,888 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3093 transitions. Word has length 179 [2024-11-07 16:04:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 16:04:30,888 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 3093 transitions. [2024-11-07 16:04:30,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-07 16:04:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3093 transitions. [2024-11-07 16:04:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-07 16:04:30,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 16:04:30,890 INFO L215 NwaCegarLoop]: trace histogram [71, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 16:04:30,917 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 (16)] Ended with exit code 0 [2024-11-07 16:04:31,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:04:31,092 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-07 16:04:31,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 16:04:31,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1581964118, now seen corresponding path program 5 times [2024-11-07 16:04:31,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 16:04:31,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624479778] [2024-11-07 16:04:31,093 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 16:04:31,093 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:04:31,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 16:04:31,096 INFO L229 MonitoredProcess]: Starting monitored process 17 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:04: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 (17)] Waiting until timeout for monitored process [2024-11-07 16:04:49,171 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-11-07 16:04:49,171 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 16:04:49,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 16:04:49,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 16:04:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1446 proven. 276 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2024-11-07 16:04:49,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 16:04:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1083 proven. 399 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2024-11-07 16:04:52,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 16:04:52,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624479778] [2024-11-07 16:04:52,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624479778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 16:04:52,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 16:04:52,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-07 16:04:52,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778224089] [2024-11-07 16:04:52,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 16:04:52,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-07 16:04:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 16:04:52,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-07 16:04:52,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-07 16:04:52,610 INFO L87 Difference]: Start difference. First operand 2467 states and 3093 transitions. Second operand has 52 states, 52 states have (on average 2.769230769230769) internal successors, (144), 52 states have internal predecessors, (144), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)