./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_SFH_test5-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_SFH_test5-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 adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:00:56,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:00:56,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-24 16:00:56,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:00:56,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:00:56,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:00:56,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:00:56,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:00:56,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:00:56,573 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:00:56,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:00:56,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:00:56,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:00:56,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:00:56,575 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:00:56,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:00:56,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 16:00:56,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:00:56,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:00:56,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:00:56,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:00:56,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 16:00:56,581 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:00:56,581 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:00:56,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:00:56,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 16:00:56,582 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:00:56,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:00:56,582 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:00:56,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:00:56,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 16:00:56,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:00:56,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:00:56,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:00:56,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:00:56,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:00:56,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:00:56,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:00:56,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:00:56,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:00:56,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:00:56,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:00:56,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:00:56,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:00:56,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:00:56,589 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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2024-10-24 16:00:56,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:00:56,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:00:56,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:00:56,839 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:00:56,839 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:00:56,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-10-24 16:00:58,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:00:58,673 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:00:58,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-10-24 16:00:58,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c760c44/238dfc96dae04bbf9d308ca409bdc4d0/FLAGaead9b0ce [2024-10-24 16:00:58,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c760c44/238dfc96dae04bbf9d308ca409bdc4d0 [2024-10-24 16:00:58,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:00:58,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:00:58,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:00:58,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:00:58,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:00:58,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:00:58" (1/1) ... [2024-10-24 16:00:58,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a7b4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:00:58, skipping insertion in model container [2024-10-24 16:00:58,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:00:58" (1/1) ... [2024-10-24 16:00:59,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:00:59,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:00:59,539 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 16:00:59,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@31efedb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:00:59, skipping insertion in model container [2024-10-24 16:00:59,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:00:59,543 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 16:00:59,545 INFO L158 Benchmark]: Toolchain (without parser) took 594.34ms. Allocated memory is still 159.4MB. Free memory was 109.1MB in the beginning and 84.7MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 16:00:59,545 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 159.4MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:00:59,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.27ms. Allocated memory is still 159.4MB. Free memory was 109.1MB in the beginning and 84.7MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 16:00:59,548 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 159.4MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.27ms. Allocated memory is still 159.4MB. Free memory was 109.1MB in the beginning and 84.7MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: 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_SFH_test5-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 adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:01:01,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:01:01,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-24 16:01:01,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:01:01,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:01:01,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:01:01,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:01:01,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:01:01,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:01:01,684 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:01:01,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:01:01,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:01:01,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:01:01,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:01:01,687 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:01:01,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:01:01,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 16:01:01,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:01:01,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:01:01,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:01:01,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:01:01,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 16:01:01,694 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:01:01,694 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:01:01,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:01:01,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 16:01:01,695 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:01:01,696 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 16:01:01,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:01:01,696 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 16:01:01,696 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:01:01,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:01:01,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 16:01:01,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:01:01,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:01:01,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:01:01,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:01:01,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:01:01,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:01:01,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:01:01,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:01:01,706 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 16:01:01,707 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 16:01:01,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:01:01,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:01:01,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:01:01,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:01:01,707 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 16:01:01,708 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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2024-10-24 16:01:02,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:01:02,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:01:02,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:01:02,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:01:02,052 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:01:02,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-10-24 16:01:03,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:01:03,970 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:01:03,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2024-10-24 16:01:03,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220405d72/1dc27c04f3e04552a8e3b9fb1aae3d33/FLAG8702d906d [2024-10-24 16:01:04,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/220405d72/1dc27c04f3e04552a8e3b9fb1aae3d33 [2024-10-24 16:01:04,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:01:04,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:01:04,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:01:04,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:01:04,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:01:04,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:01:04" (1/1) ... [2024-10-24 16:01:04,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f458cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:04, skipping insertion in model container [2024-10-24 16:01:04,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:01:04" (1/1) ... [2024-10-24 16:01:04,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:01:04,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:01:04,853 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 16:01:04,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:01:04,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:01:04,986 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:01:05,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:01:05,155 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:01:05,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05 WrapperNode [2024-10-24 16:01:05,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:01:05,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:01:05,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:01:05,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:01:05,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05" (1/1) ... [2024-10-24 16:01:05,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05" (1/1) ... [2024-10-24 16:01:05,291 INFO L138 Inliner]: procedures = 180, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1429 [2024-10-24 16:01:05,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:01:05,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:01:05,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:01:05,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:01:05,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05" (1/1) ... [2024-10-24 16:01:05,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05" (1/1) ... [2024-10-24 16:01:05,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05" (1/1) ... [2024-10-24 16:01:05,417 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2024-10-24 16:01:05,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05" (1/1) ... [2024-10-24 16:01:05,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05" (1/1) ... [2024-10-24 16:01:05,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05" (1/1) ... [2024-10-24 16:01:05,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05" (1/1) ... [2024-10-24 16:01:05,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05" (1/1) ... [2024-10-24 16:01:05,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05" (1/1) ... [2024-10-24 16:01:05,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:01:05,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:01:05,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:01:05,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:01:05,519 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05" (1/1) ... [2024-10-24 16:01:05,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:01:05,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:01:05,555 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 16:01:05,557 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 16:01:05,611 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-24 16:01:05,612 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-24 16:01:05,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 16:01:05,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 16:01:05,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 16:01:05,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 16:01:05,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 16:01:05,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 16:01:05,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 16:01:05,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 16:01:05,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 16:01:05,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 16:01:05,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 16:01:05,613 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 16:01:05,613 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 16:01:05,613 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 16:01:05,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:01:05,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:01:05,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:01:05,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 16:01:05,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 16:01:05,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 16:01:05,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:01:05,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:01:05,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 16:01:05,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:01:05,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 16:01:05,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 16:01:05,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 16:01:05,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 16:01:05,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 16:01:05,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 16:01:05,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:01:05,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:01:05,866 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:01:05,869 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:01:19,102 INFO L? ?]: Removed 202 outVars from TransFormulas that were not future-live. [2024-10-24 16:01:19,103 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:01:19,149 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:01:19,150 INFO L314 CfgBuilder]: Removed 83 assume(true) statements. [2024-10-24 16:01:19,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:01:19 BoogieIcfgContainer [2024-10-24 16:01:19,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:01:19,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:01:19,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:01:19,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:01:19,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:01:04" (1/3) ... [2024-10-24 16:01:19,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24251872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:01:19, skipping insertion in model container [2024-10-24 16:01:19,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:01:05" (2/3) ... [2024-10-24 16:01:19,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24251872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:01:19, skipping insertion in model container [2024-10-24 16:01:19,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:01:19" (3/3) ... [2024-10-24 16:01:19,160 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2024-10-24 16:01:19,176 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:01:19,176 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 16:01:19,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:01:19,231 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;@788f1bf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:01:19,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 16:01:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 265 states, 246 states have (on average 1.6829268292682926) internal successors, (414), 255 states have internal predecessors, (414), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 16:01:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 16:01:19,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:19,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 16:01:19,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:19,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:19,246 INFO L85 PathProgramCache]: Analyzing trace with hash -771941024, now seen corresponding path program 1 times [2024-10-24 16:01:19,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:19,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602964178] [2024-10-24 16:01:19,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:01:19,255 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 16:01:19,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:19,259 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 16:01:19,260 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 16:01:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:01:19,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 16:01:19,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:01:19,470 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 16:01:19,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:01:19,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:01:19,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602964178] [2024-10-24 16:01:19,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602964178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:01:19,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:01:19,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:01:19,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085003756] [2024-10-24 16:01:19,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:01:19,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 16:01:19,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:01:19,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 16:01:19,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 16:01:19,512 INFO L87 Difference]: Start difference. First operand has 265 states, 246 states have (on average 1.6829268292682926) internal successors, (414), 255 states have internal predecessors, (414), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:01:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:01:19,564 INFO L93 Difference]: Finished difference Result 263 states and 345 transitions. [2024-10-24 16:01:19,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 16:01:19,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 16:01:19,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:01:19,578 INFO L225 Difference]: With dead ends: 263 [2024-10-24 16:01:19,578 INFO L226 Difference]: Without dead ends: 262 [2024-10-24 16:01:19,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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 16:01:19,582 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:01:19,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:01:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-24 16:01:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2024-10-24 16:01:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 245 states have (on average 1.3061224489795917) internal successors, (320), 252 states have internal predecessors, (320), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 16:01:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 344 transitions. [2024-10-24 16:01:19,668 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 344 transitions. Word has length 6 [2024-10-24 16:01:19,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:01:19,671 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 344 transitions. [2024-10-24 16:01:19,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:01:19,671 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 344 transitions. [2024-10-24 16:01:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 16:01:19,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:19,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 16:01:19,684 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 16:01:19,876 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 16:01:19,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:19,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:19,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1432258539, now seen corresponding path program 1 times [2024-10-24 16:01:19,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:19,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771698700] [2024-10-24 16:01:19,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:01:19,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 16:01:19,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:19,881 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 16:01:19,882 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 16:01:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:01:20,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 16:01:20,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:01:20,046 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 16:01:20,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:01:20,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:01:20,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771698700] [2024-10-24 16:01:20,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771698700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:01:20,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:01:20,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:01:20,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236467696] [2024-10-24 16:01:20,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:01:20,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:01:20,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:01:20,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:01:20,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:01:20,054 INFO L87 Difference]: Start difference. First operand 262 states and 344 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:01:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:01:20,387 INFO L93 Difference]: Finished difference Result 508 states and 672 transitions. [2024-10-24 16:01:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:01:20,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 16:01:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:01:20,391 INFO L225 Difference]: With dead ends: 508 [2024-10-24 16:01:20,391 INFO L226 Difference]: Without dead ends: 508 [2024-10-24 16:01:20,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:01:20,392 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 303 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:01:20,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 707 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:01:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-10-24 16:01:20,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 264. [2024-10-24 16:01:20,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 247 states have (on average 1.3036437246963564) internal successors, (322), 254 states have internal predecessors, (322), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 16:01:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 346 transitions. [2024-10-24 16:01:20,420 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 346 transitions. Word has length 6 [2024-10-24 16:01:20,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:01:20,420 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 346 transitions. [2024-10-24 16:01:20,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:01:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 346 transitions. [2024-10-24 16:01:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 16:01:20,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:20,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:01:20,431 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 (3)] Ended with exit code 0 [2024-10-24 16:01:20,627 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 16:01:20,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:20,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:20,629 INFO L85 PathProgramCache]: Analyzing trace with hash -289292392, now seen corresponding path program 1 times [2024-10-24 16:01:20,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:20,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399969844] [2024-10-24 16:01:20,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:01:20,633 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 16:01:20,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:20,637 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 16:01:20,638 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 16:01:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:01:21,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:01:21,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:01:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:01:21,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:01:21,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:01:21,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399969844] [2024-10-24 16:01:21,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399969844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:01:21,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:01:21,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:01:21,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221427778] [2024-10-24 16:01:21,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:01:21,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:01:21,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:01:21,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:01:21,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:01:21,330 INFO L87 Difference]: Start difference. First operand 264 states and 346 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 16:01:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:01:21,528 INFO L93 Difference]: Finished difference Result 267 states and 341 transitions. [2024-10-24 16:01:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:01:21,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 151 [2024-10-24 16:01:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:01:21,530 INFO L225 Difference]: With dead ends: 267 [2024-10-24 16:01:21,530 INFO L226 Difference]: Without dead ends: 267 [2024-10-24 16:01:21,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 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 16:01:21,531 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 30 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:01:21,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 916 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:01:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-24 16:01:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-10-24 16:01:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 250 states have (on average 1.268) internal successors, (317), 257 states have internal predecessors, (317), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 16:01:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 341 transitions. [2024-10-24 16:01:21,553 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 341 transitions. Word has length 151 [2024-10-24 16:01:21,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:01:21,553 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 341 transitions. [2024-10-24 16:01:21,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 16:01:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 341 transitions. [2024-10-24 16:01:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 16:01:21,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:21,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:01:21,573 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 (4)] Forceful destruction successful, exit code 0 [2024-10-24 16:01:21,759 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 16:01:21,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:21,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:21,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1086511628, now seen corresponding path program 1 times [2024-10-24 16:01:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:21,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247708151] [2024-10-24 16:01:21,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:01:21,762 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 16:01:21,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:21,770 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 16:01:21,771 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 16:01:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:01:22,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:01:22,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:01:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:01:22,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:01:22,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:01:22,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247708151] [2024-10-24 16:01:22,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247708151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:01:22,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:01:22,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:01:22,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223693961] [2024-10-24 16:01:22,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:01:22,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:01:22,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:01:22,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:01:22,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:01:22,731 INFO L87 Difference]: Start difference. First operand 267 states and 341 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 16:01:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:01:23,080 INFO L93 Difference]: Finished difference Result 309 states and 387 transitions. [2024-10-24 16:01:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:01:23,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 151 [2024-10-24 16:01:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:01:23,082 INFO L225 Difference]: With dead ends: 309 [2024-10-24 16:01:23,083 INFO L226 Difference]: Without dead ends: 309 [2024-10-24 16:01:23,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:01:23,084 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 4 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:01:23,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 652 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:01:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-24 16:01:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-24 16:01:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 292 states have (on average 1.2431506849315068) internal successors, (363), 299 states have internal predecessors, (363), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 16:01:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 387 transitions. [2024-10-24 16:01:23,093 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 387 transitions. Word has length 151 [2024-10-24 16:01:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:01:23,094 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 387 transitions. [2024-10-24 16:01:23,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 16:01:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 387 transitions. [2024-10-24 16:01:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 16:01:23,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:23,097 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:01:23,113 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 (5)] Ended with exit code 0 [2024-10-24 16:01:23,298 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 16:01:23,298 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:23,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:23,299 INFO L85 PathProgramCache]: Analyzing trace with hash -654146952, now seen corresponding path program 1 times [2024-10-24 16:01:23,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:23,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367132881] [2024-10-24 16:01:23,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:01:23,300 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 16:01:23,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:23,303 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 16:01:23,304 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 16:01:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:01:23,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:01:23,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:01:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:01:24,040 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:01:24,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:01:24,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367132881] [2024-10-24 16:01:24,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367132881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:01:24,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:01:24,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:01:24,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536753628] [2024-10-24 16:01:24,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:01:24,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:01:24,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:01:24,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:01:24,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:01:24,048 INFO L87 Difference]: Start difference. First operand 309 states and 387 transitions. Second operand has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:01:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:01:24,146 INFO L93 Difference]: Finished difference Result 311 states and 391 transitions. [2024-10-24 16:01:24,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:01:24,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 164 [2024-10-24 16:01:24,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:01:24,148 INFO L225 Difference]: With dead ends: 311 [2024-10-24 16:01:24,149 INFO L226 Difference]: Without dead ends: 311 [2024-10-24 16:01:24,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 161 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 16:01:24,150 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 0 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:01:24,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 974 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:01:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-24 16:01:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-10-24 16:01:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 293 states have (on average 1.2457337883959045) internal successors, (365), 301 states have internal predecessors, (365), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 16:01:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 391 transitions. [2024-10-24 16:01:24,159 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 391 transitions. Word has length 164 [2024-10-24 16:01:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:01:24,160 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 391 transitions. [2024-10-24 16:01:24,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 16:01:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 391 transitions. [2024-10-24 16:01:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 16:01:24,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:24,167 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:01:24,183 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 16:01:24,368 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 16:01:24,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:24,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1308145776, now seen corresponding path program 1 times [2024-10-24 16:01:24,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:24,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368304983] [2024-10-24 16:01:24,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:01:24,370 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 16:01:24,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:24,371 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 16:01:24,372 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 16:01:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:01:25,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:01:25,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:01:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:01:25,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:01:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 16:01:25,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:01:25,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368304983] [2024-10-24 16:01:25,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368304983] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:01:25,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:01:25,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 16:01:25,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918889066] [2024-10-24 16:01:25,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:01:25,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:01:25,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:01:25,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:01:25,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:01:25,240 INFO L87 Difference]: Start difference. First operand 311 states and 391 transitions. Second operand has 8 states, 6 states have (on average 27.833333333333332) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:01:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:01:25,643 INFO L93 Difference]: Finished difference Result 320 states and 406 transitions. [2024-10-24 16:01:25,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:01:25,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 27.833333333333332) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 166 [2024-10-24 16:01:25,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:01:25,646 INFO L225 Difference]: With dead ends: 320 [2024-10-24 16:01:25,647 INFO L226 Difference]: Without dead ends: 320 [2024-10-24 16:01:25,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:01:25,648 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 4 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1929 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:01:25,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1929 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:01:25,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-24 16:01:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2024-10-24 16:01:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 300 states have (on average 1.26) internal successors, (378), 308 states have internal predecessors, (378), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 16:01:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 404 transitions. [2024-10-24 16:01:25,662 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 404 transitions. Word has length 166 [2024-10-24 16:01:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:01:25,663 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 404 transitions. [2024-10-24 16:01:25,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 27.833333333333332) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:01:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 404 transitions. [2024-10-24 16:01:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 16:01:25,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:25,666 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:01:25,687 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 16:01:25,866 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 16:01:25,867 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:25,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:25,867 INFO L85 PathProgramCache]: Analyzing trace with hash 635821208, now seen corresponding path program 2 times [2024-10-24 16:01:25,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:25,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258082194] [2024-10-24 16:01:25,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:01:25,869 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 16:01:25,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:25,870 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 16:01:25,871 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 16:01:26,279 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 16:01:26,279 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:01:26,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:01:26,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:01:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-24 16:01:26,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:01:26,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:01:26,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258082194] [2024-10-24 16:01:26,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258082194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:01:26,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:01:26,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:01:26,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50229532] [2024-10-24 16:01:26,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:01:26,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:01:26,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:01:26,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:01:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:01:26,330 INFO L87 Difference]: Start difference. First operand 319 states and 404 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:01:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:01:26,491 INFO L93 Difference]: Finished difference Result 322 states and 399 transitions. [2024-10-24 16:01:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:01:26,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2024-10-24 16:01:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:01:26,494 INFO L225 Difference]: With dead ends: 322 [2024-10-24 16:01:26,494 INFO L226 Difference]: Without dead ends: 322 [2024-10-24 16:01:26,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 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 16:01:26,496 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 33 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:01:26,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 880 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:01:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-24 16:01:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2024-10-24 16:01:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 303 states have (on average 1.231023102310231) internal successors, (373), 311 states have internal predecessors, (373), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 16:01:26,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 399 transitions. [2024-10-24 16:01:26,506 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 399 transitions. Word has length 170 [2024-10-24 16:01:26,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:01:26,507 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 399 transitions. [2024-10-24 16:01:26,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:01:26,508 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 399 transitions. [2024-10-24 16:01:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-24 16:01:26,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:26,510 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:01:26,517 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 16:01:26,711 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 16:01:26,712 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:26,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:26,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1006829754, now seen corresponding path program 1 times [2024-10-24 16:01:26,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:26,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698007266] [2024-10-24 16:01:26,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:01:26,714 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 16:01:26,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:26,715 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 16:01:26,716 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 16:01:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:01:27,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 16:01:27,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:01:27,554 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:01:27,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:01:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:01:27,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:01:27,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698007266] [2024-10-24 16:01:27,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698007266] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:01:27,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:01:27,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 16:01:27,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144158010] [2024-10-24 16:01:27,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:01:27,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 16:01:27,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:01:27,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 16:01:27,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:01:27,810 INFO L87 Difference]: Start difference. First operand 322 states and 399 transitions. Second operand has 14 states, 12 states have (on average 14.416666666666666) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:01:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:01:28,630 INFO L93 Difference]: Finished difference Result 334 states and 419 transitions. [2024-10-24 16:01:28,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 16:01:28,631 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 14.416666666666666) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 170 [2024-10-24 16:01:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:01:28,633 INFO L225 Difference]: With dead ends: 334 [2024-10-24 16:01:28,633 INFO L226 Difference]: Without dead ends: 332 [2024-10-24 16:01:28,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-24 16:01:28,634 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 7 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:01:28,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1873 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:01:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-24 16:01:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 331. [2024-10-24 16:01:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 312 states have (on average 1.233974358974359) internal successors, (385), 320 states have internal predecessors, (385), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 16:01:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 411 transitions. [2024-10-24 16:01:28,651 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 411 transitions. Word has length 170 [2024-10-24 16:01:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:01:28,651 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 411 transitions. [2024-10-24 16:01:28,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 14.416666666666666) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:01:28,652 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 411 transitions. [2024-10-24 16:01:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 16:01:28,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:28,655 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:01:28,675 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 (9)] Forceful destruction successful, exit code 0 [2024-10-24 16:01:28,855 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 16:01:28,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:28,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:28,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1149043727, now seen corresponding path program 2 times [2024-10-24 16:01:28,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:28,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213843391] [2024-10-24 16:01:28,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:01:28,858 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 16:01:28,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:28,861 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 16:01:28,863 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 16:01:29,241 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 16:01:29,241 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:01:29,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:01:29,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:01:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-10-24 16:01:29,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:01:29,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:01:29,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213843391] [2024-10-24 16:01:29,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213843391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:01:29,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:01:29,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:01:29,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978936049] [2024-10-24 16:01:29,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:01:29,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:01:29,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:01:29,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:01:29,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:01:29,420 INFO L87 Difference]: Start difference. First operand 331 states and 411 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:01:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:01:29,514 INFO L93 Difference]: Finished difference Result 325 states and 401 transitions. [2024-10-24 16:01:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:01:29,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 179 [2024-10-24 16:01:29,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:01:29,519 INFO L225 Difference]: With dead ends: 325 [2024-10-24 16:01:29,520 INFO L226 Difference]: Without dead ends: 325 [2024-10-24 16:01:29,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:01:29,520 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 4 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:01:29,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 880 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:01:29,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-24 16:01:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2024-10-24 16:01:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 306 states have (on average 1.2254901960784315) internal successors, (375), 314 states have internal predecessors, (375), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 16:01:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 401 transitions. [2024-10-24 16:01:29,529 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 401 transitions. Word has length 179 [2024-10-24 16:01:29,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:01:29,530 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 401 transitions. [2024-10-24 16:01:29,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:01:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 401 transitions. [2024-10-24 16:01:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-24 16:01:29,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:29,532 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:01:29,538 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 (10)] Ended with exit code 0 [2024-10-24 16:01:29,736 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 16:01:29,737 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:29,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:29,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1611149513, now seen corresponding path program 1 times [2024-10-24 16:01:29,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:29,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577300470] [2024-10-24 16:01:29,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:01:29,738 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 16:01:29,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:29,740 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 16:01:29,741 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 16:01:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:01:30,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 16:01:30,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:01:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 16:01:30,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:01:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 16:01:31,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:01:31,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577300470] [2024-10-24 16:01:31,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577300470] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:01:31,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:01:31,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 16:01:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92486763] [2024-10-24 16:01:31,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:01:31,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 16:01:31,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:01:31,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 16:01:31,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 16:01:31,422 INFO L87 Difference]: Start difference. First operand 325 states and 401 transitions. Second operand has 26 states, 24 states have (on average 7.708333333333333) internal successors, (185), 26 states have internal predecessors, (185), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:01:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:01:33,844 INFO L93 Difference]: Finished difference Result 346 states and 439 transitions. [2024-10-24 16:01:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 16:01:33,844 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 7.708333333333333) internal successors, (185), 26 states have internal predecessors, (185), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 179 [2024-10-24 16:01:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:01:33,846 INFO L225 Difference]: With dead ends: 346 [2024-10-24 16:01:33,846 INFO L226 Difference]: Without dead ends: 344 [2024-10-24 16:01:33,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 16:01:33,848 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 14 mSDsluCounter, 3989 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4300 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:01:33,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4300 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 16:01:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-24 16:01:33,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2024-10-24 16:01:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 324 states have (on average 1.2314814814814814) internal successors, (399), 332 states have internal predecessors, (399), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 16:01:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 425 transitions. [2024-10-24 16:01:33,857 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 425 transitions. Word has length 179 [2024-10-24 16:01:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:01:33,858 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 425 transitions. [2024-10-24 16:01:33,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 7.708333333333333) internal successors, (185), 26 states have internal predecessors, (185), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:01:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 425 transitions. [2024-10-24 16:01:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 16:01:33,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:33,860 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:01:33,879 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 (11)] Ended with exit code 0 [2024-10-24 16:01:34,061 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 16:01:34,061 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:34,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2045689047, now seen corresponding path program 2 times [2024-10-24 16:01:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:34,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067340902] [2024-10-24 16:01:34,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:01:34,063 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 16:01:34,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:34,064 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 16:01:34,065 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 16:01:34,862 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:01:34,862 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:01:34,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 16:01:34,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:01:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 279 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 16:01:35,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:01:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-24 16:01:37,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:01:37,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067340902] [2024-10-24 16:01:37,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067340902] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:01:37,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:01:37,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 16:01:37,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757777700] [2024-10-24 16:01:37,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:01:37,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 16:01:37,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:01:37,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 16:01:37,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 16:01:37,333 INFO L87 Difference]: Start difference. First operand 343 states and 425 transitions. Second operand has 50 states, 48 states have (on average 4.354166666666667) internal successors, (209), 50 states have internal predecessors, (209), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:01:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:01:43,802 INFO L93 Difference]: Finished difference Result 380 states and 495 transitions. [2024-10-24 16:01:43,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-24 16:01:43,803 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 4.354166666666667) internal successors, (209), 50 states have internal predecessors, (209), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 197 [2024-10-24 16:01:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:01:43,805 INFO L225 Difference]: With dead ends: 380 [2024-10-24 16:01:43,805 INFO L226 Difference]: Without dead ends: 378 [2024-10-24 16:01:43,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-24 16:01:43,807 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 25 mSDsluCounter, 7368 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7679 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 16:01:43,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7679 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 16:01:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-24 16:01:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2024-10-24 16:01:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 358 states have (on average 1.2430167597765363) internal successors, (445), 366 states have internal predecessors, (445), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 16:01:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 471 transitions. [2024-10-24 16:01:43,816 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 471 transitions. Word has length 197 [2024-10-24 16:01:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:01:43,816 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 471 transitions. [2024-10-24 16:01:43,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 4.354166666666667) internal successors, (209), 50 states have internal predecessors, (209), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:01:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 471 transitions. [2024-10-24 16:01:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-24 16:01:43,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:43,819 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:01:43,839 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 16:01:44,019 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 16:01:44,020 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:44,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:44,021 INFO L85 PathProgramCache]: Analyzing trace with hash -657525129, now seen corresponding path program 3 times [2024-10-24 16:01:44,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:44,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349392220] [2024-10-24 16:01:44,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 16:01:44,022 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 16:01:44,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:44,023 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 16:01:44,024 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 16:01:44,741 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 16:01:44,741 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:01:44,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 16:01:44,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:01:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-24 16:01:44,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:01:44,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:01:44,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349392220] [2024-10-24 16:01:44,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349392220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:01:44,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:01:44,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:01:44,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558248733] [2024-10-24 16:01:44,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:01:44,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:01:44,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:01:44,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:01:44,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:01:44,804 INFO L87 Difference]: Start difference. First operand 377 states and 471 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:01:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:01:44,931 INFO L93 Difference]: Finished difference Result 380 states and 466 transitions. [2024-10-24 16:01:44,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:01:44,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 231 [2024-10-24 16:01:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:01:44,934 INFO L225 Difference]: With dead ends: 380 [2024-10-24 16:01:44,934 INFO L226 Difference]: Without dead ends: 380 [2024-10-24 16:01:44,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 228 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 16:01:44,934 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 30 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:01:44,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 838 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:01:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-24 16:01:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2024-10-24 16:01:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 361 states have (on average 1.2188365650969528) internal successors, (440), 369 states have internal predecessors, (440), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 16:01:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 466 transitions. [2024-10-24 16:01:44,948 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 466 transitions. Word has length 231 [2024-10-24 16:01:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:01:44,948 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 466 transitions. [2024-10-24 16:01:44,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 16:01:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 466 transitions. [2024-10-24 16:01:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-24 16:01:44,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:44,950 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:01:44,965 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 16:01:45,151 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 16:01:45,151 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:45,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:45,152 INFO L85 PathProgramCache]: Analyzing trace with hash 847108227, now seen corresponding path program 1 times [2024-10-24 16:01:45,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:45,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486514747] [2024-10-24 16:01:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:01:45,153 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 16:01:45,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:45,154 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 16:01:45,155 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 16:01:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:01:46,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 16:01:46,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:01:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 16:01:46,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:01:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 16:01:48,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:01:48,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486514747] [2024-10-24 16:01:48,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486514747] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:01:48,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:01:48,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-24 16:01:48,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60209110] [2024-10-24 16:01:48,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:01:48,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-24 16:01:48,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:01:48,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-24 16:01:48,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 16:01:48,764 INFO L87 Difference]: Start difference. First operand 380 states and 466 transitions. Second operand has 52 states, 50 states have (on average 4.16) internal successors, (208), 52 states have internal predecessors, (208), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 16:01:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:01:56,265 INFO L93 Difference]: Finished difference Result 407 states and 520 transitions. [2024-10-24 16:01:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-24 16:01:56,269 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 4.16) internal successors, (208), 52 states have internal predecessors, (208), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 231 [2024-10-24 16:01:56,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:01:56,271 INFO L225 Difference]: With dead ends: 407 [2024-10-24 16:01:56,271 INFO L226 Difference]: Without dead ends: 407 [2024-10-24 16:01:56,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-24 16:01:56,276 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 26 mSDsluCounter, 7354 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7653 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:01:56,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7653 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 16:01:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-24 16:01:56,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2024-10-24 16:01:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 386 states have (on average 1.2694300518134716) internal successors, (490), 394 states have internal predecessors, (490), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-10-24 16:01:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 516 transitions. [2024-10-24 16:01:56,292 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 516 transitions. Word has length 231 [2024-10-24 16:01:56,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:01:56,292 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 516 transitions. [2024-10-24 16:01:56,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 4.16) internal successors, (208), 52 states have internal predecessors, (208), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 16:01:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 516 transitions. [2024-10-24 16:01:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-24 16:01:56,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:01:56,294 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:01:56,326 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 16:01:56,495 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 16:01:56,496 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 16:01:56,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:01:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1381013432, now seen corresponding path program 2 times [2024-10-24 16:01:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:01:56,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568252177] [2024-10-24 16:01:56,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:01:56,498 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 16:01:56,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:01:56,502 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 16:01:56,504 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 16:01:58,670 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:01:58,670 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:01:58,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-24 16:01:58,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:02:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 16:02:01,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:02:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 16:02:08,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:02:08,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568252177] [2024-10-24 16:02:08,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568252177] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:02:08,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:02:08,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-24 16:02:08,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363817793] [2024-10-24 16:02:08,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:02:08,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-24 16:02:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:02:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-24 16:02:08,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-24 16:02:08,862 INFO L87 Difference]: Start difference. First operand 405 states and 516 transitions. Second operand has 102 states, 100 states have (on average 2.58) internal successors, (258), 102 states have internal predecessors, (258), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)