./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:07:32,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:07:32,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:07:32,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:07:32,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:07:32,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:07:32,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:07:32,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:07:32,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:07:32,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:07:32,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:07:32,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:07:32,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:07:32,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:07:32,949 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:07:32,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:07:32,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:07:32,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:07:32,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:07:32,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:07:32,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:07:32,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:07:32,952 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:07:32,953 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:07:32,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:07:32,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:07:32,954 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:07:32,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:07:32,955 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:07:32,955 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:07:32,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:07:32,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:07:32,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:07:32,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:07:32,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:07:32,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:07:32,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:07:32,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:07:32,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:07:32,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:07:32,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:07:32,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:07:32,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:07:32,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:07:32,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:07:32,960 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2024-10-13 10:07:33,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:07:33,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:07:33,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:07:33,268 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:07:33,269 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:07:33,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i [2024-10-13 10:07:34,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:07:34,941 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:07:34,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i [2024-10-13 10:07:34,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b582403b4/987296af635b42cba62932a9a5d74545/FLAGd4db823a7 [2024-10-13 10:07:34,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b582403b4/987296af635b42cba62932a9a5d74545 [2024-10-13 10:07:34,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:07:34,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:07:34,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:07:34,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:07:34,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:07:34,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:07:34" (1/1) ... [2024-10-13 10:07:34,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b417861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:34, skipping insertion in model container [2024-10-13 10:07:34,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:07:34" (1/1) ... [2024-10-13 10:07:35,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:07:35,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:07:35,446 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-13 10:07:35,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@448ccbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:35, skipping insertion in model container [2024-10-13 10:07:35,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:07:35,449 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:07:35,451 INFO L158 Benchmark]: Toolchain (without parser) took 473.98ms. Allocated memory is still 180.4MB. Free memory was 107.9MB in the beginning and 92.4MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 10:07:35,451 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 180.4MB. Free memory was 135.8MB in the beginning and 135.7MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:07:35,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.83ms. Allocated memory is still 180.4MB. Free memory was 107.7MB in the beginning and 92.4MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 10:07:35,454 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.24ms. Allocated memory is still 180.4MB. Free memory was 135.8MB in the beginning and 135.7MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 471.83ms. Allocated memory is still 180.4MB. Free memory was 107.7MB in the beginning and 92.4MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 792]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:07:37,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:07:37,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:07:37,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:07:37,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:07:37,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:07:37,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:07:37,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:07:37,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:07:37,696 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:07:37,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:07:37,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:07:37,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:07:37,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:07:37,698 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:07:37,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:07:37,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:07:37,699 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:07:37,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:07:37,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:07:37,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:07:37,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:07:37,700 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:07:37,701 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:07:37,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:07:37,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:07:37,702 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:07:37,702 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:07:37,702 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:07:37,703 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:07:37,703 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:07:37,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:07:37,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:07:37,704 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:07:37,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:07:37,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:07:37,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:07:37,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:07:37,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:07:37,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:07:37,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:07:37,707 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:07:37,707 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:07:37,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:07:37,707 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:07:37,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:07:37,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:07:37,708 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:07:37,708 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2024-10-13 10:07:38,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:07:38,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:07:38,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:07:38,090 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:07:38,091 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:07:38,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i [2024-10-13 10:07:39,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:07:39,990 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:07:39,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i [2024-10-13 10:07:40,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bef5a4dd/a0c26aa329ce4656b1a2896676e17d27/FLAG753bd2382 [2024-10-13 10:07:40,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bef5a4dd/a0c26aa329ce4656b1a2896676e17d27 [2024-10-13 10:07:40,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:07:40,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:07:40,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:07:40,036 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:07:40,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:07:40,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c841bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40, skipping insertion in model container [2024-10-13 10:07:40,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:07:40,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:07:40,538 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:07:40,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:07:40,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:07:40,606 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:07:40,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:07:40,716 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:07:40,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40 WrapperNode [2024-10-13 10:07:40,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:07:40,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:07:40,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:07:40,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:07:40,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,770 INFO L138 Inliner]: procedures = 229, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 98 [2024-10-13 10:07:40,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:07:40,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:07:40,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:07:40,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:07:40,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,828 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-10-13 10:07:40,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:07:40,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:07:40,853 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:07:40,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:07:40,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40" (1/1) ... [2024-10-13 10:07:40,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:07:40,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:07:40,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:07:40,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:07:40,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:07:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:07:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:07:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:07:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:07:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:07:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:07:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:07:40,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:07:40,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:07:40,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:07:40,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:07:40,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:07:40,948 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2024-10-13 10:07:40,948 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2024-10-13 10:07:40,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:07:40,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:07:41,101 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:07:41,104 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:07:41,498 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-13 10:07:41,498 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:07:41,538 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:07:41,538 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-13 10:07:41,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:07:41 BoogieIcfgContainer [2024-10-13 10:07:41,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:07:41,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:07:41,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:07:41,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:07:41,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:07:40" (1/3) ... [2024-10-13 10:07:41,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d255868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:07:41, skipping insertion in model container [2024-10-13 10:07:41,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:07:40" (2/3) ... [2024-10-13 10:07:41,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d255868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:07:41, skipping insertion in model container [2024-10-13 10:07:41,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:07:41" (3/3) ... [2024-10-13 10:07:41,548 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2024-10-13 10:07:41,565 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:07:41,565 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:07:41,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:07:41,618 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;@66b376f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:07:41,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:07:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 28 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:07:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:07:41,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:07:41,635 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:07:41,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:07:41,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:07:41,640 INFO L85 PathProgramCache]: Analyzing trace with hash 245910939, now seen corresponding path program 1 times [2024-10-13 10:07:41,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:07:41,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077859120] [2024-10-13 10:07:41,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:07:41,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:07:41,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:07:41,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:07:41,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 10:07:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:07:41,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 10:07:41,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:07:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:07:41,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:07:41,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:07:41,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077859120] [2024-10-13 10:07:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077859120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:07:41,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:07:41,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:07:41,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567535530] [2024-10-13 10:07:41,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:07:41,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:07:41,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:07:41,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:07:41,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:07:42,000 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 28 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:07:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:07:42,035 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2024-10-13 10:07:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:07:42,038 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-10-13 10:07:42,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:07:42,044 INFO L225 Difference]: With dead ends: 33 [2024-10-13 10:07:42,044 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 10:07:42,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 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-13 10:07:42,052 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:07:42,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:07:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 10:07:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 10:07:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:07:42,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-10-13 10:07:42,092 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 32 [2024-10-13 10:07:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:07:42,093 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-10-13 10:07:42,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:07:42,094 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-10-13 10:07:42,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:07:42,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:07:42,096 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:07:42,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 10:07:42,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:07:42,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:07:42,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:07:42,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1085825580, now seen corresponding path program 1 times [2024-10-13 10:07:42,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:07:42,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952824625] [2024-10-13 10:07:42,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:07:42,301 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-13 10:07:42,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:07:42,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:07:42,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 10:07:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:07:42,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:07:42,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:07:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:07:42,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:07:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:07:42,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:07:42,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952824625] [2024-10-13 10:07:42,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952824625] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:07:42,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:07:42,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2024-10-13 10:07:42,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418133713] [2024-10-13 10:07:42,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:07:42,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:07:42,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:07:42,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:07:42,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:07:42,732 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 10:07:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:07:43,094 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-10-13 10:07:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:07:43,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 34 [2024-10-13 10:07:43,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:07:43,100 INFO L225 Difference]: With dead ends: 42 [2024-10-13 10:07:43,100 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 10:07:43,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:07:43,101 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 63 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:07:43,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 122 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:07:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 10:07:43,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2024-10-13 10:07:43,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 10:07:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-10-13 10:07:43,110 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 34 [2024-10-13 10:07:43,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:07:43,110 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-13 10:07:43,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 10:07:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-10-13 10:07:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:07:43,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:07:43,112 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 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-13 10:07:43,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 10:07:43,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:07:43,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:07:43,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:07:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1073940570, now seen corresponding path program 1 times [2024-10-13 10:07:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:07:43,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863311612] [2024-10-13 10:07:43,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:07:43,319 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-13 10:07:43,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:07:43,322 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:07:43,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 10:07:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:07:43,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:07:43,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:07:43,603 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:07:43,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:07:43,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:07:43,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863311612] [2024-10-13 10:07:43,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863311612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:07:43,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:07:43,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:07:43,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548164483] [2024-10-13 10:07:43,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:07:43,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:07:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:07:43,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:07:43,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:07:43,614 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:07:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:07:43,861 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-10-13 10:07:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:07:43,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2024-10-13 10:07:43,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:07:43,863 INFO L225 Difference]: With dead ends: 44 [2024-10-13 10:07:43,863 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 10:07:43,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:07:43,864 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:07:43,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 96 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:07:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 10:07:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2024-10-13 10:07:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-13 10:07:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-10-13 10:07:43,871 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 34 [2024-10-13 10:07:43,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:07:43,871 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-10-13 10:07:43,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:07:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-10-13 10:07:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 10:07:43,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:07:43,873 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 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-13 10:07:43,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 10:07:44,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:07:44,074 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:07:44,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:07:44,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2057041998, now seen corresponding path program 1 times [2024-10-13 10:07:44,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:07:44,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255325366] [2024-10-13 10:07:44,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:07:44,077 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-13 10:07:44,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:07:44,085 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:07:44,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 10:07:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:07:44,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 10:07:44,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:07:44,397 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 11 treesize of output 7 [2024-10-13 10:07:44,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-13 10:07:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:07:44,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:07:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:07:44,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:07:44,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255325366] [2024-10-13 10:07:44,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255325366] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:07:44,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:07:44,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2024-10-13 10:07:44,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473487180] [2024-10-13 10:07:44,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:07:44,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 10:07:44,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:07:44,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 10:07:44,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:07:44,798 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:07:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:07:45,869 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-10-13 10:07:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:07:45,870 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2024-10-13 10:07:45,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:07:45,872 INFO L225 Difference]: With dead ends: 46 [2024-10-13 10:07:45,872 INFO L226 Difference]: Without dead ends: 46 [2024-10-13 10:07:45,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2024-10-13 10:07:45,874 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 61 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:07:45,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 164 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:07:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-13 10:07:45,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2024-10-13 10:07:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:07:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-10-13 10:07:45,884 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 35 [2024-10-13 10:07:45,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:07:45,884 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-10-13 10:07:45,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:07:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-10-13 10:07:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 10:07:45,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:07:45,886 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:07:45,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 10:07:46,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:07:46,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:07:46,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:07:46,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1826552102, now seen corresponding path program 2 times [2024-10-13 10:07:46,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:07:46,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847135694] [2024-10-13 10:07:46,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:07:46,089 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-13 10:07:46,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:07:46,092 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:07:46,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 10:07:46,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:07:46,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:07:46,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:07:46,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:07:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-13 10:07:46,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:07:46,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:07:46,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847135694] [2024-10-13 10:07:46,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847135694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:07:46,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:07:46,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:07:46,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049783956] [2024-10-13 10:07:46,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:07:46,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:07:46,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:07:46,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:07:46,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:07:46,332 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:07:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:07:46,521 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-10-13 10:07:46,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:07:46,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2024-10-13 10:07:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:07:46,524 INFO L225 Difference]: With dead ends: 42 [2024-10-13 10:07:46,524 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 10:07:46,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:07:46,525 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:07:46,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 148 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:07:46,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 10:07:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 10:07:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:07:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-10-13 10:07:46,535 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 36 [2024-10-13 10:07:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:07:46,536 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-13 10:07:46,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:07:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-10-13 10:07:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 10:07:46,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:07:46,537 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:07:46,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 10:07:46,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:07:46,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:07:46,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:07:46,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1769293800, now seen corresponding path program 1 times [2024-10-13 10:07:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:07:46,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928338234] [2024-10-13 10:07:46,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:07:46,739 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-13 10:07:46,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:07:46,740 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:07:46,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 10:07:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:07:46,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:07:46,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:07:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-13 10:07:46,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:07:46,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:07:46,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928338234] [2024-10-13 10:07:46,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928338234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:07:46,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:07:46,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:07:46,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96924088] [2024-10-13 10:07:46,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:07:46,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:07:46,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:07:46,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:07:46,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:07:46,971 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:07:47,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:07:47,228 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-10-13 10:07:47,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:07:47,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2024-10-13 10:07:47,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:07:47,230 INFO L225 Difference]: With dead ends: 52 [2024-10-13 10:07:47,230 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 10:07:47,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:07:47,231 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:07:47,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 126 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:07:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 10:07:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2024-10-13 10:07:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:07:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-10-13 10:07:47,235 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 36 [2024-10-13 10:07:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:07:47,235 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-10-13 10:07:47,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:07:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-10-13 10:07:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 10:07:47,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:07:47,236 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2024-10-13 10:07:47,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 10:07:47,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:07:47,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:07:47,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:07:47,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1924155111, now seen corresponding path program 1 times [2024-10-13 10:07:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:07:47,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43390245] [2024-10-13 10:07:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:07:47,439 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-13 10:07:47,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:07:47,440 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:07:47,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 10:07:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:07:47,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 10:07:47,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:07:47,670 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 11 treesize of output 7 [2024-10-13 10:07:47,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-13 10:07:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 10:07:47,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:07:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 10:07:48,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:07:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43390245] [2024-10-13 10:07:48,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43390245] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:07:48,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:07:48,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2024-10-13 10:07:48,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538815460] [2024-10-13 10:07:48,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:07:48,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 10:07:48,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:07:48,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 10:07:48,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:07:48,107 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:07:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:07:49,167 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-10-13 10:07:49,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:07:49,168 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-10-13 10:07:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:07:49,169 INFO L225 Difference]: With dead ends: 55 [2024-10-13 10:07:49,169 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 10:07:49,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 10:07:49,170 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 81 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:07:49,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 153 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:07:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 10:07:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2024-10-13 10:07:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 40 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:07:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2024-10-13 10:07:49,174 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 39 [2024-10-13 10:07:49,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:07:49,175 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2024-10-13 10:07:49,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:07:49,175 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2024-10-13 10:07:49,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-13 10:07:49,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:07:49,176 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:07:49,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 10:07:49,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:07:49,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:07:49,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:07:49,377 INFO L85 PathProgramCache]: Analyzing trace with hash -530680186, now seen corresponding path program 1 times [2024-10-13 10:07:49,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:07:49,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314473217] [2024-10-13 10:07:49,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:07:49,378 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-13 10:07:49,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:07:49,379 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:07:49,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 10:07:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:07:49,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 10:07:49,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:07:49,665 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 51 treesize of output 19 [2024-10-13 10:07:49,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:07:49,839 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 66 treesize of output 32 [2024-10-13 10:07:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-13 10:07:49,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:07:49,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:07:49,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314473217] [2024-10-13 10:07:49,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314473217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:07:49,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:07:49,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:07:49,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256745533] [2024-10-13 10:07:49,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:07:49,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:07:49,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:07:49,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:07:49,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:07:49,864 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:07:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:07:50,548 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-10-13 10:07:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:07:50,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-10-13 10:07:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:07:50,550 INFO L225 Difference]: With dead ends: 48 [2024-10-13 10:07:50,550 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 10:07:50,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:07:50,551 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:07:50,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 127 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:07:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 10:07:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-10-13 10:07:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 40 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:07:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2024-10-13 10:07:50,557 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 41 [2024-10-13 10:07:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:07:50,560 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2024-10-13 10:07:50,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:07:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2024-10-13 10:07:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 10:07:50,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:07:50,563 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2024-10-13 10:07:50,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 10:07:50,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:07:50,764 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:07:50,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:07:50,765 INFO L85 PathProgramCache]: Analyzing trace with hash 693506488, now seen corresponding path program 2 times [2024-10-13 10:07:50,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:07:50,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731202502] [2024-10-13 10:07:50,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:07:50,765 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-13 10:07:50,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:07:50,769 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:07:50,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 10:07:51,055 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:07:51,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:07:51,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 10:07:51,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:07:51,122 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 11 treesize of output 7 [2024-10-13 10:07:51,280 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 11 treesize of output 7 [2024-10-13 10:07:51,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-10-13 10:07:51,431 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-13 10:07:51,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-10-13 10:07:51,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 10:07:51,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:07:51,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2024-10-13 10:07:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 10:07:51,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:07:51,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:07:51,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2024-10-13 10:07:51,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:07:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731202502] [2024-10-13 10:07:51,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731202502] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:07:51,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2063558236] [2024-10-13 10:07:51,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:07:51,975 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 10:07:51,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 10:07:51,976 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 10:07:51,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-10-13 10:07:52,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:07:52,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:07:52,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-13 10:07:52,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:07:52,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-10-13 10:07:52,483 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 11 treesize of output 7 [2024-10-13 10:07:52,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-10-13 10:07:52,777 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 11 treesize of output 7 [2024-10-13 10:07:52,952 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-10-13 10:07:52,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-10-13 10:07:52,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2024-10-13 10:07:53,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 10:07:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 10:07:53,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:07:53,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:07:53,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2024-10-13 10:07:53,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2063558236] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:07:53,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:07:53,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2024-10-13 10:07:53,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874686029] [2024-10-13 10:07:53,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:07:53,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-13 10:07:53,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:07:53,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-13 10:07:53,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1008, Unknown=13, NotChecked=0, Total=1122 [2024-10-13 10:07:53,569 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 29 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 10:07:56,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:07:56,304 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-10-13 10:07:56,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-13 10:07:56,305 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 42 [2024-10-13 10:07:56,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:07:56,306 INFO L225 Difference]: With dead ends: 57 [2024-10-13 10:07:56,306 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 10:07:56,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=387, Invalid=2680, Unknown=13, NotChecked=0, Total=3080 [2024-10-13 10:07:56,309 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 130 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:07:56,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 260 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 10:07:56,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 10:07:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2024-10-13 10:07:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-13 10:07:56,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2024-10-13 10:07:56,314 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 42 [2024-10-13 10:07:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:07:56,314 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2024-10-13 10:07:56,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-13 10:07:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2024-10-13 10:07:56,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-13 10:07:56,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:07:56,315 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:07:56,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-10-13 10:07:56,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-13 10:07:56,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:07:56,716 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:07:56,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:07:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2134258260, now seen corresponding path program 3 times [2024-10-13 10:07:56,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:07:56,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040669146] [2024-10-13 10:07:56,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:07:56,717 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-13 10:07:56,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:07:56,718 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:07:56,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 10:07:56,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 10:07:56,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:07:56,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:07:56,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:07:56,956 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 13 treesize of output 9 [2024-10-13 10:07:56,961 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 19 treesize of output 1 [2024-10-13 10:08:19,377 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-10-13 10:08:19,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:08:19,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040669146] [2024-10-13 10:08:19,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-10-13 10:08:19,379 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-13 10:08:19,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-13 10:08:19,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:08:19,580 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 44 more [2024-10-13 10:08:19,585 INFO L158 Benchmark]: Toolchain (without parser) took 39551.47ms. Allocated memory was 62.9MB in the beginning and 119.5MB in the end (delta: 56.6MB). Free memory was 36.2MB in the beginning and 40.2MB in the end (delta: -4.0MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2024-10-13 10:08:19,585 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 41.9MB. Free memory was 22.8MB in the beginning and 22.8MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:08:19,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.48ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 36.1MB in the beginning and 50.4MB in the end (delta: -14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 10:08:19,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.07ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 47.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:08:19,586 INFO L158 Benchmark]: Boogie Preprocessor took 78.61ms. Allocated memory is still 75.5MB. Free memory was 47.8MB in the beginning and 44.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:08:19,586 INFO L158 Benchmark]: RCFGBuilder took 686.05ms. Allocated memory is still 75.5MB. Free memory was 44.5MB in the beginning and 41.7MB in the end (delta: 2.7MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-10-13 10:08:19,587 INFO L158 Benchmark]: TraceAbstraction took 38043.13ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 41.0MB in the beginning and 40.2MB in the end (delta: 765.4kB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2024-10-13 10:08:19,589 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.16ms. Allocated memory is still 41.9MB. Free memory was 22.8MB in the beginning and 22.8MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.48ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 36.1MB in the beginning and 50.4MB in the end (delta: -14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.07ms. Allocated memory is still 75.5MB. Free memory was 50.0MB in the beginning and 47.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.61ms. Allocated memory is still 75.5MB. Free memory was 47.8MB in the beginning and 44.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 686.05ms. Allocated memory is still 75.5MB. Free memory was 44.5MB in the beginning and 41.7MB in the end (delta: 2.7MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 38043.13ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 41.0MB in the beginning and 40.2MB in the end (delta: 765.4kB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")