./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_OAT_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:35:25,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:35:25,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-11 17:35:25,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:35:25,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:35:25,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:35:25,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:35:25,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:35:25,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:35:25,666 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:35:25,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:35:25,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:35:25,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:35:25,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:35:25,668 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:35:25,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:35:25,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:35:25,670 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:35:25,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:35:25,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:35:25,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:35:25,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:35:25,672 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:35:25,672 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:35:25,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:35:25,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:35:25,673 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:35:25,674 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:35:25,674 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:35:25,674 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:35:25,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:35:25,675 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:35:25,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:35:25,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:35:25,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:35:25,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:35:25,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:35:25,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:35:25,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:35:25,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:35:25,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:35:25,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:35:25,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:35:25,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:35:25,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:35:25,692 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-clean/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-clean/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 -> da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 [2024-10-11 17:35:25,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:35:25,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:35:25,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:35:25,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:35:25,945 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:35:25,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2024-10-11 17:35:27,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:35:27,644 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:35:27,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2024-10-11 17:35:27,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/22d95303b/ae80dd1ab9544c78ab75aefdba4582b3/FLAGcde038595 [2024-10-11 17:35:27,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/22d95303b/ae80dd1ab9544c78ab75aefdba4582b3 [2024-10-11 17:35:27,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:35:27,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:35:27,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:35:27,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:35:27,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:35:27,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:35:27" (1/1) ... [2024-10-11 17:35:27,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4afde7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:27, skipping insertion in model container [2024-10-11 17:35:27,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:35:27" (1/1) ... [2024-10-11 17:35:28,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:35:28,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:35:28,599 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-11 17:35:28,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@30cd91a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:28, skipping insertion in model container [2024-10-11 17:35:28,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:35:28,601 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 17:35:28,603 INFO L158 Benchmark]: Toolchain (without parser) took 651.57ms. Allocated memory is still 184.5MB. Free memory was 134.2MB in the beginning and 112.5MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:35:28,604 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 184.5MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:35:28,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 649.14ms. Allocated memory is still 184.5MB. Free memory was 134.2MB in the beginning and 112.5MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:35:28,605 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.67ms. Allocated memory is still 184.5MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 649.14ms. Allocated memory is still 184.5MB. Free memory was 134.2MB in the beginning and 112.5MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:35:30,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:35:30,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-11 17:35:30,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:35:30,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:35:30,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:35:30,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:35:30,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:35:30,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:35:30,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:35:30,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:35:30,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:35:30,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:35:30,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:35:30,803 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:35:30,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:35:30,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:35:30,804 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:35:30,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:35:30,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:35:30,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:35:30,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:35:30,810 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:35:30,810 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:35:30,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:35:30,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:35:30,811 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:35:30,811 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 17:35:30,811 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:35:30,812 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 17:35:30,812 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:35:30,812 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:35:30,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:35:30,813 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:35:30,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:35:30,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:35:30,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:35:30,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:35:30,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:35:30,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:35:30,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:35:30,816 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 17:35:30,816 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 17:35:30,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:35:30,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:35:30,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:35:30,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:35:30,818 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 17:35:30,818 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-clean/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-clean/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 -> da01f7e29b47732481465e941f69a1c8f9dd5529ae81cb8448eb7568570e2356 [2024-10-11 17:35:31,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:35:31,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:35:31,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:35:31,169 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:35:31,170 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:35:31,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2024-10-11 17:35:32,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:35:33,048 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:35:33,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-2.i [2024-10-11 17:35:33,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5ca0f7e9b/e56d9bf7d15a47efb38f098d3d45cf3e/FLAG08b149c38 [2024-10-11 17:35:33,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5ca0f7e9b/e56d9bf7d15a47efb38f098d3d45cf3e [2024-10-11 17:35:33,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:35:33,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:35:33,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:35:33,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:35:33,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:35:33,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:35:33" (1/1) ... [2024-10-11 17:35:33,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9d812f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:33, skipping insertion in model container [2024-10-11 17:35:33,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:35:33" (1/1) ... [2024-10-11 17:35:33,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:35:33,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:35:33,950 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 17:35:33,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:35:34,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:35:34,054 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:35:34,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:35:34,200 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:35:34,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34 WrapperNode [2024-10-11 17:35:34,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:35:34,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:35:34,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:35:34,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:35:34,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34" (1/1) ... [2024-10-11 17:35:34,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34" (1/1) ... [2024-10-11 17:35:34,301 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1063 [2024-10-11 17:35:34,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:35:34,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:35:34,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:35:34,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:35:34,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34" (1/1) ... [2024-10-11 17:35:34,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34" (1/1) ... [2024-10-11 17:35:34,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34" (1/1) ... [2024-10-11 17:35:34,410 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-11 17:35:34,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34" (1/1) ... [2024-10-11 17:35:34,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34" (1/1) ... [2024-10-11 17:35:34,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34" (1/1) ... [2024-10-11 17:35:34,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34" (1/1) ... [2024-10-11 17:35:34,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34" (1/1) ... [2024-10-11 17:35:34,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34" (1/1) ... [2024-10-11 17:35:34,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:35:34,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:35:34,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:35:34,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:35:34,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34" (1/1) ... [2024-10-11 17:35:34,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:35:34,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:35:34,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:35:34,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:35:34,572 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 17:35:34,572 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 17:35:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 17:35:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 17:35:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 17:35:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 17:35:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 17:35:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 17:35:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 17:35:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 17:35:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 17:35:34,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 17:35:34,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 17:35:34,575 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 17:35:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:35:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:35:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:35:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:35:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:35:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 17:35:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 17:35:34,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 17:35:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 17:35:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 17:35:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 17:35:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 17:35:34,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 17:35:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:35:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:35:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:35:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:35:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:35:34,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:35:34,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:35:34,829 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:35:34,831 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:35:41,673 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2024-10-11 17:35:41,673 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:35:41,727 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:35:41,728 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 17:35:41,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:35:41 BoogieIcfgContainer [2024-10-11 17:35:41,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:35:41,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:35:41,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:35:41,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:35:41,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:35:33" (1/3) ... [2024-10-11 17:35:41,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d561d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:35:41, skipping insertion in model container [2024-10-11 17:35:41,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:35:34" (2/3) ... [2024-10-11 17:35:41,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d561d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:35:41, skipping insertion in model container [2024-10-11 17:35:41,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:35:41" (3/3) ... [2024-10-11 17:35:41,737 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-2.i [2024-10-11 17:35:41,752 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:35:41,752 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 17:35:41,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:35:41,813 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;@18c29aaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:35:41,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 17:35:41,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 212 states, 196 states have (on average 1.6785714285714286) internal successors, (329), 205 states have internal predecessors, (329), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 17:35:41,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:35:41,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:35:41,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:35:41,828 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:35:41,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:35:41,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2100239337, now seen corresponding path program 1 times [2024-10-11 17:35:41,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:35:41,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601101314] [2024-10-11 17:35:41,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:35:41,847 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-11 17:35:41,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:35:41,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 17:35:41,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:35:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:35:42,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 17:35:42,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:35:42,070 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-11 17:35:42,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:35:42,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:35:42,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601101314] [2024-10-11 17:35:42,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601101314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:35:42,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:35:42,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:35:42,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513459855] [2024-10-11 17:35:42,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:35:42,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:35:42,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:35:42,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:35:42,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:35:42,117 INFO L87 Difference]: Start difference. First operand has 212 states, 196 states have (on average 1.6785714285714286) internal successors, (329), 205 states have internal predecessors, (329), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:35:42,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:35:42,180 INFO L93 Difference]: Finished difference Result 210 states and 277 transitions. [2024-10-11 17:35:42,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:35:42,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:35:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:35:42,190 INFO L225 Difference]: With dead ends: 210 [2024-10-11 17:35:42,190 INFO L226 Difference]: Without dead ends: 209 [2024-10-11 17:35:42,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:35:42,196 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:35:42,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:35:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-11 17:35:42,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-11 17:35:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 195 states have (on average 1.323076923076923) internal successors, (258), 202 states have internal predecessors, (258), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:35:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 276 transitions. [2024-10-11 17:35:42,244 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 276 transitions. Word has length 10 [2024-10-11 17:35:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:35:42,245 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 276 transitions. [2024-10-11 17:35:42,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:35:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 276 transitions. [2024-10-11 17:35:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 17:35:42,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:35:42,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:35:42,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:35:42,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 17:35:42,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:35:42,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:35:42,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1047215673, now seen corresponding path program 1 times [2024-10-11 17:35:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:35:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278520358] [2024-10-11 17:35:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:35:42,449 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-11 17:35:42,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:35:42,470 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 17:35:42,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:35:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:35:42,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:35:42,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:35:42,725 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-11 17:35:42,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:35:42,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:35:42,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278520358] [2024-10-11 17:35:42,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278520358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:35:42,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:35:42,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:35:42,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516361547] [2024-10-11 17:35:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:35:42,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:35:42,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:35:42,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:35:42,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:35:42,734 INFO L87 Difference]: Start difference. First operand 209 states and 276 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11 17:35:43,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:35:43,347 INFO L93 Difference]: Finished difference Result 339 states and 452 transitions. [2024-10-11 17:35:43,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:35:43,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2024-10-11 17:35:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:35:43,350 INFO L225 Difference]: With dead ends: 339 [2024-10-11 17:35:43,350 INFO L226 Difference]: Without dead ends: 339 [2024-10-11 17:35:43,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-11 17:35:43,351 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 156 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 17:35:43,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 507 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 17:35:43,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-11 17:35:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 308. [2024-10-11 17:35:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 289 states have (on average 1.328719723183391) internal successors, (384), 301 states have internal predecessors, (384), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 17:35:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 412 transitions. [2024-10-11 17:35:43,377 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 412 transitions. Word has length 12 [2024-10-11 17:35:43,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:35:43,377 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 412 transitions. [2024-10-11 17:35:43,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11 17:35:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 412 transitions. [2024-10-11 17:35:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 17:35:43,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:35:43,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:35:43,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:35:43,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 17:35:43,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:35:43,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:35:43,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1045368631, now seen corresponding path program 1 times [2024-10-11 17:35:43,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:35:43,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318941169] [2024-10-11 17:35:43,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:35:43,583 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-11 17:35:43,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:35:43,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 17:35:43,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:35:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:35:43,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:35:43,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:35:43,800 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:35:43,801 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:35:43,802 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:35:43,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-11 17:35:43,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:35:43,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-11 17:35:43,878 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-11 17:35:43,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:35:43,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:35:43,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318941169] [2024-10-11 17:35:43,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318941169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:35:43,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:35:43,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:35:43,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966431032] [2024-10-11 17:35:43,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:35:43,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:35:43,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:35:43,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:35:43,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:35:43,881 INFO L87 Difference]: Start difference. First operand 308 states and 412 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11 17:35:44,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:35:44,379 INFO L93 Difference]: Finished difference Result 474 states and 643 transitions. [2024-10-11 17:35:44,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:35:44,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-10-11 17:35:44,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:35:44,382 INFO L225 Difference]: With dead ends: 474 [2024-10-11 17:35:44,382 INFO L226 Difference]: Without dead ends: 474 [2024-10-11 17:35:44,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-11 17:35:44,383 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 239 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:35:44,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 802 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:35:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-11 17:35:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 307. [2024-10-11 17:35:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 288 states have (on average 1.3263888888888888) internal successors, (382), 300 states have internal predecessors, (382), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 17:35:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 410 transitions. [2024-10-11 17:35:44,409 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 410 transitions. Word has length 12 [2024-10-11 17:35:44,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:35:44,409 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 410 transitions. [2024-10-11 17:35:44,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11 17:35:44,410 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 410 transitions. [2024-10-11 17:35:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 17:35:44,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:35:44,412 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] [2024-10-11 17:35:44,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:35:44,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 17:35:44,617 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:35:44,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:35:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash 335054576, now seen corresponding path program 1 times [2024-10-11 17:35:44,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:35:44,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467699850] [2024-10-11 17:35:44,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:35:44,619 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-11 17:35:44,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:35:44,622 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 17:35:44,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:35:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:35:45,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:35:45,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:35:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:35:45,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:35:45,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:35:45,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467699850] [2024-10-11 17:35:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467699850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:35:45,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:35:45,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:35:45,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283116157] [2024-10-11 17:35:45,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:35:45,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:35:45,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:35:45,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:35:45,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:35:45,125 INFO L87 Difference]: Start difference. First operand 307 states and 410 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:35:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:35:45,285 INFO L93 Difference]: Finished difference Result 313 states and 400 transitions. [2024-10-11 17:35:45,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:35:45,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-10-11 17:35:45,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:35:45,289 INFO L225 Difference]: With dead ends: 313 [2024-10-11 17:35:45,290 INFO L226 Difference]: Without dead ends: 313 [2024-10-11 17:35:45,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 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-11 17:35:45,291 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 30 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:35:45,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 709 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:35:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-11 17:35:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-10-11 17:35:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 294 states have (on average 1.2653061224489797) internal successors, (372), 306 states have internal predecessors, (372), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 17:35:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 400 transitions. [2024-10-11 17:35:45,301 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 400 transitions. Word has length 81 [2024-10-11 17:35:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:35:45,301 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 400 transitions. [2024-10-11 17:35:45,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:35:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 400 transitions. [2024-10-11 17:35:45,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 17:35:45,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:35:45,304 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] [2024-10-11 17:35:45,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 17:35:45,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 17:35:45,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:35:45,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:35:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash 411014652, now seen corresponding path program 1 times [2024-10-11 17:35:45,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:35:45,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549277934] [2024-10-11 17:35:45,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:35:45,510 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-11 17:35:45,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:35:45,518 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 17:35:45,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:35:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:35:46,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:35:46,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:35:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:35:46,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:35:46,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:35:46,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549277934] [2024-10-11 17:35:46,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549277934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:35:46,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:35:46,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:35:46,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277964366] [2024-10-11 17:35:46,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:35:46,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:35:46,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:35:46,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:35:46,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:35:46,048 INFO L87 Difference]: Start difference. First operand 313 states and 400 transitions. Second operand has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:35:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:35:46,127 INFO L93 Difference]: Finished difference Result 315 states and 403 transitions. [2024-10-11 17:35:46,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:35:46,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2024-10-11 17:35:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:35:46,130 INFO L225 Difference]: With dead ends: 315 [2024-10-11 17:35:46,130 INFO L226 Difference]: Without dead ends: 315 [2024-10-11 17:35:46,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 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-11 17:35:46,132 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:35:46,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 773 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:35:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-11 17:35:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2024-10-11 17:35:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 295 states have (on average 1.2677966101694915) internal successors, (374), 308 states have internal predecessors, (374), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 17:35:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 403 transitions. [2024-10-11 17:35:46,144 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 403 transitions. Word has length 81 [2024-10-11 17:35:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:35:46,145 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 403 transitions. [2024-10-11 17:35:46,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:35:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 403 transitions. [2024-10-11 17:35:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 17:35:46,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:35:46,152 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:35:46,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 17:35:46,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-11 17:35:46,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:35:46,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:35:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1108129452, now seen corresponding path program 1 times [2024-10-11 17:35:46,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:35:46,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173159032] [2024-10-11 17:35:46,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:35:46,354 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-11 17:35:46,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:35:46,357 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 17:35:46,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:35:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:35:46,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:35:46,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:35:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:35:46,844 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:35:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:35:46,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:35:46,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173159032] [2024-10-11 17:35:46,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173159032] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:35:46,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:35:46,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 17:35:46,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823295351] [2024-10-11 17:35:46,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:35:46,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:35:46,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:35:46,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:35:46,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:35:46,997 INFO L87 Difference]: Start difference. First operand 315 states and 403 transitions. Second operand has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:35:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:35:47,239 INFO L93 Difference]: Finished difference Result 324 states and 417 transitions. [2024-10-11 17:35:47,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:35:47,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 83 [2024-10-11 17:35:47,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:35:47,242 INFO L225 Difference]: With dead ends: 324 [2024-10-11 17:35:47,242 INFO L226 Difference]: Without dead ends: 324 [2024-10-11 17:35:47,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:35:47,243 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 5 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:35:47,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1029 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:35:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-11 17:35:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 323. [2024-10-11 17:35:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 302 states have (on average 1.281456953642384) internal successors, (387), 315 states have internal predecessors, (387), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 17:35:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 416 transitions. [2024-10-11 17:35:47,259 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 416 transitions. Word has length 83 [2024-10-11 17:35:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:35:47,260 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 416 transitions. [2024-10-11 17:35:47,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:35:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 416 transitions. [2024-10-11 17:35:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 17:35:47,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:35:47,263 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:35:47,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 17:35:47,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-11 17:35:47,464 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:35:47,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:35:47,464 INFO L85 PathProgramCache]: Analyzing trace with hash -741936228, now seen corresponding path program 2 times [2024-10-11 17:35:47,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:35:47,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605093337] [2024-10-11 17:35:47,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:35:47,465 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-11 17:35:47,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:35:47,466 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-11 17:35:47,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:35:47,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:35:47,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:35:47,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 17:35:47,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:35:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 17:35:47,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:35:47,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:35:47,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605093337] [2024-10-11 17:35:47,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605093337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:35:47,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:35:47,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:35:47,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039995175] [2024-10-11 17:35:47,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:35:47,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:35:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:35:47,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:35:47,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:35:47,812 INFO L87 Difference]: Start difference. First operand 323 states and 416 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:35:52,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 17:35:56,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 17:35:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:35:58,547 INFO L93 Difference]: Finished difference Result 465 states and 610 transitions. [2024-10-11 17:35:58,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:35:58,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-10-11 17:35:58,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:35:58,552 INFO L225 Difference]: With dead ends: 465 [2024-10-11 17:35:58,552 INFO L226 Difference]: Without dead ends: 465 [2024-10-11 17:35:58,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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-11 17:35:58,555 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 572 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:35:58,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 444 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 123 Invalid, 2 Unknown, 0 Unchecked, 10.7s Time] [2024-10-11 17:35:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-11 17:35:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 440. [2024-10-11 17:35:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 413 states have (on average 1.2929782082324455) internal successors, (534), 431 states have internal predecessors, (534), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-11 17:35:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 576 transitions. [2024-10-11 17:35:58,577 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 576 transitions. Word has length 87 [2024-10-11 17:35:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:35:58,578 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 576 transitions. [2024-10-11 17:35:58,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:35:58,579 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 576 transitions. [2024-10-11 17:35:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 17:35:58,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:35:58,581 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:35:58,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:35:58,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-11 17:35:58,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:35:58,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:35:58,782 INFO L85 PathProgramCache]: Analyzing trace with hash 380142394, now seen corresponding path program 1 times [2024-10-11 17:35:58,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:35:58,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641745661] [2024-10-11 17:35:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:35:58,783 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-11 17:35:58,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:35:58,785 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-11 17:35:58,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:35:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:35:59,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 17:35:59,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:35:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:35:59,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:35:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 17:35:59,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:35:59,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641745661] [2024-10-11 17:35:59,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641745661] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:35:59,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:35:59,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 17:35:59,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372480173] [2024-10-11 17:35:59,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:35:59,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:35:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:35:59,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:35:59,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:35:59,602 INFO L87 Difference]: Start difference. First operand 440 states and 576 transitions. Second operand has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:36:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:36:00,364 INFO L93 Difference]: Finished difference Result 452 states and 596 transitions. [2024-10-11 17:36:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:36:00,367 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2024-10-11 17:36:00,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:36:00,369 INFO L225 Difference]: With dead ends: 452 [2024-10-11 17:36:00,369 INFO L226 Difference]: Without dead ends: 450 [2024-10-11 17:36:00,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 178 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-11 17:36:00,370 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 7 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:36:00,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2561 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:36:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-10-11 17:36:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 449. [2024-10-11 17:36:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 422 states have (on average 1.2938388625592416) internal successors, (546), 440 states have internal predecessors, (546), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-11 17:36:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 588 transitions. [2024-10-11 17:36:00,389 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 588 transitions. Word has length 96 [2024-10-11 17:36:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:36:00,389 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 588 transitions. [2024-10-11 17:36:00,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 17:36:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 588 transitions. [2024-10-11 17:36:00,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 17:36:00,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:36:00,391 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:36:00,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 17:36:00,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-11 17:36:00,592 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:36:00,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:36:00,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1541136251, now seen corresponding path program 2 times [2024-10-11 17:36:00,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:36:00,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272895959] [2024-10-11 17:36:00,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:36:00,594 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-11 17:36:00,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:36:00,595 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-11 17:36:00,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:36:00,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:36:00,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:36:00,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:36:00,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:36:00,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:36:00,972 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:36:00,972 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:36:00,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-11 17:36:01,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:36:01,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-11 17:36:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-11 17:36:01,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:36:01,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:36:01,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272895959] [2024-10-11 17:36:01,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272895959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:36:01,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:36:01,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:36:01,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993725602] [2024-10-11 17:36:01,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:36:01,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:36:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:36:01,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:36:01,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:36:01,076 INFO L87 Difference]: Start difference. First operand 449 states and 588 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:36:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:36:01,478 INFO L93 Difference]: Finished difference Result 657 states and 880 transitions. [2024-10-11 17:36:01,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:36:01,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2024-10-11 17:36:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:36:01,483 INFO L225 Difference]: With dead ends: 657 [2024-10-11 17:36:01,483 INFO L226 Difference]: Without dead ends: 657 [2024-10-11 17:36:01,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:36:01,486 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 186 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:36:01,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 771 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:36:01,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-11 17:36:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 453. [2024-10-11 17:36:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 426 states have (on average 1.2910798122065728) internal successors, (550), 444 states have internal predecessors, (550), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-11 17:36:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 592 transitions. [2024-10-11 17:36:01,499 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 592 transitions. Word has length 105 [2024-10-11 17:36:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:36:01,500 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 592 transitions. [2024-10-11 17:36:01,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:36:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 592 transitions. [2024-10-11 17:36:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 17:36:01,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:36:01,502 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:36:01,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:36:01,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-11 17:36:01,703 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:36:01,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:36:01,704 INFO L85 PathProgramCache]: Analyzing trace with hash 631015289, now seen corresponding path program 1 times [2024-10-11 17:36:01,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:36:01,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555839051] [2024-10-11 17:36:01,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:36:01,705 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-11 17:36:01,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:36:01,707 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-11 17:36:01,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:36:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:36:02,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:36:02,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:36:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 17:36:02,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:36:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 17:36:03,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:36:03,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555839051] [2024-10-11 17:36:03,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555839051] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:36:03,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:36:03,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 17:36:03,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534605237] [2024-10-11 17:36:03,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:36:03,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 17:36:03,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:36:03,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 17:36:03,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:36:03,309 INFO L87 Difference]: Start difference. First operand 453 states and 592 transitions. Second operand has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 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-11 17:36:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:36:05,621 INFO L93 Difference]: Finished difference Result 474 states and 630 transitions. [2024-10-11 17:36:05,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 17:36:05,622 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 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 139 [2024-10-11 17:36:05,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:36:05,624 INFO L225 Difference]: With dead ends: 474 [2024-10-11 17:36:05,626 INFO L226 Difference]: Without dead ends: 472 [2024-10-11 17:36:05,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 252 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-11 17:36:05,627 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 14 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3333 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:36:05,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3333 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 17:36:05,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-10-11 17:36:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 471. [2024-10-11 17:36:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 444 states have (on average 1.2927927927927927) internal successors, (574), 462 states have internal predecessors, (574), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-11 17:36:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 616 transitions. [2024-10-11 17:36:05,640 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 616 transitions. Word has length 139 [2024-10-11 17:36:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:36:05,641 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 616 transitions. [2024-10-11 17:36:05,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 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-11 17:36:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 616 transitions. [2024-10-11 17:36:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 17:36:05,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:36:05,643 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:36:05,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:36:05,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-11 17:36:05,848 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:36:05,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:36:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash -46636967, now seen corresponding path program 2 times [2024-10-11 17:36:05,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:36:05,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826544408] [2024-10-11 17:36:05,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:36:05,849 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-11 17:36:05,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:36:05,850 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-11 17:36:05,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:36:06,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:36:06,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:36:06,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:36:06,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:36:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2024-10-11 17:36:06,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:36:06,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:36:06,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826544408] [2024-10-11 17:36:06,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826544408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:36:06,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:36:06,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:36:06,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396696053] [2024-10-11 17:36:06,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:36:06,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:36:06,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:36:06,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:36:06,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:36:06,241 INFO L87 Difference]: Start difference. First operand 471 states and 616 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-11 17:36:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:36:06,385 INFO L93 Difference]: Finished difference Result 531 states and 676 transitions. [2024-10-11 17:36:06,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:36:06,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 157 [2024-10-11 17:36:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:36:06,389 INFO L225 Difference]: With dead ends: 531 [2024-10-11 17:36:06,389 INFO L226 Difference]: Without dead ends: 531 [2024-10-11 17:36:06,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 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-11 17:36:06,390 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 7 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:36:06,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 468 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:36:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-11 17:36:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2024-10-11 17:36:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 504 states have (on average 1.257936507936508) internal successors, (634), 522 states have internal predecessors, (634), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-11 17:36:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 676 transitions. [2024-10-11 17:36:06,400 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 676 transitions. Word has length 157 [2024-10-11 17:36:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:36:06,401 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 676 transitions. [2024-10-11 17:36:06,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-11 17:36:06,401 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 676 transitions. [2024-10-11 17:36:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 17:36:06,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:36:06,403 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:36:06,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-11 17:36:06,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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-11 17:36:06,604 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:36:06,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:36:06,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1116735837, now seen corresponding path program 1 times [2024-10-11 17:36:06,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:36:06,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956956207] [2024-10-11 17:36:06,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:36:06,605 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-11 17:36:06,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:36:06,606 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/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-11 17:36:06,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:36:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:36:07,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 17:36:07,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:36:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-11 17:36:07,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:36:09,652 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-11 17:36:09,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:36:09,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956956207] [2024-10-11 17:36:09,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956956207] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:36:09,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:36:09,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 17:36:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301481625] [2024-10-11 17:36:09,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:36:09,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 17:36:09,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:36:09,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 17:36:09,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 17:36:09,656 INFO L87 Difference]: Start difference. First operand 531 states and 676 transitions. Second operand has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 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-11 17:36:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:36:16,335 INFO L93 Difference]: Finished difference Result 568 states and 746 transitions. [2024-10-11 17:36:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 17:36:16,336 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 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 157 [2024-10-11 17:36:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:36:16,338 INFO L225 Difference]: With dead ends: 568 [2024-10-11 17:36:16,338 INFO L226 Difference]: Without dead ends: 566 [2024-10-11 17:36:16,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 17:36:16,342 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 25 mSDsluCounter, 6655 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6914 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:36:16,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6914 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 17:36:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-10-11 17:36:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 565. [2024-10-11 17:36:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 538 states have (on average 1.2639405204460967) internal successors, (680), 556 states have internal predecessors, (680), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-11 17:36:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 722 transitions. [2024-10-11 17:36:16,366 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 722 transitions. Word has length 157 [2024-10-11 17:36:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:36:16,366 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 722 transitions. [2024-10-11 17:36:16,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 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-11 17:36:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 722 transitions. [2024-10-11 17:36:16,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-11 17:36:16,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:36:16,369 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:36:16,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:36:16,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/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-11 17:36:16,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:36:16,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:36:16,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1641422397, now seen corresponding path program 2 times [2024-10-11 17:36:16,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:36:16,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154007765] [2024-10-11 17:36:16,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:36:16,572 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-11 17:36:16,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:36:16,575 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-11 17:36:16,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:36:17,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:36:17,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:36:17,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:36:17,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:36:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2350 trivial. 0 not checked. [2024-10-11 17:36:17,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:36:17,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:36:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154007765] [2024-10-11 17:36:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154007765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:36:17,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:36:17,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:36:17,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065801836] [2024-10-11 17:36:17,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:36:17,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:36:17,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:36:17,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:36:17,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:36:17,054 INFO L87 Difference]: Start difference. First operand 565 states and 722 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-11 17:36:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:36:17,196 INFO L93 Difference]: Finished difference Result 514 states and 638 transitions. [2024-10-11 17:36:17,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:36:17,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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 191 [2024-10-11 17:36:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:36:17,200 INFO L225 Difference]: With dead ends: 514 [2024-10-11 17:36:17,203 INFO L226 Difference]: Without dead ends: 514 [2024-10-11 17:36:17,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 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-11 17:36:17,203 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 32 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:36:17,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 672 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:36:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-11 17:36:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2024-10-11 17:36:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 487 states have (on average 1.2238193018480492) internal successors, (596), 505 states have internal predecessors, (596), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-11 17:36:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 638 transitions. [2024-10-11 17:36:17,216 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 638 transitions. Word has length 191 [2024-10-11 17:36:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:36:17,217 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 638 transitions. [2024-10-11 17:36:17,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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-11 17:36:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 638 transitions. [2024-10-11 17:36:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-11 17:36:17,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:36:17,219 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:36:17,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:36:17,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-11 17:36:17,420 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:36:17,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:36:17,420 INFO L85 PathProgramCache]: Analyzing trace with hash -629608721, now seen corresponding path program 1 times [2024-10-11 17:36:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:36:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080866688] [2024-10-11 17:36:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:36:17,421 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-11 17:36:17,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:36:17,422 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-11 17:36:17,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 17:36:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:36:18,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 17:36:18,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:36:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:36:18,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:36:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:36:20,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:36:20,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080866688] [2024-10-11 17:36:20,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080866688] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:36:20,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:36:20,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-11 17:36:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135044436] [2024-10-11 17:36:20,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:36:20,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-11 17:36:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:36:20,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-11 17:36:20,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 17:36:20,738 INFO L87 Difference]: Start difference. First operand 514 states and 638 transitions. Second operand has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 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-11 17:36:27,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:36:27,587 INFO L93 Difference]: Finished difference Result 541 states and 692 transitions. [2024-10-11 17:36:27,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-11 17:36:27,588 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 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 191 [2024-10-11 17:36:27,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:36:27,590 INFO L225 Difference]: With dead ends: 541 [2024-10-11 17:36:27,592 INFO L226 Difference]: Without dead ends: 541 [2024-10-11 17:36:27,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-11 17:36:27,595 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 27 mSDsluCounter, 6838 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 7085 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 17:36:27,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 7085 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 17:36:27,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-10-11 17:36:27,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2024-10-11 17:36:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 512 states have (on average 1.26171875) internal successors, (646), 530 states have internal predecessors, (646), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-11 17:36:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 688 transitions. [2024-10-11 17:36:27,607 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 688 transitions. Word has length 191 [2024-10-11 17:36:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:36:27,607 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 688 transitions. [2024-10-11 17:36:27,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 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-11 17:36:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 688 transitions. [2024-10-11 17:36:27,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 17:36:27,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:36:27,610 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:36:27,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-11 17:36:27,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/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-11 17:36:27,811 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:36:27,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:36:27,812 INFO L85 PathProgramCache]: Analyzing trace with hash 235372174, now seen corresponding path program 2 times [2024-10-11 17:36:27,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:36:27,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915167574] [2024-10-11 17:36:27,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:36:27,813 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-11 17:36:27,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:36:27,816 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/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-11 17:36:27,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 17:36:29,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:36:29,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:36:29,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 17:36:29,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:36:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:36:31,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:36:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-11 17:36:39,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:36:39,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915167574] [2024-10-11 17:36:39,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915167574] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:36:39,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:36:39,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-11 17:36:39,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576833059] [2024-10-11 17:36:39,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:36:39,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-11 17:36:39,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:36:39,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-11 17:36:39,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-11 17:36:39,839 INFO L87 Difference]: Start difference. First operand 539 states and 688 transitions. Second operand has 102 states, 100 states have (on average 2.18) internal successors, (218), 102 states have internal predecessors, (218), 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)