./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:58:12,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:58:12,365 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-24 15:58:12,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:58:12,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:58:12,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:58:12,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:58:12,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:58:12,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:58:12,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:58:12,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:58:12,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:58:12,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:58:12,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:58:12,395 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:58:12,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:58:12,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:58:12,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:58:12,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:58:12,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:58:12,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:58:12,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:58:12,401 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:58:12,401 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:58:12,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:58:12,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:58:12,402 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:58:12,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:58:12,402 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:58:12,402 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:58:12,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:58:12,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:58:12,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:58:12,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:58:12,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:58:12,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:58:12,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:58:12,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:58:12,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:58:12,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:58:12,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:58:12,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:58:12,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:58:12,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:58:12,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:58:12,408 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 [2024-10-24 15:58:12,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:58:12,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:58:12,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:58:12,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:58:12,655 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:58:12,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2024-10-24 15:58:14,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:58:14,352 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:58:14,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2024-10-24 15:58:14,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a905fd74/ab432850e3bd40a3af8e072006d47c2b/FLAG9682b3e8a [2024-10-24 15:58:14,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a905fd74/ab432850e3bd40a3af8e072006d47c2b [2024-10-24 15:58:14,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:58:14,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:58:14,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:58:14,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:58:14,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:58:14,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:58:14" (1/1) ... [2024-10-24 15:58:14,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58fa01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:14, skipping insertion in model container [2024-10-24 15:58:14,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:58:14" (1/1) ... [2024-10-24 15:58:14,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:58:14,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:58:15,010 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-10-24 15:58:15,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@276b3ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:15, skipping insertion in model container [2024-10-24 15:58:15,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:58:15,011 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 15:58:15,013 INFO L158 Benchmark]: Toolchain (without parser) took 617.22ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 85.0MB in the beginning and 190.1MB in the end (delta: -105.1MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-10-24 15:58:15,013 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:58:15,014 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.67ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 84.8MB in the beginning and 190.1MB in the end (delta: -105.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-10-24 15:58:15,015 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.23ms. Allocated memory is still 159.4MB. Free memory is still 110.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 611.67ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 84.8MB in the beginning and 190.1MB in the end (delta: -105.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:58:16,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:58:16,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-24 15:58:16,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:58:16,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:58:16,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:58:16,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:58:16,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:58:16,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:58:16,969 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:58:16,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:58:16,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:58:16,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:58:16,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:58:16,971 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:58:16,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:58:16,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:58:16,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:58:16,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:58:16,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:58:16,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:58:16,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:58:16,977 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:58:16,977 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:58:16,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:58:16,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:58:16,977 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:58:16,977 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 15:58:16,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:58:16,978 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 15:58:16,978 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:58:16,978 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:58:16,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:58:16,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:58:16,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:58:16,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:58:16,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:58:16,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:58:16,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:58:16,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:58:16,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:58:16,989 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 15:58:16,989 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 15:58:16,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:58:16,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:58:16,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:58:16,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:58:16,990 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 15:58:16,990 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 [2024-10-24 15:58:17,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:58:17,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:58:17,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:58:17,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:58:17,338 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:58:17,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2024-10-24 15:58:18,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:58:19,139 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:58:19,141 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2024-10-24 15:58:19,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e17c8409c/7212712b68aa401c8d587b302f96cf10/FLAG15df102e5 [2024-10-24 15:58:19,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e17c8409c/7212712b68aa401c8d587b302f96cf10 [2024-10-24 15:58:19,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:58:19,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:58:19,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:58:19,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:58:19,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:58:19,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:58:19" (1/1) ... [2024-10-24 15:58:19,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44890ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:19, skipping insertion in model container [2024-10-24 15:58:19,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:58:19" (1/1) ... [2024-10-24 15:58:19,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:58:19,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:58:20,003 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 15:58:20,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:58:20,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:58:20,089 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:58:20,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:58:20,254 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:58:20,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20 WrapperNode [2024-10-24 15:58:20,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:58:20,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:58:20,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:58:20,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:58:20,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20" (1/1) ... [2024-10-24 15:58:20,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20" (1/1) ... [2024-10-24 15:58:20,345 INFO L138 Inliner]: procedures = 285, calls = 290, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1062 [2024-10-24 15:58:20,346 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:58:20,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:58:20,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:58:20,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:58:20,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20" (1/1) ... [2024-10-24 15:58:20,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20" (1/1) ... [2024-10-24 15:58:20,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20" (1/1) ... [2024-10-24 15:58:20,430 INFO L175 MemorySlicer]: Split 259 memory accesses to 4 slices as follows [2, 3, 220, 34]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 2, 49, 4]. [2024-10-24 15:58:20,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20" (1/1) ... [2024-10-24 15:58:20,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20" (1/1) ... [2024-10-24 15:58:20,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20" (1/1) ... [2024-10-24 15:58:20,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20" (1/1) ... [2024-10-24 15:58:20,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20" (1/1) ... [2024-10-24 15:58:20,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20" (1/1) ... [2024-10-24 15:58:20,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:58:20,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:58:20,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:58:20,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:58:20,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20" (1/1) ... [2024-10-24 15:58:20,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:58:20,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:58:20,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 15:58:20,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 15:58:20,612 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-24 15:58:20,612 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 15:58:20,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-24 15:58:20,615 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 15:58:20,615 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-24 15:58:20,615 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-24 15:58:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 15:58:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 15:58:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 15:58:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 15:58:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-24 15:58:20,616 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-24 15:58:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:58:20,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:58:20,833 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:58:20,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:58:26,366 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-24 15:58:26,366 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:58:26,425 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:58:26,425 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-24 15:58:26,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:58:26 BoogieIcfgContainer [2024-10-24 15:58:26,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:58:26,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:58:26,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:58:26,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:58:26,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:58:19" (1/3) ... [2024-10-24 15:58:26,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b28e1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:58:26, skipping insertion in model container [2024-10-24 15:58:26,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:20" (2/3) ... [2024-10-24 15:58:26,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b28e1fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:58:26, skipping insertion in model container [2024-10-24 15:58:26,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:58:26" (3/3) ... [2024-10-24 15:58:26,432 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-1.i [2024-10-24 15:58:26,444 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:58:26,445 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 15:58:26,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:58:26,484 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;@4ad6b78e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:58:26,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 15:58:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 200 states have (on average 1.635) internal successors, (327), 205 states have internal predecessors, (327), 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-10-24 15:58:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 15:58:26,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:26,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:58:26,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:26,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1518545934, now seen corresponding path program 1 times [2024-10-24 15:58:26,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:26,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263599271] [2024-10-24 15:58:26,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:26,513 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-10-24 15:58:26,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:26,515 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-10-24 15:58:26,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:58:26,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 15:58:26,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:58:26,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:58:26,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:26,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263599271] [2024-10-24 15:58:26,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263599271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:58:26,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:58:26,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:58:26,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762624430] [2024-10-24 15:58:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:58:26,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 15:58:26,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:26,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 15:58:26,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:58:26,733 INFO L87 Difference]: Start difference. First operand has 225 states, 200 states have (on average 1.635) internal successors, (327), 205 states have internal predecessors, (327), 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.0) internal successors, (8), 2 states have internal predecessors, (8), 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-10-24 15:58:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:26,790 INFO L93 Difference]: Finished difference Result 220 states and 285 transitions. [2024-10-24 15:58:26,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 15:58:26,792 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2024-10-24 15:58:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:26,799 INFO L225 Difference]: With dead ends: 220 [2024-10-24 15:58:26,799 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 15:58:26,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-10-24 15:58:26,803 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:26,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 15:58:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 15:58:26,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-24 15:58:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 201 states have internal predecessors, (254), 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-10-24 15:58:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 284 transitions. [2024-10-24 15:58:26,864 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 284 transitions. Word has length 9 [2024-10-24 15:58:26,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:26,864 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 284 transitions. [2024-10-24 15:58:26,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-10-24 15:58:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 284 transitions. [2024-10-24 15:58:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 15:58:26,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:26,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:58:26,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:27,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-10-24 15:58:27,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:27,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:27,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1131489963, now seen corresponding path program 1 times [2024-10-24 15:58:27,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:27,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636634394] [2024-10-24 15:58:27,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:27,069 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-10-24 15:58:27,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:27,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-10-24 15:58:27,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:58:27,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:58:27,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:58:27,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:58:27,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:27,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636634394] [2024-10-24 15:58:27,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636634394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:58:27,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:58:27,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:58:27,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367690681] [2024-10-24 15:58:27,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:58:27,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:58:27,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:27,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:58:27,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:58:27,321 INFO L87 Difference]: Start difference. First operand 219 states and 284 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-10-24 15:58:28,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 15:58:30,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 15:58:30,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:30,843 INFO L93 Difference]: Finished difference Result 333 states and 434 transitions. [2024-10-24 15:58:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:58:30,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2024-10-24 15:58:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:30,846 INFO L225 Difference]: With dead ends: 333 [2024-10-24 15:58:30,846 INFO L226 Difference]: Without dead ends: 333 [2024-10-24 15:58:30,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-10-24 15:58:30,847 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 137 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:30,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 749 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-24 15:58:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-24 15:58:30,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2024-10-24 15:58:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 306 states have (on average 1.303921568627451) internal successors, (399), 311 states have internal predecessors, (399), 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-10-24 15:58:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 429 transitions. [2024-10-24 15:58:30,870 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 429 transitions. Word has length 11 [2024-10-24 15:58:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:30,870 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 429 transitions. [2024-10-24 15:58:30,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-10-24 15:58:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 429 transitions. [2024-10-24 15:58:30,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 15:58:30,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:30,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:58:30,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-24 15:58:31,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-10-24 15:58:31,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:31,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2059992344, now seen corresponding path program 1 times [2024-10-24 15:58:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:31,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186086470] [2024-10-24 15:58:31,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:31,073 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-10-24 15:58:31,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:31,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-10-24 15:58:31,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:58:31,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:58:31,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:31,367 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:58:31,368 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:58:31,369 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:58:31,379 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-10-24 15:58:31,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:58:31,463 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-10-24 15:58:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:58:31,486 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:58:31,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:31,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186086470] [2024-10-24 15:58:31,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186086470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:58:31,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:58:31,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:58:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345576783] [2024-10-24 15:58:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:58:31,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:58:31,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:31,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:58:31,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:58:31,488 INFO L87 Difference]: Start difference. First operand 329 states and 429 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-24 15:58:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:32,012 INFO L93 Difference]: Finished difference Result 506 states and 666 transitions. [2024-10-24 15:58:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:58:32,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-10-24 15:58:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:32,015 INFO L225 Difference]: With dead ends: 506 [2024-10-24 15:58:32,015 INFO L226 Difference]: Without dead ends: 506 [2024-10-24 15:58:32,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-10-24 15:58:32,016 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 227 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:32,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 828 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 15:58:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-10-24 15:58:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 328. [2024-10-24 15:58:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 305 states have (on average 1.301639344262295) internal successors, (397), 310 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-10-24 15:58:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 427 transitions. [2024-10-24 15:58:32,030 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 427 transitions. Word has length 14 [2024-10-24 15:58:32,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:32,030 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 427 transitions. [2024-10-24 15:58:32,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-24 15:58:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 427 transitions. [2024-10-24 15:58:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 15:58:32,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:32,035 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] [2024-10-24 15:58:32,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:32,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-10-24 15:58:32,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:32,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash 518278030, now seen corresponding path program 1 times [2024-10-24 15:58:32,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:32,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129051931] [2024-10-24 15:58:32,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:32,239 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-10-24 15:58:32,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:32,241 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-10-24 15:58:32,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:58:32,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:58:32,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:58:32,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:58:32,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:32,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129051931] [2024-10-24 15:58:32,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129051931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:58:32,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:58:32,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:58:32,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397536587] [2024-10-24 15:58:32,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:58:32,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:58:32,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:32,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:58:32,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:58:32,514 INFO L87 Difference]: Start difference. First operand 328 states and 427 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-24 15:58:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:32,645 INFO L93 Difference]: Finished difference Result 334 states and 417 transitions. [2024-10-24 15:58:32,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:58:32,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 48 [2024-10-24 15:58:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:32,647 INFO L225 Difference]: With dead ends: 334 [2024-10-24 15:58:32,648 INFO L226 Difference]: Without dead ends: 334 [2024-10-24 15:58:32,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-10-24 15:58:32,650 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 30 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:32,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 724 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:58:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-24 15:58:32,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-10-24 15:58:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 311 states have (on average 1.2443729903536977) internal successors, (387), 316 states have internal predecessors, (387), 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-10-24 15:58:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 417 transitions. [2024-10-24 15:58:32,671 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 417 transitions. Word has length 48 [2024-10-24 15:58:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:32,673 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 417 transitions. [2024-10-24 15:58:32,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-10-24 15:58:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 417 transitions. [2024-10-24 15:58:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 15:58:32,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:32,677 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] [2024-10-24 15:58:32,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-24 15:58:32,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-10-24 15:58:32,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:32,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:32,878 INFO L85 PathProgramCache]: Analyzing trace with hash 972862082, now seen corresponding path program 1 times [2024-10-24 15:58:32,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:32,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651169339] [2024-10-24 15:58:32,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:32,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-10-24 15:58:32,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:32,884 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-10-24 15:58:32,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:58:33,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:58:33,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:58:33,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:58:33,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:33,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651169339] [2024-10-24 15:58:33,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651169339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:58:33,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:58:33,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 15:58:33,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044381050] [2024-10-24 15:58:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:58:33,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:58:33,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:33,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:58:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:58:33,181 INFO L87 Difference]: Start difference. First operand 334 states and 417 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-10-24 15:58:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:33,400 INFO L93 Difference]: Finished difference Result 343 states and 426 transitions. [2024-10-24 15:58:33,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:58:33,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 48 [2024-10-24 15:58:33,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:33,403 INFO L225 Difference]: With dead ends: 343 [2024-10-24 15:58:33,403 INFO L226 Difference]: Without dead ends: 343 [2024-10-24 15:58:33,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 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-10-24 15:58:33,404 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 8 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:33,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1300 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:58:33,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-24 15:58:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2024-10-24 15:58:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 317 states have (on average 1.2429022082018928) internal successors, (394), 323 states have internal predecessors, (394), 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-10-24 15:58:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 426 transitions. [2024-10-24 15:58:33,412 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 426 transitions. Word has length 48 [2024-10-24 15:58:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:33,412 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 426 transitions. [2024-10-24 15:58:33,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-10-24 15:58:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 426 transitions. [2024-10-24 15:58:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 15:58:33,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:33,414 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] [2024-10-24 15:58:33,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-24 15:58:33,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-10-24 15:58:33,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:33,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:33,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1058188914, now seen corresponding path program 1 times [2024-10-24 15:58:33,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:33,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795429157] [2024-10-24 15:58:33,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:33,620 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-10-24 15:58:33,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:33,622 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-10-24 15:58:33,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:58:33,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:58:33,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:58:34,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:58:34,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:34,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795429157] [2024-10-24 15:58:34,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795429157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:58:34,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:58:34,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:58:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011802905] [2024-10-24 15:58:34,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:58:34,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:58:34,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:34,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:58:34,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:58:34,086 INFO L87 Difference]: Start difference. First operand 343 states and 426 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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-10-24 15:58:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:34,350 INFO L93 Difference]: Finished difference Result 349 states and 434 transitions. [2024-10-24 15:58:34,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 15:58:34,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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 60 [2024-10-24 15:58:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:34,354 INFO L225 Difference]: With dead ends: 349 [2024-10-24 15:58:34,354 INFO L226 Difference]: Without dead ends: 349 [2024-10-24 15:58:34,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 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-10-24 15:58:34,355 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 17 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:34,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 946 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:58:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-24 15:58:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2024-10-24 15:58:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 318 states have (on average 1.2421383647798743) internal successors, (395), 325 states have internal predecessors, (395), 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-10-24 15:58:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 430 transitions. [2024-10-24 15:58:34,363 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 430 transitions. Word has length 60 [2024-10-24 15:58:34,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:34,363 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 430 transitions. [2024-10-24 15:58:34,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 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-10-24 15:58:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 430 transitions. [2024-10-24 15:58:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 15:58:34,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:34,365 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] [2024-10-24 15:58:34,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:34,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-10-24 15:58:34,570 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:34,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:34,570 INFO L85 PathProgramCache]: Analyzing trace with hash -356355389, now seen corresponding path program 1 times [2024-10-24 15:58:34,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:34,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176510410] [2024-10-24 15:58:34,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:34,571 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-10-24 15:58:34,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:34,575 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-10-24 15:58:34,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:58:34,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:58:34,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:58:34,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:58:34,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:34,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176510410] [2024-10-24 15:58:34,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176510410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:58:34,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:58:34,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:58:34,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201056680] [2024-10-24 15:58:34,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:58:34,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:58:34,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:34,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:58:34,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:58:34,929 INFO L87 Difference]: Start difference. First operand 346 states and 430 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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-10-24 15:58:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:35,022 INFO L93 Difference]: Finished difference Result 348 states and 433 transitions. [2024-10-24 15:58:35,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:58:35,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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 65 [2024-10-24 15:58:35,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:35,025 INFO L225 Difference]: With dead ends: 348 [2024-10-24 15:58:35,025 INFO L226 Difference]: Without dead ends: 348 [2024-10-24 15:58:35,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 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-10-24 15:58:35,026 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:35,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 784 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:58:35,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-24 15:58:35,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-10-24 15:58:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 319 states have (on average 1.244514106583072) internal successors, (397), 327 states have internal predecessors, (397), 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-10-24 15:58:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 433 transitions. [2024-10-24 15:58:35,033 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 433 transitions. Word has length 65 [2024-10-24 15:58:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:35,034 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 433 transitions. [2024-10-24 15:58:35,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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-10-24 15:58:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 433 transitions. [2024-10-24 15:58:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 15:58:35,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:35,035 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] [2024-10-24 15:58:35,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 15:58:35,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-10-24 15:58:35,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:35,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:35,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1848689150, now seen corresponding path program 1 times [2024-10-24 15:58:35,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:35,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059615651] [2024-10-24 15:58:35,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:35,241 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-10-24 15:58:35,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:35,243 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-10-24 15:58:35,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:58:35,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:58:35,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:58:35,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:58:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:58:35,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:35,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059615651] [2024-10-24 15:58:35,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059615651] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:58:35,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:58:35,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 15:58:35,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276608868] [2024-10-24 15:58:35,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:58:35,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:58:35,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:35,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:58:35,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:58:35,677 INFO L87 Difference]: Start difference. First operand 348 states and 433 transitions. Second operand has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 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-10-24 15:58:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:35,850 INFO L93 Difference]: Finished difference Result 357 states and 447 transitions. [2024-10-24 15:58:35,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 15:58:35,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 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 66 [2024-10-24 15:58:35,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:35,852 INFO L225 Difference]: With dead ends: 357 [2024-10-24 15:58:35,852 INFO L226 Difference]: Without dead ends: 357 [2024-10-24 15:58:35,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 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-10-24 15:58:35,853 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 5 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:35,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 781 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:58:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-24 15:58:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 356. [2024-10-24 15:58:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 326 states have (on average 1.2576687116564418) internal successors, (410), 334 states have internal predecessors, (410), 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-10-24 15:58:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 446 transitions. [2024-10-24 15:58:35,861 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 446 transitions. Word has length 66 [2024-10-24 15:58:35,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:35,861 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 446 transitions. [2024-10-24 15:58:35,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 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-10-24 15:58:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 446 transitions. [2024-10-24 15:58:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 15:58:35,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:35,862 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] [2024-10-24 15:58:35,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 15:58:36,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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-10-24 15:58:36,064 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:36,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:36,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2071587203, now seen corresponding path program 2 times [2024-10-24 15:58:36,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:36,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911926463] [2024-10-24 15:58:36,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:58:36,065 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-10-24 15:58:36,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:36,067 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/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-10-24 15:58:36,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:36,562 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:58:36,563 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:58:36,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 15:58:36,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:58:36,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:58:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:58:36,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:36,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911926463] [2024-10-24 15:58:36,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911926463] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:58:36,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:58:36,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 15:58:36,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208328175] [2024-10-24 15:58:36,903 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:58:36,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 15:58:36,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:36,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 15:58:36,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 15:58:36,904 INFO L87 Difference]: Start difference. First operand 356 states and 446 transitions. Second operand has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 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-10-24 15:58:37,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:37,700 INFO L93 Difference]: Finished difference Result 368 states and 465 transitions. [2024-10-24 15:58:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 15:58:37,701 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 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 69 [2024-10-24 15:58:37,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:37,705 INFO L225 Difference]: With dead ends: 368 [2024-10-24 15:58:37,705 INFO L226 Difference]: Without dead ends: 366 [2024-10-24 15:58:37,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-24 15:58:37,708 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 8 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:37,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1558 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 15:58:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-24 15:58:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2024-10-24 15:58:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 335 states have (on average 1.2597014925373133) internal successors, (422), 343 states have internal predecessors, (422), 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-10-24 15:58:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 458 transitions. [2024-10-24 15:58:37,723 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 458 transitions. Word has length 69 [2024-10-24 15:58:37,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:37,723 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 458 transitions. [2024-10-24 15:58:37,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 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-10-24 15:58:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 458 transitions. [2024-10-24 15:58:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 15:58:37,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:37,724 INFO L215 NwaCegarLoop]: trace histogram [10, 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] [2024-10-24 15:58:37,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-24 15:58:37,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/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-10-24 15:58:37,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:37,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1354008483, now seen corresponding path program 3 times [2024-10-24 15:58:37,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:37,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84935328] [2024-10-24 15:58:37,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:58:37,930 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-10-24 15:58:37,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:37,933 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/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-10-24 15:58:37,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:38,459 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 15:58:38,459 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:58:38,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 15:58:38,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 15:58:38,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:58:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 15:58:38,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:38,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84935328] [2024-10-24 15:58:38,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84935328] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:58:38,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:58:38,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-24 15:58:38,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619593436] [2024-10-24 15:58:38,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:58:38,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 15:58:38,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:38,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 15:58:38,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-24 15:58:38,890 INFO L87 Difference]: Start difference. First operand 365 states and 458 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 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-10-24 15:58:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:40,350 INFO L93 Difference]: Finished difference Result 2684 states and 3423 transitions. [2024-10-24 15:58:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-24 15:58:40,350 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 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 75 [2024-10-24 15:58:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:40,357 INFO L225 Difference]: With dead ends: 2684 [2024-10-24 15:58:40,357 INFO L226 Difference]: Without dead ends: 2684 [2024-10-24 15:58:40,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 147 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-10-24 15:58:40,358 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 3414 mSDsluCounter, 3841 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3440 SdHoareTripleChecker+Valid, 4565 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:40,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3440 Valid, 4565 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 15:58:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2024-10-24 15:58:40,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 1858. [2024-10-24 15:58:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1764 states have (on average 1.2704081632653061) internal successors, (2241), 1778 states have internal predecessors, (2241), 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-10-24 15:58:40,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2361 transitions. [2024-10-24 15:58:40,399 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2361 transitions. Word has length 75 [2024-10-24 15:58:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:40,399 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2361 transitions. [2024-10-24 15:58:40,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 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-10-24 15:58:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2361 transitions. [2024-10-24 15:58:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 15:58:40,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:40,404 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-10-24 15:58:40,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-24 15:58:40,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/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-10-24 15:58:40,605 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:40,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash 445728410, now seen corresponding path program 1 times [2024-10-24 15:58:40,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:40,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895020642] [2024-10-24 15:58:40,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:40,606 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-10-24 15:58:40,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:40,607 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/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-10-24 15:58:40,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:58:41,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 15:58:41,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 74 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 15:58:41,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:58:42,233 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 15:58:42,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:42,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895020642] [2024-10-24 15:58:42,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895020642] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:58:42,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:58:42,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 15:58:42,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307076910] [2024-10-24 15:58:42,234 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:58:42,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 15:58:42,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:42,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 15:58:42,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 15:58:42,236 INFO L87 Difference]: Start difference. First operand 1858 states and 2361 transitions. Second operand has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 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-10-24 15:58:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:45,746 INFO L93 Difference]: Finished difference Result 1963 states and 2546 transitions. [2024-10-24 15:58:45,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 15:58:45,750 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 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 111 [2024-10-24 15:58:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:45,757 INFO L225 Difference]: With dead ends: 1963 [2024-10-24 15:58:45,757 INFO L226 Difference]: Without dead ends: 1953 [2024-10-24 15:58:45,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 15:58:45,759 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 13 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3371 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:45,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3371 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 15:58:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2024-10-24 15:58:45,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1948. [2024-10-24 15:58:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1854 states have (on average 1.273462783171521) internal successors, (2361), 1868 states have internal predecessors, (2361), 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-10-24 15:58:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2481 transitions. [2024-10-24 15:58:45,805 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2481 transitions. Word has length 111 [2024-10-24 15:58:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:45,805 INFO L471 AbstractCegarLoop]: Abstraction has 1948 states and 2481 transitions. [2024-10-24 15:58:45,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 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-10-24 15:58:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2481 transitions. [2024-10-24 15:58:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 15:58:45,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:45,807 INFO L215 NwaCegarLoop]: trace histogram [33, 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] [2024-10-24 15:58:45,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:46,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/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-10-24 15:58:46,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:46,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash -435129094, now seen corresponding path program 2 times [2024-10-24 15:58:46,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:46,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376868653] [2024-10-24 15:58:46,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:58:46,009 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-10-24 15:58:46,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:46,012 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/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-10-24 15:58:46,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:46,292 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:58:46,292 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:58:46,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 15:58:46,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:46,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:58:46,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:58:46,308 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:58:46,309 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-10-24 15:58:46,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:58:46,347 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-10-24 15:58:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2024-10-24 15:58:46,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:58:46,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:46,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376868653] [2024-10-24 15:58:46,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376868653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:58:46,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:58:46,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:58:46,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507198325] [2024-10-24 15:58:46,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:58:46,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:58:46,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:46,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:58:46,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:58:46,362 INFO L87 Difference]: Start difference. First operand 1948 states and 2481 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-10-24 15:58:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:58:46,917 INFO L93 Difference]: Finished difference Result 2700 states and 3483 transitions. [2024-10-24 15:58:46,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:58:46,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 129 [2024-10-24 15:58:46,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:58:46,925 INFO L225 Difference]: With dead ends: 2700 [2024-10-24 15:58:46,925 INFO L226 Difference]: Without dead ends: 2700 [2024-10-24 15:58:46,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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-10-24 15:58:46,926 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 212 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 15:58:46,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 729 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 15:58:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2024-10-24 15:58:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 1960. [2024-10-24 15:58:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1866 states have (on average 1.2717041800643087) internal successors, (2373), 1880 states have internal predecessors, (2373), 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-10-24 15:58:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2493 transitions. [2024-10-24 15:58:46,967 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2493 transitions. Word has length 129 [2024-10-24 15:58:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:58:46,967 INFO L471 AbstractCegarLoop]: Abstraction has 1960 states and 2493 transitions. [2024-10-24 15:58:46,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-10-24 15:58:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2493 transitions. [2024-10-24 15:58:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 15:58:46,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:58:46,968 INFO L215 NwaCegarLoop]: trace histogram [33, 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] [2024-10-24 15:58:46,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:47,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/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-10-24 15:58:47,170 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:58:47,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:58:47,171 INFO L85 PathProgramCache]: Analyzing trace with hash -427519190, now seen corresponding path program 1 times [2024-10-24 15:58:47,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:58:47,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204909136] [2024-10-24 15:58:47,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:58:47,172 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-10-24 15:58:47,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:58:47,175 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/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-10-24 15:58:47,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:58:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:58:47,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 15:58:47,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:58:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 311 proven. 253 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 15:58:48,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:58:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 554 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-24 15:58:50,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:58:50,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204909136] [2024-10-24 15:58:50,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204909136] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:58:50,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:58:50,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 15:58:50,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257063059] [2024-10-24 15:58:50,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:58:50,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 15:58:50,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:58:50,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 15:58:50,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 15:58:50,948 INFO L87 Difference]: Start difference. First operand 1960 states and 2493 transitions. Second operand has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 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-10-24 15:59:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:04,872 INFO L93 Difference]: Finished difference Result 2145 states and 2838 transitions. [2024-10-24 15:59:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-24 15:59:04,872 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 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 133 [2024-10-24 15:59:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:04,878 INFO L225 Difference]: With dead ends: 2145 [2024-10-24 15:59:04,878 INFO L226 Difference]: Without dead ends: 2135 [2024-10-24 15:59:04,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-24 15:59:04,882 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 25 mSDsluCounter, 5957 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6220 SdHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:04,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6220 Invalid, 2162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2121 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 15:59:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2024-10-24 15:59:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 2130. [2024-10-24 15:59:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 2036 states have (on average 1.2784872298624754) internal successors, (2603), 2050 states have internal predecessors, (2603), 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-10-24 15:59:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2723 transitions. [2024-10-24 15:59:04,917 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 2723 transitions. Word has length 133 [2024-10-24 15:59:04,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:04,918 INFO L471 AbstractCegarLoop]: Abstraction has 2130 states and 2723 transitions. [2024-10-24 15:59:04,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 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-10-24 15:59:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 2723 transitions. [2024-10-24 15:59:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 15:59:04,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:04,920 INFO L215 NwaCegarLoop]: trace histogram [67, 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] [2024-10-24 15:59:04,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:59:05,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/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-10-24 15:59:05,121 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:05,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:05,121 INFO L85 PathProgramCache]: Analyzing trace with hash -418142070, now seen corresponding path program 2 times [2024-10-24 15:59:05,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:05,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102601580] [2024-10-24 15:59:05,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:59:05,122 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-10-24 15:59:05,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:05,125 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/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-10-24 15:59:05,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:59:06,945 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:59:06,945 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:59:06,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 1415 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 15:59:07,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:59:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2433 backedges. 1162 proven. 276 refuted. 0 times theorem prover too weak. 995 trivial. 0 not checked. [2024-10-24 15:59:07,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:59:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2433 backedges. 1081 proven. 301 refuted. 0 times theorem prover too weak. 1051 trivial. 0 not checked. [2024-10-24 15:59:10,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:59:10,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102601580] [2024-10-24 15:59:10,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102601580] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:59:10,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:59:10,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-24 15:59:10,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720204454] [2024-10-24 15:59:10,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:59:10,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-24 15:59:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:59:10,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-24 15:59:10,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 15:59:10,806 INFO L87 Difference]: Start difference. First operand 2130 states and 2723 transitions. Second operand has 52 states, 50 states have (on average 2.62) internal successors, (131), 52 states have internal predecessors, (131), 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) [2024-10-24 15:59:30,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:30,242 INFO L93 Difference]: Finished difference Result 2265 states and 2983 transitions. [2024-10-24 15:59:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-24 15:59:30,243 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.62) internal successors, (131), 52 states have internal predecessors, (131), 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) Word has length 167 [2024-10-24 15:59:30,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:30,248 INFO L225 Difference]: With dead ends: 2265 [2024-10-24 15:59:30,248 INFO L226 Difference]: Without dead ends: 2265 [2024-10-24 15:59:30,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-24 15:59:30,251 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 27 mSDsluCounter, 6475 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6737 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:30,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6737 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 15:59:30,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2024-10-24 15:59:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2255. [2024-10-24 15:59:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 2161 states have (on average 1.3202221193891717) internal successors, (2853), 2175 states have internal predecessors, (2853), 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-10-24 15:59:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2973 transitions. [2024-10-24 15:59:30,294 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2973 transitions. Word has length 167 [2024-10-24 15:59:30,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:30,295 INFO L471 AbstractCegarLoop]: Abstraction has 2255 states and 2973 transitions. [2024-10-24 15:59:30,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.62) internal successors, (131), 52 states have internal predecessors, (131), 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) [2024-10-24 15:59:30,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2973 transitions. [2024-10-24 15:59:30,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 15:59:30,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:30,296 INFO L215 NwaCegarLoop]: trace histogram [92, 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] [2024-10-24 15:59:30,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-24 15:59:30,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/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-10-24 15:59:30,501 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:30,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1641405979, now seen corresponding path program 3 times [2024-10-24 15:59:30,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:30,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969051855] [2024-10-24 15:59:30,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:59:30,503 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-10-24 15:59:30,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:30,505 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/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-10-24 15:59:30,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:59:31,783 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 15:59:31,783 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:59:31,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 15:59:31,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:59:31,850 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-10-24 15:59:32,150 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-10-24 15:59:32,164 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-10-24 15:59:32,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:59:32,175 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-10-24 15:59:33,707 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-10-24 15:59:33,710 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-10-24 15:59:33,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:59:33,716 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-10-24 15:59:34,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:59:34,222 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-10-24 15:59:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4483 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 4379 trivial. 0 not checked. [2024-10-24 15:59:34,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:59:34,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:59:34,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969051855] [2024-10-24 15:59:34,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969051855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:59:34,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:59:34,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 15:59:34,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658513351] [2024-10-24 15:59:34,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:59:34,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 15:59:34,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:59:34,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 15:59:34,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-24 15:59:34,469 INFO L87 Difference]: Start difference. First operand 2255 states and 2973 transitions. Second operand has 16 states, 12 states have (on average 6.75) internal successors, (81), 13 states have internal predecessors, (81), 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-10-24 15:59:40,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 15:59:45,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 15:59:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:59:50,261 INFO L93 Difference]: Finished difference Result 2814 states and 3701 transitions. [2024-10-24 15:59:50,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 15:59:50,263 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 6.75) internal successors, (81), 13 states have internal predecessors, (81), 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 192 [2024-10-24 15:59:50,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:59:50,269 INFO L225 Difference]: With dead ends: 2814 [2024-10-24 15:59:50,270 INFO L226 Difference]: Without dead ends: 2809 [2024-10-24 15:59:50,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-10-24 15:59:50,270 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 371 mSDsluCounter, 2744 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:59:50,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 3017 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 605 Invalid, 1 Unknown, 0 Unchecked, 15.1s Time] [2024-10-24 15:59:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2024-10-24 15:59:50,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2504. [2024-10-24 15:59:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2401 states have (on average 1.3065389421074551) internal successors, (3137), 2416 states have internal predecessors, (3137), 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-10-24 15:59:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3270 transitions. [2024-10-24 15:59:50,298 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3270 transitions. Word has length 192 [2024-10-24 15:59:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:59:50,299 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 3270 transitions. [2024-10-24 15:59:50,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 6.75) internal successors, (81), 13 states have internal predecessors, (81), 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-10-24 15:59:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3270 transitions. [2024-10-24 15:59:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-24 15:59:50,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:59:50,300 INFO L215 NwaCegarLoop]: trace histogram [93, 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] [2024-10-24 15:59:50,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:59:50,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/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-10-24 15:59:50,501 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:59:50,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:59:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash -65008132, now seen corresponding path program 4 times [2024-10-24 15:59:50,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:59:50,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480460332] [2024-10-24 15:59:50,503 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 15:59:50,503 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-10-24 15:59:50,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:59:50,505 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/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-10-24 15:59:50,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-10-24 15:59:52,916 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 15:59:52,917 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat