./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.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/uthash-2.0.2/uthash_BER_nondet_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:08:54,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:08:54,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:08:54,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:08:54,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:08:54,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:08:54,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:08:54,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:08:54,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:08:54,648 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:08:54,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:08:54,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:08:54,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:08:54,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:08:54,650 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:08:54,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:08:54,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:08:54,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:08:54,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:08:54,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:08:54,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:08:54,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:08:54,653 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:08:54,653 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:08:54,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:08:54,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:08:54,656 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:08:54,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:08:54,656 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:08:54,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:08:54,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:08:54,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:08:54,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:08:54,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:08:54,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:08:54,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:08:54,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:08:54,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:08:54,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:08:54,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:08:54,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:08:54,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:08:54,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:08:54,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:08:54,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:08:54,666 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-10-13 10:08:54,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:08:54,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:08:54,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:08:54,958 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:08:54,958 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:08:54,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2024-10-13 10:08:56,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:08:56,717 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:08:56,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2024-10-13 10:08:56,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1565e23/f1c725164f714f6fb5d9640c49123fae/FLAG6babd9fe7 [2024-10-13 10:08:56,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b1565e23/f1c725164f714f6fb5d9640c49123fae [2024-10-13 10:08:56,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:08:56,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:08:56,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:08:56,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:08:56,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:08:56,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:08:56" (1/1) ... [2024-10-13 10:08:56,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5894cc70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:08:56, skipping insertion in model container [2024-10-13 10:08:56,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:08:56" (1/1) ... [2024-10-13 10:08:57,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:08:57,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:08:57,650 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:08:57,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2f4fc490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:08:57, skipping insertion in model container [2024-10-13 10:08:57,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:08:57,655 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:08:57,657 INFO L158 Benchmark]: Toolchain (without parser) took 671.16ms. Allocated memory is still 180.4MB. Free memory was 111.9MB in the beginning and 138.7MB in the end (delta: -26.8MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-10-13 10:08:57,657 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:08:57,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 668.15ms. Allocated memory is still 180.4MB. Free memory was 111.6MB in the beginning and 139.4MB in the end (delta: -27.9MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-10-13 10:08:57,663 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.20ms. Allocated memory is still 100.7MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 668.15ms. Allocated memory is still 180.4MB. Free memory was 111.6MB in the beginning and 139.4MB in the end (delta: -27.9MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 740]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:08:59,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:08:59,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:08:59,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:08:59,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:08:59,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:08:59,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:08:59,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:08:59,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:08:59,936 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:08:59,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:08:59,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:08:59,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:08:59,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:08:59,938 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:08:59,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:08:59,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:08:59,942 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:08:59,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:08:59,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:08:59,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:08:59,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:08:59,946 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:08:59,946 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:08:59,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:08:59,947 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:08:59,947 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:08:59,948 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:08:59,948 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:08:59,948 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:08:59,948 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:08:59,949 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:08:59,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:08:59,949 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:08:59,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:08:59,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:08:59,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:08:59,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:08:59,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:08:59,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:08:59,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:08:59,952 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:08:59,952 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:08:59,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:08:59,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:08:59,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:08:59,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:08:59,953 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:08:59,953 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-10-13 10:09:00,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:09:00,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:09:00,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:09:00,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:09:00,340 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:09:00,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2024-10-13 10:09:02,043 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:09:02,410 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:09:02,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2024-10-13 10:09:02,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61404d791/69ddcb66da364a9fa0b28c8ef7234676/FLAG11f1b246a [2024-10-13 10:09:02,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61404d791/69ddcb66da364a9fa0b28c8ef7234676 [2024-10-13 10:09:02,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:09:02,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:09:02,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:09:02,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:09:02,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:09:02,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:09:02" (1/1) ... [2024-10-13 10:09:02,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fd3f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:09:02, skipping insertion in model container [2024-10-13 10:09:02,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:09:02" (1/1) ... [2024-10-13 10:09:02,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:09:03,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:09:03,188 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:09:03,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:09:03,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:09:03,326 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:09:03,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:09:03,473 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:09:03,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:09:03 WrapperNode [2024-10-13 10:09:03,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:09:03,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:09:03,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:09:03,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:09:03,483 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:09:03" (1/1) ... [2024-10-13 10:09:03,535 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:09:03" (1/1) ... [2024-10-13 10:09:03,620 INFO L138 Inliner]: procedures = 179, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1132 [2024-10-13 10:09:03,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:09:03,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:09:03,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:09:03,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:09:03,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:09:03" (1/1) ... [2024-10-13 10:09:03,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:09:03" (1/1) ... [2024-10-13 10:09:03,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:09:03" (1/1) ... [2024-10-13 10:09:03,758 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-10-13 10:09:03,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:09:03" (1/1) ... [2024-10-13 10:09:03,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:09:03" (1/1) ... [2024-10-13 10:09:03,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:09:03" (1/1) ... [2024-10-13 10:09:03,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:09:03" (1/1) ... [2024-10-13 10:09:03,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:09:03" (1/1) ... [2024-10-13 10:09:03,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:09:03" (1/1) ... [2024-10-13 10:09:03,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:09:03,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:09:03,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:09:03,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:09:03,824 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:09:03" (1/1) ... [2024-10-13 10:09:03,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:09:03,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:09:03,866 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:09:03,869 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:09:03,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 10:09:03,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 10:09:03,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:09:03,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:09:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 10:09:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 10:09:03,911 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 10:09:03,911 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 10:09:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:09:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:09:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:09:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:09:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:09:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:09:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:09:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:09:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:09:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:09:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:09:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:09:03,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:09:04,149 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:09:04,154 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:09:17,469 INFO L? ?]: Removed 173 outVars from TransFormulas that were not future-live. [2024-10-13 10:09:17,470 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:09:17,519 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:09:17,519 INFO L314 CfgBuilder]: Removed 60 assume(true) statements. [2024-10-13 10:09:17,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:09:17 BoogieIcfgContainer [2024-10-13 10:09:17,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:09:17,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:09:17,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:09:17,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:09:17,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:09:02" (1/3) ... [2024-10-13 10:09:17,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba5abbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:09:17, skipping insertion in model container [2024-10-13 10:09:17,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:09:03" (2/3) ... [2024-10-13 10:09:17,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba5abbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:09:17, skipping insertion in model container [2024-10-13 10:09:17,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:09:17" (3/3) ... [2024-10-13 10:09:17,535 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-1.i [2024-10-13 10:09:17,550 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:09:17,551 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:09:17,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:09:17,602 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;@6f89a5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:09:17,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:09:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 183 states have (on average 1.6666666666666667) internal successors, (305), 185 states have internal predecessors, (305), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:09:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:09:17,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:09:17,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:09:17,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:09:17,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:09:17,621 INFO L85 PathProgramCache]: Analyzing trace with hash 803871, now seen corresponding path program 1 times [2024-10-13 10:09:17,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:09:17,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638421289] [2024-10-13 10:09:17,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:09:17,636 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:09:17,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:09:17,640 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:09:17,642 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:09:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:09:17,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 10:09:17,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:09:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:09:17,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:09:17,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:09:17,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638421289] [2024-10-13 10:09:17,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638421289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:09:17,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:09:17,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:09:17,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126345809] [2024-10-13 10:09:17,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:09:17,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:09:17,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:09:17,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:09:17,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:09:17,894 INFO L87 Difference]: Start difference. First operand has 193 states, 183 states have (on average 1.6666666666666667) internal successors, (305), 185 states have internal predecessors, (305), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:09:21,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:09:26,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:09:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:09:26,880 INFO L93 Difference]: Finished difference Result 204 states and 262 transitions. [2024-10-13 10:09:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:09:26,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 10:09:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:09:26,908 INFO L225 Difference]: With dead ends: 204 [2024-10-13 10:09:26,910 INFO L226 Difference]: Without dead ends: 201 [2024-10-13 10:09:26,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:09:26,914 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 14 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:09:26,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 473 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-10-13 10:09:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-13 10:09:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2024-10-13 10:09:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 189 states have (on average 1.2857142857142858) internal successors, (243), 190 states have internal predecessors, (243), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 10:09:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 255 transitions. [2024-10-13 10:09:27,009 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 255 transitions. Word has length 3 [2024-10-13 10:09:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:09:27,009 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 255 transitions. [2024-10-13 10:09:27,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:09:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 255 transitions. [2024-10-13 10:09:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:09:27,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:09:27,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:09:27,015 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:09:27,211 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:09:27,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:09:27,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:09:27,213 INFO L85 PathProgramCache]: Analyzing trace with hash 986954024, now seen corresponding path program 1 times [2024-10-13 10:09:27,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:09:27,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220853433] [2024-10-13 10:09:27,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:09:27,214 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:09:27,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:09:27,217 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:09:27,217 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:09:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:09:27,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:09:27,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:09:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:09:27,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:09:27,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:09:27,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220853433] [2024-10-13 10:09:27,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220853433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:09:27,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:09:27,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:09:27,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439279224] [2024-10-13 10:09:27,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:09:27,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:09:27,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:09:27,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:09:27,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:09:27,458 INFO L87 Difference]: Start difference. First operand 198 states and 255 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:09:30,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:09:34,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:09:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:09:36,451 INFO L93 Difference]: Finished difference Result 318 states and 410 transitions. [2024-10-13 10:09:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:09:36,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 10:09:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:09:36,457 INFO L225 Difference]: With dead ends: 318 [2024-10-13 10:09:36,457 INFO L226 Difference]: Without dead ends: 316 [2024-10-13 10:09:36,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:09:36,458 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 156 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:09:36,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 656 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 1 Unknown, 0 Unchecked, 9.0s Time] [2024-10-13 10:09:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-13 10:09:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-10-13 10:09:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 305 states have internal predecessors, (390), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:09:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 408 transitions. [2024-10-13 10:09:36,496 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 408 transitions. Word has length 10 [2024-10-13 10:09:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:09:36,496 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 408 transitions. [2024-10-13 10:09:36,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:09:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 408 transitions. [2024-10-13 10:09:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 10:09:36,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:09:36,503 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:09:36,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 10:09:36,703 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:09:36,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:09:36,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:09:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash -165551854, now seen corresponding path program 1 times [2024-10-13 10:09:36,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:09:36,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644690032] [2024-10-13 10:09:36,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:09:36,707 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:09:36,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:09:36,710 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:09:36,711 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:09:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:09:37,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:09:37,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:09:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:09:37,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:09:37,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:09:37,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644690032] [2024-10-13 10:09:37,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644690032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:09:37,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:09:37,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:09:37,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829478780] [2024-10-13 10:09:37,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:09:37,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:09:37,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:09:37,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:09:37,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:09:37,493 INFO L87 Difference]: Start difference. First operand 316 states and 408 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:09:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:09:37,651 INFO L93 Difference]: Finished difference Result 322 states and 398 transitions. [2024-10-13 10:09:37,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:09:37,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 126 [2024-10-13 10:09:37,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:09:37,654 INFO L225 Difference]: With dead ends: 322 [2024-10-13 10:09:37,654 INFO L226 Difference]: Without dead ends: 322 [2024-10-13 10:09:37,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:09:37,655 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 33 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:09:37,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 615 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:09:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-13 10:09:37,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2024-10-13 10:09:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 310 states have (on average 1.2258064516129032) internal successors, (380), 311 states have internal predecessors, (380), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:09:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 398 transitions. [2024-10-13 10:09:37,670 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 398 transitions. Word has length 126 [2024-10-13 10:09:37,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:09:37,671 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 398 transitions. [2024-10-13 10:09:37,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:09:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 398 transitions. [2024-10-13 10:09:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 10:09:37,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:09:37,673 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:09:37,690 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:09:37,874 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:09:37,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:09:37,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:09:37,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2096450624, now seen corresponding path program 1 times [2024-10-13 10:09:37,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:09:37,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287822162] [2024-10-13 10:09:37,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:09:37,878 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:09:37,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:09:37,881 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:09:37,895 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:09:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:09:38,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:09:38,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:09:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:09:38,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:09:38,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:09:38,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287822162] [2024-10-13 10:09:38,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287822162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:09:38,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:09:38,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:09:38,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089993669] [2024-10-13 10:09:38,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:09:38,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:09:38,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:09:38,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:09:38,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:09:38,580 INFO L87 Difference]: Start difference. First operand 322 states and 398 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:09:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:09:38,704 INFO L93 Difference]: Finished difference Result 310 states and 378 transitions. [2024-10-13 10:09:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:09:38,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 126 [2024-10-13 10:09:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:09:38,707 INFO L225 Difference]: With dead ends: 310 [2024-10-13 10:09:38,707 INFO L226 Difference]: Without dead ends: 310 [2024-10-13 10:09:38,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:09:38,708 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 9 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:09:38,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 616 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:09:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-13 10:09:38,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-10-13 10:09:38,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 298 states have (on average 1.2080536912751678) internal successors, (360), 299 states have internal predecessors, (360), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:09:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 378 transitions. [2024-10-13 10:09:38,746 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 378 transitions. Word has length 126 [2024-10-13 10:09:38,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:09:38,747 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 378 transitions. [2024-10-13 10:09:38,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:09:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 378 transitions. [2024-10-13 10:09:38,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 10:09:38,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:09:38,753 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:09:38,770 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:09:38,953 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:09:38,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:09:38,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:09:38,955 INFO L85 PathProgramCache]: Analyzing trace with hash 835895752, now seen corresponding path program 1 times [2024-10-13 10:09:38,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:09:38,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547367094] [2024-10-13 10:09:38,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:09:38,956 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:09:38,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:09:38,957 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:09:38,958 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:09:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:09:39,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:09:39,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:09:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:09:39,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:09:39,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:09:39,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547367094] [2024-10-13 10:09:39,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547367094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:09:39,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:09:39,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:09:39,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683221138] [2024-10-13 10:09:39,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:09:39,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:09:39,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:09:39,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:09:39,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:09:39,927 INFO L87 Difference]: Start difference. First operand 310 states and 378 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:09:40,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:09:40,407 INFO L93 Difference]: Finished difference Result 308 states and 375 transitions. [2024-10-13 10:09:40,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:09:40,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 126 [2024-10-13 10:09:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:09:40,414 INFO L225 Difference]: With dead ends: 308 [2024-10-13 10:09:40,414 INFO L226 Difference]: Without dead ends: 308 [2024-10-13 10:09:40,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:09:40,415 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:09:40,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:09:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-13 10:09:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-13 10:09:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 296 states have (on average 1.2060810810810811) internal successors, (357), 297 states have internal predecessors, (357), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:09:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 375 transitions. [2024-10-13 10:09:40,426 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 375 transitions. Word has length 126 [2024-10-13 10:09:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:09:40,427 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 375 transitions. [2024-10-13 10:09:40,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:09:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 375 transitions. [2024-10-13 10:09:40,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 10:09:40,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:09:40,430 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:40,446 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:09:40,630 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:09:40,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:09:40,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:09:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash -193607656, now seen corresponding path program 1 times [2024-10-13 10:09:40,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:09:40,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791121648] [2024-10-13 10:09:40,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:09:40,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:09:40,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:09:40,634 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:09:40,635 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:09:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:09:41,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:09:41,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:09:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 10:09:41,299 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:09:41,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:09:41,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791121648] [2024-10-13 10:09:41,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791121648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:09:41,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:09:41,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:09:41,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814512283] [2024-10-13 10:09:41,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:09:41,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:09:41,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:09:41,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:09:41,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:09:41,302 INFO L87 Difference]: Start difference. First operand 308 states and 375 transitions. Second operand has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:09:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:09:41,371 INFO L93 Difference]: Finished difference Result 310 states and 380 transitions. [2024-10-13 10:09:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:09:41,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 139 [2024-10-13 10:09:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:09:41,373 INFO L225 Difference]: With dead ends: 310 [2024-10-13 10:09:41,373 INFO L226 Difference]: Without dead ends: 310 [2024-10-13 10:09:41,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:09:41,374 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:09:41,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 665 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:09:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-13 10:09:41,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-10-13 10:09:41,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 297 states have (on average 1.2087542087542087) internal successors, (359), 299 states have internal predecessors, (359), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:09:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 380 transitions. [2024-10-13 10:09:41,384 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 380 transitions. Word has length 139 [2024-10-13 10:09:41,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:09:41,385 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 380 transitions. [2024-10-13 10:09:41,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:09:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 380 transitions. [2024-10-13 10:09:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 10:09:41,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:09:41,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:41,403 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 10:09:41,587 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:09:41,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:09:41,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:09:41,589 INFO L85 PathProgramCache]: Analyzing trace with hash 271945928, now seen corresponding path program 1 times [2024-10-13 10:09:41,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:09:41,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787348122] [2024-10-13 10:09:41,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:09:41,590 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:09:41,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:09:41,591 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:09:41,592 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:09:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:09:42,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:09:42,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:09:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-13 10:09:42,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:09:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:09:42,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:09:42,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787348122] [2024-10-13 10:09:42,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787348122] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:09:42,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:09:42,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:09:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991540982] [2024-10-13 10:09:42,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:09:42,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:09:42,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:09:42,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:09:42,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:09:42,514 INFO L87 Difference]: Start difference. First operand 310 states and 380 transitions. Second operand has 8 states, 6 states have (on average 22.5) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:09:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:09:42,843 INFO L93 Difference]: Finished difference Result 319 states and 396 transitions. [2024-10-13 10:09:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:09:42,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 22.5) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 143 [2024-10-13 10:09:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:09:42,846 INFO L225 Difference]: With dead ends: 319 [2024-10-13 10:09:42,846 INFO L226 Difference]: Without dead ends: 319 [2024-10-13 10:09:42,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:09:42,848 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 4 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:09:42,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1313 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:09:42,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-13 10:09:42,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 318. [2024-10-13 10:09:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 304 states have (on average 1.2236842105263157) internal successors, (372), 306 states have internal predecessors, (372), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:09:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 393 transitions. [2024-10-13 10:09:42,858 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 393 transitions. Word has length 143 [2024-10-13 10:09:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:09:42,858 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 393 transitions. [2024-10-13 10:09:42,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 22.5) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:09:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 393 transitions. [2024-10-13 10:09:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 10:09:42,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:09:42,861 INFO L215 NwaCegarLoop]: trace histogram [12, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:42,881 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:09:43,061 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:09:43,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:09:43,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:09:43,063 INFO L85 PathProgramCache]: Analyzing trace with hash -511691496, now seen corresponding path program 2 times [2024-10-13 10:09:43,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:09:43,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484259249] [2024-10-13 10:09:43,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:09:43,064 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:09:43,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:09:43,065 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:09:43,066 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:09:43,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:09:43,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:09:43,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:09:43,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:09:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-13 10:09:43,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:09:44,145 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-13 10:09:44,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:09:44,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484259249] [2024-10-13 10:09:44,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484259249] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:09:44,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:09:44,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:09:44,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17003292] [2024-10-13 10:09:44,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:09:44,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:09:44,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:09:44,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:09:44,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:09:44,148 INFO L87 Difference]: Start difference. First operand 318 states and 393 transitions. Second operand has 14 states, 12 states have (on average 11.75) internal successors, (141), 14 states have internal predecessors, (141), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:09:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:09:44,987 INFO L93 Difference]: Finished difference Result 330 states and 414 transitions. [2024-10-13 10:09:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:09:44,989 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 11.75) internal successors, (141), 14 states have internal predecessors, (141), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 151 [2024-10-13 10:09:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:09:44,991 INFO L225 Difference]: With dead ends: 330 [2024-10-13 10:09:44,991 INFO L226 Difference]: Without dead ends: 328 [2024-10-13 10:09:44,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:09:44,992 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 8 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:09:44,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1321 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:09:44,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-13 10:09:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2024-10-13 10:09:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 313 states have (on average 1.2268370607028753) internal successors, (384), 315 states have internal predecessors, (384), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:09:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 405 transitions. [2024-10-13 10:09:45,009 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 405 transitions. Word has length 151 [2024-10-13 10:09:45,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:09:45,009 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 405 transitions. [2024-10-13 10:09:45,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 11.75) internal successors, (141), 14 states have internal predecessors, (141), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:09:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 405 transitions. [2024-10-13 10:09:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-13 10:09:45,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:09:45,012 INFO L215 NwaCegarLoop]: trace histogram [30, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:45,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 10:09:45,212 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:09:45,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:09:45,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:09:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash -528146076, now seen corresponding path program 3 times [2024-10-13 10:09:45,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:09:45,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754115366] [2024-10-13 10:09:45,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:09:45,215 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:09:45,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:09:45,216 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:09:45,218 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:09:45,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:09:45,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:09:45,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:09:45,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:09:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-10-13 10:09:46,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:09:46,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:09:46,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754115366] [2024-10-13 10:09:46,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754115366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:09:46,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:09:46,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:09:46,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479481256] [2024-10-13 10:09:46,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:09:46,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:09:46,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:09:46,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:09:46,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:09:46,064 INFO L87 Difference]: Start difference. First operand 327 states and 405 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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:09:50,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:09:54,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:09:59,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:10:03,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:10:05,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:10:10,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 10:10:10,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:10:10,787 INFO L93 Difference]: Finished difference Result 335 states and 413 transitions. [2024-10-13 10:10:10,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:10:10,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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 169 [2024-10-13 10:10:10,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:10:10,790 INFO L225 Difference]: With dead ends: 335 [2024-10-13 10:10:10,791 INFO L226 Difference]: Without dead ends: 335 [2024-10-13 10:10:10,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:10:10,791 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 284 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:10:10,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 442 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 5 Unknown, 0 Unchecked, 24.7s Time] [2024-10-13 10:10:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-13 10:10:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 328. [2024-10-13 10:10:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 314 states have (on average 1.2229299363057324) internal successors, (384), 316 states have internal predecessors, (384), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:10:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 405 transitions. [2024-10-13 10:10:10,803 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 405 transitions. Word has length 169 [2024-10-13 10:10:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:10:10,804 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 405 transitions. [2024-10-13 10:10:10,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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:10:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 405 transitions. [2024-10-13 10:10:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 10:10:10,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:10:10,806 INFO L215 NwaCegarLoop]: trace histogram [30, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:10,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 10:10:11,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:10:11,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:10:11,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:10:11,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1501254283, now seen corresponding path program 1 times [2024-10-13 10:10:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:10:11,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171639938] [2024-10-13 10:10:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:10:11,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:10:11,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:10:11,012 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:10:11,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 10:10:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:10:11,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:10:11,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:10:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 260 proven. 55 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-10-13 10:10:12,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:10:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 1 proven. 311 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-10-13 10:10:12,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:10:12,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171639938] [2024-10-13 10:10:12,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171639938] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:10:12,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:10:12,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:10:12,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415109639] [2024-10-13 10:10:12,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:10:12,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:10:12,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:10:12,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:10:12,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:10:12,659 INFO L87 Difference]: Start difference. First operand 328 states and 405 transitions. Second operand has 26 states, 24 states have (on average 6.5) internal successors, (156), 26 states have internal predecessors, (156), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:10:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:10:14,678 INFO L93 Difference]: Finished difference Result 349 states and 444 transitions. [2024-10-13 10:10:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 10:10:14,679 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.5) internal successors, (156), 26 states have internal predecessors, (156), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2024-10-13 10:10:14,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:10:14,680 INFO L225 Difference]: With dead ends: 349 [2024-10-13 10:10:14,680 INFO L226 Difference]: Without dead ends: 347 [2024-10-13 10:10:14,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:10:14,682 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 14 mSDsluCounter, 2629 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:10:14,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2852 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 10:10:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-13 10:10:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 346. [2024-10-13 10:10:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 332 states have (on average 1.2289156626506024) internal successors, (408), 334 states have internal predecessors, (408), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:10:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 429 transitions. [2024-10-13 10:10:14,694 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 429 transitions. Word has length 172 [2024-10-13 10:10:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:10:14,695 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 429 transitions. [2024-10-13 10:10:14,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.5) internal successors, (156), 26 states have internal predecessors, (156), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:10:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 429 transitions. [2024-10-13 10:10:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-13 10:10:14,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:10:14,697 INFO L215 NwaCegarLoop]: trace histogram [66, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:14,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 10:10:14,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:10:14,898 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:10:14,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:10:14,899 INFO L85 PathProgramCache]: Analyzing trace with hash -220824203, now seen corresponding path program 2 times [2024-10-13 10:10:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:10:14,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469852765] [2024-10-13 10:10:14,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:10:14,900 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:10:14,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:10:14,901 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:10:14,902 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:10:15,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:10:15,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:10:15,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 1501 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:10:15,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:10:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 1088 proven. 253 refuted. 0 times theorem prover too weak. 1087 trivial. 0 not checked. [2024-10-13 10:10:16,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:10:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 1 proven. 1337 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2024-10-13 10:10:18,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:10:18,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469852765] [2024-10-13 10:10:18,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469852765] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:10:18,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:10:18,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 10:10:18,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944089756] [2024-10-13 10:10:18,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:10:18,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:10:18,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:10:18,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:10:18,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:10:18,697 INFO L87 Difference]: Start difference. First operand 346 states and 429 transitions. Second operand has 50 states, 48 states have (on average 3.75) internal successors, (180), 50 states have internal predecessors, (180), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:10:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:10:27,011 INFO L93 Difference]: Finished difference Result 383 states and 500 transitions. [2024-10-13 10:10:27,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 10:10:27,012 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.75) internal successors, (180), 50 states have internal predecessors, (180), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 208 [2024-10-13 10:10:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:10:27,014 INFO L225 Difference]: With dead ends: 383 [2024-10-13 10:10:27,014 INFO L226 Difference]: Without dead ends: 381 [2024-10-13 10:10:27,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 10:10:27,017 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 25 mSDsluCounter, 5040 mSDsCounter, 0 mSdLazyCounter, 2071 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5263 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:10:27,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5263 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2071 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-13 10:10:27,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-13 10:10:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 380. [2024-10-13 10:10:27,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 366 states have (on average 1.2404371584699454) internal successors, (454), 368 states have internal predecessors, (454), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-13 10:10:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 475 transitions. [2024-10-13 10:10:27,028 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 475 transitions. Word has length 208 [2024-10-13 10:10:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:10:27,029 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 475 transitions. [2024-10-13 10:10:27,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.75) internal successors, (180), 50 states have internal predecessors, (180), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 10:10:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 475 transitions. [2024-10-13 10:10:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-13 10:10:27,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:10:27,045 INFO L215 NwaCegarLoop]: trace histogram [134, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:27,075 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:10:27,245 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:10:27,246 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:10:27,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:10:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1770165621, now seen corresponding path program 3 times [2024-10-13 10:10:27,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:10:27,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710997964] [2024-10-13 10:10:27,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:10:27,248 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:10:27,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:10:27,249 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:10:27,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process