./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:16:12,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:16:12,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:16:12,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:16:12,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:16:12,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:16:12,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:16:12,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:16:12,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:16:12,733 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:16:12,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:16:12,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:16:12,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:16:12,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:16:12,735 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:16:12,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:16:12,736 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:16:12,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:16:12,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:16:12,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:16:12,737 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:16:12,739 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:16:12,739 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:16:12,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:16:12,740 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:16:12,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:16:12,740 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:16:12,741 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:16:12,741 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:16:12,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:16:12,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:16:12,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:16:12,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:16:12,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:16:12,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:16:12,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:16:12,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:16:12,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:16:12,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:16:12,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:16:12,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:16:12,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:16:12,745 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2024-11-19 09:16:13,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:16:13,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:16:13,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:16:13,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:16:13,086 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:16:13,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2024-11-19 09:16:14,538 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:16:14,881 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:16:14,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2024-11-19 09:16:14,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8764ba685/7364d3a226034b0885555e9e04ea4e73/FLAG9b7615ad4 [2024-11-19 09:16:14,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8764ba685/7364d3a226034b0885555e9e04ea4e73 [2024-11-19 09:16:14,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:16:14,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:16:14,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:16:14,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:16:14,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:16:14,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:14" (1/1) ... [2024-11-19 09:16:14,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ed858e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:14, skipping insertion in model container [2024-11-19 09:16:14,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:14" (1/1) ... [2024-11-19 09:16:14,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:16:15,576 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,621 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,627 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,634 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,642 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,678 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,681 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,684 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,684 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,689 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,691 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,692 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,693 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,698 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:15,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:16:15,730 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-11-19 09:16:15,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6d837c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:15, skipping insertion in model container [2024-11-19 09:16:15,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:16:15,731 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:16:15,734 INFO L158 Benchmark]: Toolchain (without parser) took 810.96ms. Allocated memory is still 144.7MB. Free memory was 106.8MB in the beginning and 81.0MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 09:16:15,734 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:16:15,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 808.60ms. Allocated memory is still 144.7MB. Free memory was 106.1MB in the beginning and 81.0MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 09:16:15,736 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.12ms. Allocated memory is still 109.1MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 808.60ms. Allocated memory is still 144.7MB. Free memory was 106.1MB in the beginning and 81.0MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: 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/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:16:17,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:16:17,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:16:17,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:16:17,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:16:17,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:16:17,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:16:17,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:16:17,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:16:17,928 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:16:17,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:16:17,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:16:17,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:16:17,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:16:17,932 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:16:17,932 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:16:17,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:16:17,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:16:17,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:16:17,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:16:17,936 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:16:17,936 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:16:17,939 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:16:17,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:16:17,940 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:16:17,940 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:16:17,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:16:17,941 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:16:17,941 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:16:17,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:16:17,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:16:17,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:16:17,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:16:17,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:16:17,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:16:17,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:16:17,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:16:17,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:16:17,950 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:16:17,951 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:16:17,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:16:17,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:16:17,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:16:17,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:16:17,954 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2024-11-19 09:16:18,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:16:18,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:16:18,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:16:18,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:16:18,324 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:16:18,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2024-11-19 09:16:19,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:16:20,260 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:16:20,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2024-11-19 09:16:20,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5efd7cfe1/8dfc8b82220a4291b2873cdf4c890bed/FLAGd40a2ba1e [2024-11-19 09:16:20,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5efd7cfe1/8dfc8b82220a4291b2873cdf4c890bed [2024-11-19 09:16:20,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:16:20,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:16:20,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:16:20,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:16:20,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:16:20,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:20" (1/1) ... [2024-11-19 09:16:20,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e283f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:20, skipping insertion in model container [2024-11-19 09:16:20,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:20" (1/1) ... [2024-11-19 09:16:20,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:16:20,995 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,019 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,022 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,025 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,031 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,101 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,101 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,104 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,104 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,110 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,115 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,116 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,118 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,126 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:16:21,148 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:16:21,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:16:21,197 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,214 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,220 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,226 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,232 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,257 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,257 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,259 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,263 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,265 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,270 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,270 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,271 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,273 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:16:21,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:16:21,288 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:16:21,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:16:21,470 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:16:21,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21 WrapperNode [2024-11-19 09:16:21,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:16:21,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:16:21,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:16:21,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:16:21,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21" (1/1) ... [2024-11-19 09:16:21,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21" (1/1) ... [2024-11-19 09:16:21,616 INFO L138 Inliner]: procedures = 286, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1078 [2024-11-19 09:16:21,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:16:21,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:16:21,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:16:21,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:16:21,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21" (1/1) ... [2024-11-19 09:16:21,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21" (1/1) ... [2024-11-19 09:16:21,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21" (1/1) ... [2024-11-19 09:16:21,749 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 12, 220, 34]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 54 writes are split as follows [0, 1, 49, 4]. [2024-11-19 09:16:21,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21" (1/1) ... [2024-11-19 09:16:21,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21" (1/1) ... [2024-11-19 09:16:21,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21" (1/1) ... [2024-11-19 09:16:21,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21" (1/1) ... [2024-11-19 09:16:21,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21" (1/1) ... [2024-11-19 09:16:21,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21" (1/1) ... [2024-11-19 09:16:21,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:16:21,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:16:21,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:16:21,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:16:21,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21" (1/1) ... [2024-11-19 09:16:21,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:16:21,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:16:21,887 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-11-19 09:16:21,890 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-11-19 09:16:21,941 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 09:16:21,942 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 09:16:21,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 09:16:21,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 09:16:21,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 09:16:21,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 09:16:21,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:16:21,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:16:21,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:16:21,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 09:16:21,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:16:21,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:16:21,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 09:16:21,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 09:16:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 09:16:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-19 09:16:21,944 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-19 09:16:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 09:16:21,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 09:16:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:16:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:16:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-19 09:16:21,944 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-19 09:16:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:16:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:16:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:16:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 09:16:21,944 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-19 09:16:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-19 09:16:21,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:16:21,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:16:22,240 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:16:22,243 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:16:26,314 INFO L? ?]: Removed 1086 outVars from TransFormulas that were not future-live. [2024-11-19 09:16:26,314 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:16:26,351 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:16:26,351 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 09:16:26,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:16:26 BoogieIcfgContainer [2024-11-19 09:16:26,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:16:26,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:16:26,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:16:26,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:16:26,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:16:20" (1/3) ... [2024-11-19 09:16:26,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3d3735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:16:26, skipping insertion in model container [2024-11-19 09:16:26,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:21" (2/3) ... [2024-11-19 09:16:26,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3d3735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:16:26, skipping insertion in model container [2024-11-19 09:16:26,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:16:26" (3/3) ... [2024-11-19 09:16:26,366 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-1.i [2024-11-19 09:16:26,385 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:16:26,385 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 522 error locations. [2024-11-19 09:16:26,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:16:26,484 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a348a0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:16:26,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 522 error locations. [2024-11-19 09:16:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 1085 states, 540 states have (on average 2.198148148148148) internal successors, (1187), 1065 states have internal predecessors, (1187), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-19 09:16:26,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:16:26,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:26,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:16:26,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:26,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash 85465, now seen corresponding path program 1 times [2024-11-19 09:16:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:26,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994370470] [2024-11-19 09:16:26,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:26,525 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-11-19 09:16:26,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:26,529 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-11-19 09:16:26,548 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-11-19 09:16:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:26,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:16:26,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:26,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:16:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:26,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:26,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:26,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994370470] [2024-11-19 09:16:26,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994370470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:26,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:26,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:16:26,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996134108] [2024-11-19 09:16:26,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:26,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:16:26,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:26,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:16:26,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:16:26,918 INFO L87 Difference]: Start difference. First operand has 1085 states, 540 states have (on average 2.198148148148148) internal successors, (1187), 1065 states have internal predecessors, (1187), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-11-19 09:16:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:28,683 INFO L93 Difference]: Finished difference Result 1165 states and 1235 transitions. [2024-11-19 09:16:28,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:16:28,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-11-19 09:16:28,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:28,710 INFO L225 Difference]: With dead ends: 1165 [2024-11-19 09:16:28,710 INFO L226 Difference]: Without dead ends: 1163 [2024-11-19 09:16:28,712 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-11-19 09:16:28,715 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 720 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:28,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1042 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 09:16:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-19 09:16:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1106. [2024-11-19 09:16:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 576 states have (on average 2.0572916666666665) internal successors, (1185), 1088 states have internal predecessors, (1185), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:16:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1215 transitions. [2024-11-19 09:16:28,812 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1215 transitions. Word has length 3 [2024-11-19 09:16:28,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:28,812 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1215 transitions. [2024-11-19 09:16:28,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-11-19 09:16:28,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1215 transitions. [2024-11-19 09:16:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:16:28,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:28,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:16:28,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 09:16:29,016 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-11-19 09:16:29,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:29,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash 85466, now seen corresponding path program 1 times [2024-11-19 09:16:29,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:29,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030911583] [2024-11-19 09:16:29,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:29,019 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-11-19 09:16:29,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:29,020 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-11-19 09:16:29,022 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-11-19 09:16:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:29,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:16:29,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:29,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:16:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:29,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:29,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:29,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030911583] [2024-11-19 09:16:29,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030911583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:29,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:29,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:16:29,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699452772] [2024-11-19 09:16:29,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:29,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:16:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:29,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:16:29,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:16:29,192 INFO L87 Difference]: Start difference. First operand 1106 states and 1215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-11-19 09:16:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:31,316 INFO L93 Difference]: Finished difference Result 1510 states and 1656 transitions. [2024-11-19 09:16:31,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:16:31,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-11-19 09:16:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:31,325 INFO L225 Difference]: With dead ends: 1510 [2024-11-19 09:16:31,325 INFO L226 Difference]: Without dead ends: 1510 [2024-11-19 09:16:31,325 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-11-19 09:16:31,327 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 428 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:31,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1538 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 09:16:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-19 09:16:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1319. [2024-11-19 09:16:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 788 states have (on average 2.0431472081218276) internal successors, (1610), 1299 states have internal predecessors, (1610), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 09:16:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1644 transitions. [2024-11-19 09:16:31,373 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1644 transitions. Word has length 3 [2024-11-19 09:16:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:31,373 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1644 transitions. [2024-11-19 09:16:31,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-11-19 09:16:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1644 transitions. [2024-11-19 09:16:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:16:31,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:31,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:31,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 09:16:31,574 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-11-19 09:16:31,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:31,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:31,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1307350193, now seen corresponding path program 1 times [2024-11-19 09:16:31,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:31,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837150443] [2024-11-19 09:16:31,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:31,576 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-11-19 09:16:31,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:31,580 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-11-19 09:16:31,581 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-11-19 09:16:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:31,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:16:31,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:31,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:16:31,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:16:31,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:16:31,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:16:31,889 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:16:31,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:16:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:31,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:31,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:31,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837150443] [2024-11-19 09:16:31,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837150443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:31,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:31,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:31,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017041300] [2024-11-19 09:16:31,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:31,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:31,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:31,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:31,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:31,929 INFO L87 Difference]: Start difference. First operand 1319 states and 1644 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-11-19 09:16:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:35,924 INFO L93 Difference]: Finished difference Result 2025 states and 2408 transitions. [2024-11-19 09:16:35,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:16:35,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-11-19 09:16:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:35,933 INFO L225 Difference]: With dead ends: 2025 [2024-11-19 09:16:35,933 INFO L226 Difference]: Without dead ends: 2025 [2024-11-19 09:16:35,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:35,935 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 734 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:35,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1585 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1792 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-19 09:16:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2024-11-19 09:16:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1468. [2024-11-19 09:16:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 937 states have (on average 2.024546424759872) internal successors, (1897), 1448 states have internal predecessors, (1897), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 09:16:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1931 transitions. [2024-11-19 09:16:35,980 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1931 transitions. Word has length 8 [2024-11-19 09:16:35,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:35,980 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1931 transitions. [2024-11-19 09:16:35,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-11-19 09:16:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1931 transitions. [2024-11-19 09:16:35,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 09:16:35,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:35,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:35,986 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-11-19 09:16:36,181 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-11-19 09:16:36,182 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:36,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:36,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150296, now seen corresponding path program 1 times [2024-11-19 09:16:36,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:36,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351474660] [2024-11-19 09:16:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:36,183 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-11-19 09:16:36,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:36,187 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-11-19 09:16:36,188 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-11-19 09:16:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:36,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:16:36,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:36,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:16:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:36,371 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:36,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:36,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351474660] [2024-11-19 09:16:36,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351474660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:36,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:36,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:36,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218028668] [2024-11-19 09:16:36,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:36,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:36,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:36,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:36,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:36,373 INFO L87 Difference]: Start difference. First operand 1468 states and 1931 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-11-19 09:16:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:38,298 INFO L93 Difference]: Finished difference Result 2015 states and 2706 transitions. [2024-11-19 09:16:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:16:38,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-19 09:16:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:38,305 INFO L225 Difference]: With dead ends: 2015 [2024-11-19 09:16:38,306 INFO L226 Difference]: Without dead ends: 2015 [2024-11-19 09:16:38,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-11-19 09:16:38,307 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 924 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:38,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 2093 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 09:16:38,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-11-19 09:16:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1423. [2024-11-19 09:16:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 937 states have (on average 1.961579509071505) internal successors, (1838), 1403 states have internal predecessors, (1838), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 09:16:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1872 transitions. [2024-11-19 09:16:38,336 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1872 transitions. Word has length 9 [2024-11-19 09:16:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:38,337 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1872 transitions. [2024-11-19 09:16:38,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-11-19 09:16:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1872 transitions. [2024-11-19 09:16:38,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 09:16:38,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:38,338 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:38,343 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-11-19 09:16:38,538 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-11-19 09:16:38,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:38,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:38,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150295, now seen corresponding path program 1 times [2024-11-19 09:16:38,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:38,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415051618] [2024-11-19 09:16:38,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:38,540 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-11-19 09:16:38,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:38,543 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-11-19 09:16:38,544 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-11-19 09:16:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:38,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:16:38,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:38,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:16:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:38,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:38,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:38,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415051618] [2024-11-19 09:16:38,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415051618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:38,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:38,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:38,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893397641] [2024-11-19 09:16:38,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:38,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:38,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:38,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:38,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:38,728 INFO L87 Difference]: Start difference. First operand 1423 states and 1872 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-11-19 09:16:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:41,423 INFO L93 Difference]: Finished difference Result 2079 states and 2728 transitions. [2024-11-19 09:16:41,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:16:41,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2024-11-19 09:16:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:41,431 INFO L225 Difference]: With dead ends: 2079 [2024-11-19 09:16:41,431 INFO L226 Difference]: Without dead ends: 2079 [2024-11-19 09:16:41,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-11-19 09:16:41,432 INFO L432 NwaCegarLoop]: 1191 mSDtfsCounter, 704 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:41,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2448 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 09:16:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2024-11-19 09:16:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1415. [2024-11-19 09:16:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 939 states have (on average 1.933972310969116) internal successors, (1816), 1395 states have internal predecessors, (1816), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 09:16:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1850 transitions. [2024-11-19 09:16:41,461 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1850 transitions. Word has length 9 [2024-11-19 09:16:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:41,461 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 1850 transitions. [2024-11-19 09:16:41,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-11-19 09:16:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1850 transitions. [2024-11-19 09:16:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 09:16:41,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:41,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:41,467 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-11-19 09:16:41,666 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-11-19 09:16:41,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:41,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash -325578228, now seen corresponding path program 1 times [2024-11-19 09:16:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:41,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899023895] [2024-11-19 09:16:41,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:41,668 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-11-19 09:16:41,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:41,670 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-11-19 09:16:41,671 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-11-19 09:16:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:41,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:16:41,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:41,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:41,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:41,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899023895] [2024-11-19 09:16:41,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899023895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:41,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:41,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:16:41,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293045934] [2024-11-19 09:16:41,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:41,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:41,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:41,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:41,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:41,879 INFO L87 Difference]: Start difference. First operand 1415 states and 1850 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:42,300 INFO L93 Difference]: Finished difference Result 1863 states and 2408 transitions. [2024-11-19 09:16:42,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:16:42,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-19 09:16:42,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:42,306 INFO L225 Difference]: With dead ends: 1863 [2024-11-19 09:16:42,307 INFO L226 Difference]: Without dead ends: 1863 [2024-11-19 09:16:42,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-11-19 09:16:42,308 INFO L432 NwaCegarLoop]: 1155 mSDtfsCounter, 455 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:42,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 3195 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 09:16:42,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2024-11-19 09:16:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1671. [2024-11-19 09:16:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1195 states have (on average 1.9489539748953975) internal successors, (2329), 1651 states have internal predecessors, (2329), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 09:16:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2363 transitions. [2024-11-19 09:16:42,349 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2363 transitions. Word has length 13 [2024-11-19 09:16:42,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:42,349 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2363 transitions. [2024-11-19 09:16:42,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2363 transitions. [2024-11-19 09:16:42,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 09:16:42,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:42,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:42,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:16:42,553 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-11-19 09:16:42,553 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:42,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:42,554 INFO L85 PathProgramCache]: Analyzing trace with hash -922136276, now seen corresponding path program 1 times [2024-11-19 09:16:42,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:42,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841389111] [2024-11-19 09:16:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:42,554 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-11-19 09:16:42,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:42,557 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-11-19 09:16:42,559 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-11-19 09:16:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:42,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:16:42,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:42,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:42,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:42,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841389111] [2024-11-19 09:16:42,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841389111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:42,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:42,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449703132] [2024-11-19 09:16:42,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:42,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:16:42,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:42,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:16:42,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:16:42,708 INFO L87 Difference]: Start difference. First operand 1671 states and 2363 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11-19 09:16:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:42,739 INFO L93 Difference]: Finished difference Result 1575 states and 2191 transitions. [2024-11-19 09:16:42,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:16:42,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2024-11-19 09:16:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:42,745 INFO L225 Difference]: With dead ends: 1575 [2024-11-19 09:16:42,745 INFO L226 Difference]: Without dead ends: 1575 [2024-11-19 09:16:42,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-11-19 09:16:42,746 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 71 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:42,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1971 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:16:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-19 09:16:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2024-11-19 09:16:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1123 states have (on average 1.9207479964381122) internal successors, (2157), 1555 states have internal predecessors, (2157), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 09:16:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2191 transitions. [2024-11-19 09:16:42,773 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2191 transitions. Word has length 13 [2024-11-19 09:16:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:42,773 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2191 transitions. [2024-11-19 09:16:42,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11-19 09:16:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2191 transitions. [2024-11-19 09:16:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 09:16:42,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:42,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:42,779 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-11-19 09:16:42,974 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-11-19 09:16:42,975 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:42,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:42,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1373575884, now seen corresponding path program 1 times [2024-11-19 09:16:42,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:42,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49849945] [2024-11-19 09:16:42,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:42,976 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-11-19 09:16:42,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:42,977 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-11-19 09:16:42,978 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-11-19 09:16:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:43,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:16:43,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:43,184 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:16:43,185 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:16:43,186 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:16:43,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-19 09:16:43,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:16:43,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-19 09:16:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:43,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:43,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:43,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49849945] [2024-11-19 09:16:43,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49849945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:43,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:43,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:16:43,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629402414] [2024-11-19 09:16:43,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:43,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:43,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:43,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:43,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:43,254 INFO L87 Difference]: Start difference. First operand 1575 states and 2191 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:43,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:43,570 INFO L93 Difference]: Finished difference Result 2100 states and 2505 transitions. [2024-11-19 09:16:43,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:16:43,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 09:16:43,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:43,577 INFO L225 Difference]: With dead ends: 2100 [2024-11-19 09:16:43,577 INFO L226 Difference]: Without dead ends: 2100 [2024-11-19 09:16:43,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-11-19 09:16:43,578 INFO L432 NwaCegarLoop]: 1004 mSDtfsCounter, 899 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:43,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 2985 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 09:16:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2024-11-19 09:16:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1240. [2024-11-19 09:16:43,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 790 states have (on average 1.9037974683544303) internal successors, (1504), 1222 states have internal predecessors, (1504), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:16:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1534 transitions. [2024-11-19 09:16:43,605 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1534 transitions. Word has length 16 [2024-11-19 09:16:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:43,605 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1534 transitions. [2024-11-19 09:16:43,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1534 transitions. [2024-11-19 09:16:43,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 09:16:43,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:43,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:43,615 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-11-19 09:16:43,807 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-11-19 09:16:43,807 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:43,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1057218028, now seen corresponding path program 1 times [2024-11-19 09:16:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:43,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315219643] [2024-11-19 09:16:43,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:43,808 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-11-19 09:16:43,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:43,810 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-11-19 09:16:43,811 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-11-19 09:16:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:43,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:16:43,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:43,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:43,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:43,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315219643] [2024-11-19 09:16:43,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315219643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:43,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:44,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:16:44,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43242069] [2024-11-19 09:16:44,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:44,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:16:44,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:44,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:16:44,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:16:44,001 INFO L87 Difference]: Start difference. First operand 1240 states and 1534 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-11-19 09:16:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:44,030 INFO L93 Difference]: Finished difference Result 1180 states and 1448 transitions. [2024-11-19 09:16:44,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:16:44,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-11-19 09:16:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:44,035 INFO L225 Difference]: With dead ends: 1180 [2024-11-19 09:16:44,035 INFO L226 Difference]: Without dead ends: 1180 [2024-11-19 09:16:44,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-11-19 09:16:44,036 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 71 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:44,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1885 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:16:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-11-19 09:16:44,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2024-11-19 09:16:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 754 states have (on average 1.8806366047745358) internal successors, (1418), 1162 states have internal predecessors, (1418), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:16:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1448 transitions. [2024-11-19 09:16:44,057 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1448 transitions. Word has length 19 [2024-11-19 09:16:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:44,057 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1448 transitions. [2024-11-19 09:16:44,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-11-19 09:16:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1448 transitions. [2024-11-19 09:16:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 09:16:44,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:44,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:44,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 09:16:44,259 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-11-19 09:16:44,259 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:44,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:44,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1920722190, now seen corresponding path program 1 times [2024-11-19 09:16:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:44,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686811222] [2024-11-19 09:16:44,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:44,261 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-11-19 09:16:44,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:44,264 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-11-19 09:16:44,265 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-11-19 09:16:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:44,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:16:44,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:44,457 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:44,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:44,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686811222] [2024-11-19 09:16:44,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686811222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:44,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:44,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:16:44,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144248402] [2024-11-19 09:16:44,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:44,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:44,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:44,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:44,458 INFO L87 Difference]: Start difference. First operand 1180 states and 1448 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-11-19 09:16:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:44,530 INFO L93 Difference]: Finished difference Result 1150 states and 1390 transitions. [2024-11-19 09:16:44,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:16:44,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2024-11-19 09:16:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:44,534 INFO L225 Difference]: With dead ends: 1150 [2024-11-19 09:16:44,534 INFO L226 Difference]: Without dead ends: 1150 [2024-11-19 09:16:44,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-11-19 09:16:44,535 INFO L432 NwaCegarLoop]: 929 mSDtfsCounter, 48 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:44,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2761 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:16:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-19 09:16:44,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2024-11-19 09:16:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 738 states have (on average 1.8428184281842819) internal successors, (1360), 1132 states have internal predecessors, (1360), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:16:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1390 transitions. [2024-11-19 09:16:44,553 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1390 transitions. Word has length 21 [2024-11-19 09:16:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:44,553 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1390 transitions. [2024-11-19 09:16:44,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-11-19 09:16:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1390 transitions. [2024-11-19 09:16:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 09:16:44,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:44,554 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:44,561 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-11-19 09:16:44,755 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-11-19 09:16:44,755 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:44,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:44,755 INFO L85 PathProgramCache]: Analyzing trace with hash -956254243, now seen corresponding path program 1 times [2024-11-19 09:16:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:44,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639621665] [2024-11-19 09:16:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:44,756 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-11-19 09:16:44,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:44,759 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-11-19 09:16:44,760 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-11-19 09:16:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:44,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:16:44,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:44,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:16:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:45,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:45,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:45,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639621665] [2024-11-19 09:16:45,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639621665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:45,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:45,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:16:45,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813946768] [2024-11-19 09:16:45,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:45,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:16:45,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:45,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:16:45,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:16:45,203 INFO L87 Difference]: Start difference. First operand 1150 states and 1390 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-11-19 09:16:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:47,972 INFO L93 Difference]: Finished difference Result 1703 states and 2070 transitions. [2024-11-19 09:16:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:16:47,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2024-11-19 09:16:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:47,977 INFO L225 Difference]: With dead ends: 1703 [2024-11-19 09:16:47,977 INFO L226 Difference]: Without dead ends: 1703 [2024-11-19 09:16:47,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:16:47,977 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 594 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:47,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 3121 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-19 09:16:47,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-11-19 09:16:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1146. [2024-11-19 09:16:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 738 states have (on average 1.8319783197831978) internal successors, (1352), 1128 states have internal predecessors, (1352), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:16:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1382 transitions. [2024-11-19 09:16:47,996 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1382 transitions. Word has length 35 [2024-11-19 09:16:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:47,996 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1382 transitions. [2024-11-19 09:16:47,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-11-19 09:16:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1382 transitions. [2024-11-19 09:16:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 09:16:47,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:47,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:48,004 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-11-19 09:16:48,201 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-11-19 09:16:48,202 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:48,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:48,202 INFO L85 PathProgramCache]: Analyzing trace with hash -956254244, now seen corresponding path program 1 times [2024-11-19 09:16:48,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:48,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081486709] [2024-11-19 09:16:48,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:48,203 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-11-19 09:16:48,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:48,204 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-11-19 09:16:48,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 09:16:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:48,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:16:48,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:48,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:16:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:48,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:48,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:48,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081486709] [2024-11-19 09:16:48,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081486709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:48,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:48,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:16:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462113067] [2024-11-19 09:16:48,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:48,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:16:48,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:48,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:16:48,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:16:48,477 INFO L87 Difference]: Start difference. First operand 1146 states and 1382 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-11-19 09:16:50,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:50,455 INFO L93 Difference]: Finished difference Result 1572 states and 1929 transitions. [2024-11-19 09:16:50,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:16:50,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2024-11-19 09:16:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:50,460 INFO L225 Difference]: With dead ends: 1572 [2024-11-19 09:16:50,460 INFO L226 Difference]: Without dead ends: 1572 [2024-11-19 09:16:50,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:16:50,460 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 810 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:50,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1752 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 09:16:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-11-19 09:16:50,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1142. [2024-11-19 09:16:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 738 states have (on average 1.8211382113821137) internal successors, (1344), 1124 states have internal predecessors, (1344), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:16:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1374 transitions. [2024-11-19 09:16:50,477 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1374 transitions. Word has length 35 [2024-11-19 09:16:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:50,477 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1374 transitions. [2024-11-19 09:16:50,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-11-19 09:16:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1374 transitions. [2024-11-19 09:16:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 09:16:50,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:50,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:50,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 09:16:50,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:50,680 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:50,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash 103689706, now seen corresponding path program 1 times [2024-11-19 09:16:50,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:50,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566337641] [2024-11-19 09:16:50,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:50,681 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-11-19 09:16:50,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:50,685 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:16:50,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 09:16:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:50,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:16:50,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:51,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:51,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:51,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566337641] [2024-11-19 09:16:51,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566337641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:51,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:51,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:16:51,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830450197] [2024-11-19 09:16:51,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:51,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:16:51,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:51,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:16:51,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:16:51,010 INFO L87 Difference]: Start difference. First operand 1142 states and 1374 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:51,077 INFO L93 Difference]: Finished difference Result 1130 states and 1354 transitions. [2024-11-19 09:16:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:16:51,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-19 09:16:51,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:51,081 INFO L225 Difference]: With dead ends: 1130 [2024-11-19 09:16:51,081 INFO L226 Difference]: Without dead ends: 1130 [2024-11-19 09:16:51,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-11-19 09:16:51,082 INFO L432 NwaCegarLoop]: 923 mSDtfsCounter, 21 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:51,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2738 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:16:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-11-19 09:16:51,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2024-11-19 09:16:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 726 states have (on average 1.8236914600550964) internal successors, (1324), 1112 states have internal predecessors, (1324), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 09:16:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1354 transitions. [2024-11-19 09:16:51,118 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1354 transitions. Word has length 55 [2024-11-19 09:16:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:51,120 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1354 transitions. [2024-11-19 09:16:51,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:51,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1354 transitions. [2024-11-19 09:16:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 09:16:51,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:51,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:51,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 09:16:51,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:51,323 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:51,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash -636164170, now seen corresponding path program 1 times [2024-11-19 09:16:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:51,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926130188] [2024-11-19 09:16:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:51,324 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-11-19 09:16:51,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:51,325 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:16:51,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 09:16:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:51,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:16:51,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:51,800 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-19 09:16:51,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-19 09:16:51,865 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-19 09:16:51,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2024-11-19 09:16:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:52,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:52,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:52,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926130188] [2024-11-19 09:16:52,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926130188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:52,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:52,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:16:52,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983016012] [2024-11-19 09:16:52,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:52,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:16:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:52,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:16:52,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:16:52,315 INFO L87 Difference]: Start difference. First operand 1130 states and 1354 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:54,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:54,665 INFO L93 Difference]: Finished difference Result 2053 states and 2462 transitions. [2024-11-19 09:16:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:16:54,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-19 09:16:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:54,670 INFO L225 Difference]: With dead ends: 2053 [2024-11-19 09:16:54,671 INFO L226 Difference]: Without dead ends: 2053 [2024-11-19 09:16:54,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:16:54,671 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 793 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:54,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 2138 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 09:16:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2024-11-19 09:16:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1561. [2024-11-19 09:16:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1142 states have (on average 1.816987740805604) internal successors, (2075), 1531 states have internal predecessors, (2075), 29 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:16:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2129 transitions. [2024-11-19 09:16:54,697 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2129 transitions. Word has length 63 [2024-11-19 09:16:54,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:54,697 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2129 transitions. [2024-11-19 09:16:54,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2129 transitions. [2024-11-19 09:16:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 09:16:54,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:54,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:54,711 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 (15)] Ended with exit code 0 [2024-11-19 09:16:54,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:54,899 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:54,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:54,900 INFO L85 PathProgramCache]: Analyzing trace with hash -636164169, now seen corresponding path program 1 times [2024-11-19 09:16:54,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:54,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298150561] [2024-11-19 09:16:54,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:54,901 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-11-19 09:16:54,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:54,904 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:16:54,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 09:16:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:55,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 09:16:55,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:55,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:16:55,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:16:55,514 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 09:16:55,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-19 09:16:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:56,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:56,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:56,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298150561] [2024-11-19 09:16:56,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298150561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:56,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:56,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:16:56,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318505665] [2024-11-19 09:16:56,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:56,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:16:56,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:56,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:16:56,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:16:56,114 INFO L87 Difference]: Start difference. First operand 1561 states and 2129 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:57,801 INFO L93 Difference]: Finished difference Result 1566 states and 2135 transitions. [2024-11-19 09:16:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:16:57,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-19 09:16:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:57,807 INFO L225 Difference]: With dead ends: 1566 [2024-11-19 09:16:57,807 INFO L226 Difference]: Without dead ends: 1566 [2024-11-19 09:16:57,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:16:57,808 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 58 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:57,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1947 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 09:16:57,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-11-19 09:16:57,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2024-11-19 09:16:57,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1146 states have (on average 1.8141361256544504) internal successors, (2079), 1535 states have internal predecessors, (2079), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 09:16:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2135 transitions. [2024-11-19 09:16:57,831 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2135 transitions. Word has length 63 [2024-11-19 09:16:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:57,832 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2135 transitions. [2024-11-19 09:16:57,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2135 transitions. [2024-11-19 09:16:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-19 09:16:57,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:57,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:57,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 09:16:58,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:16:58,034 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:58,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:58,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1657745720, now seen corresponding path program 1 times [2024-11-19 09:16:58,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:58,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49662603] [2024-11-19 09:16:58,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:58,036 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-11-19 09:16:58,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:58,039 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:16:58,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 09:16:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:58,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:16:58,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:58,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:58,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:58,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49662603] [2024-11-19 09:16:58,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49662603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:58,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:58,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:16:58,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846489492] [2024-11-19 09:16:58,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:58,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:16:58,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:58,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:16:58,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:16:58,378 INFO L87 Difference]: Start difference. First operand 1566 states and 2135 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:58,473 INFO L93 Difference]: Finished difference Result 1592 states and 2162 transitions. [2024-11-19 09:16:58,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:16:58,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-19 09:16:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:58,481 INFO L225 Difference]: With dead ends: 1592 [2024-11-19 09:16:58,481 INFO L226 Difference]: Without dead ends: 1592 [2024-11-19 09:16:58,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:16:58,482 INFO L432 NwaCegarLoop]: 933 mSDtfsCounter, 15 mSDsluCounter, 3727 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4660 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:58,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 4660 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:16:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-19 09:16:58,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1590. [2024-11-19 09:16:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1164 states have (on average 1.8058419243986255) internal successors, (2102), 1555 states have internal predecessors, (2102), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-19 09:16:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2162 transitions. [2024-11-19 09:16:58,522 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2162 transitions. Word has length 71 [2024-11-19 09:16:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:58,523 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 2162 transitions. [2024-11-19 09:16:58,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:16:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2162 transitions. [2024-11-19 09:16:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 09:16:58,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:58,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:58,534 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 (17)] Ended with exit code 0 [2024-11-19 09:16:58,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-11-19 09:16:58,725 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:58,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:58,726 INFO L85 PathProgramCache]: Analyzing trace with hash 949549232, now seen corresponding path program 1 times [2024-11-19 09:16:58,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:58,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211434723] [2024-11-19 09:16:58,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:58,727 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-11-19 09:16:58,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:58,730 INFO L229 MonitoredProcess]: Starting monitored process 18 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-11-19 09:16:58,731 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 (18)] Waiting until timeout for monitored process [2024-11-19 09:16:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:16:59,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:16:59,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:16:59,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:16:59,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:16:59,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:16:59,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211434723] [2024-11-19 09:16:59,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211434723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:16:59,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:16:59,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:16:59,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705316562] [2024-11-19 09:16:59,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:16:59,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:16:59,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:16:59,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:16:59,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:16:59,136 INFO L87 Difference]: Start difference. First operand 1590 states and 2162 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:16:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:16:59,359 INFO L93 Difference]: Finished difference Result 1602 states and 2176 transitions. [2024-11-19 09:16:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:16:59,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2024-11-19 09:16:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:16:59,366 INFO L225 Difference]: With dead ends: 1602 [2024-11-19 09:16:59,367 INFO L226 Difference]: Without dead ends: 1602 [2024-11-19 09:16:59,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:16:59,368 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 22 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:16:59,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4491 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:16:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2024-11-19 09:16:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1593. [2024-11-19 09:16:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1166 states have (on average 1.804459691252144) internal successors, (2104), 1557 states have internal predecessors, (2104), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-19 09:16:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2165 transitions. [2024-11-19 09:16:59,394 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2165 transitions. Word has length 69 [2024-11-19 09:16:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:16:59,395 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2165 transitions. [2024-11-19 09:16:59,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 09:16:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2165 transitions. [2024-11-19 09:16:59,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 09:16:59,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:16:59,396 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:16:59,407 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 (18)] Forceful destruction successful, exit code 0 [2024-11-19 09:16:59,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-11-19 09:16:59,597 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:16:59,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:16:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1301141160, now seen corresponding path program 1 times [2024-11-19 09:16:59,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:16:59,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139297367] [2024-11-19 09:16:59,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:16:59,598 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-11-19 09:16:59,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:16:59,599 INFO L229 MonitoredProcess]: Starting monitored process 19 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-11-19 09:16:59,601 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 (19)] Waiting until timeout for monitored process [2024-11-19 09:17:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:00,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:17:00,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:00,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:17:00,145 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-19 09:17:00,166 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 09:17:00,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-19 09:17:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:00,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:00,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:00,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139297367] [2024-11-19 09:17:00,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139297367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:00,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:00,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:17:00,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226874432] [2024-11-19 09:17:00,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:00,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:17:00,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:00,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:17:00,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-19 09:17:00,179 INFO L87 Difference]: Start difference. First operand 1593 states and 2165 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:17:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:02,373 INFO L93 Difference]: Finished difference Result 2014 states and 2710 transitions. [2024-11-19 09:17:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:17:02,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2024-11-19 09:17:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:02,379 INFO L225 Difference]: With dead ends: 2014 [2024-11-19 09:17:02,380 INFO L226 Difference]: Without dead ends: 2014 [2024-11-19 09:17:02,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-11-19 09:17:02,381 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 771 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 2956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1326 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:02,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1651 Invalid, 2956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1609 Invalid, 0 Unknown, 1326 Unchecked, 2.1s Time] [2024-11-19 09:17:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2024-11-19 09:17:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1592. [2024-11-19 09:17:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1166 states have (on average 1.8027444253859348) internal successors, (2102), 1556 states have internal predecessors, (2102), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-19 09:17:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2163 transitions. [2024-11-19 09:17:02,416 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2163 transitions. Word has length 74 [2024-11-19 09:17:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:02,416 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2163 transitions. [2024-11-19 09:17:02,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:17:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2163 transitions. [2024-11-19 09:17:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 09:17:02,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:02,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:02,432 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 (19)] Ended with exit code 0 [2024-11-19 09:17:02,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-11-19 09:17:02,620 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:17:02,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1301141161, now seen corresponding path program 1 times [2024-11-19 09:17:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:02,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696901745] [2024-11-19 09:17:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:02,621 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-11-19 09:17:02,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:02,625 INFO L229 MonitoredProcess]: Starting monitored process 20 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-11-19 09:17:02,626 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 (20)] Waiting until timeout for monitored process [2024-11-19 09:17:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:03,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 09:17:03,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:03,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:17:03,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:17:03,471 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2024-11-19 09:17:03,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:17:03,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:17:03,498 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:17:03,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:17:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:03,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:03,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:03,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696901745] [2024-11-19 09:17:03,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696901745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:03,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:03,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:17:03,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737450565] [2024-11-19 09:17:03,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:03,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:17:03,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:03,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:17:03,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-19 09:17:03,512 INFO L87 Difference]: Start difference. First operand 1592 states and 2163 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:17:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:07,377 INFO L93 Difference]: Finished difference Result 2690 states and 3619 transitions. [2024-11-19 09:17:07,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:17:07,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 74 [2024-11-19 09:17:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:07,383 INFO L225 Difference]: With dead ends: 2690 [2024-11-19 09:17:07,383 INFO L226 Difference]: Without dead ends: 2690 [2024-11-19 09:17:07,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-19 09:17:07,384 INFO L432 NwaCegarLoop]: 995 mSDtfsCounter, 1477 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2964 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 4800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1810 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:07,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 2410 Invalid, 4800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2964 Invalid, 0 Unknown, 1810 Unchecked, 3.8s Time] [2024-11-19 09:17:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-19 09:17:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 1584. [2024-11-19 09:17:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1166 states have (on average 1.7890222984562607) internal successors, (2086), 1548 states have internal predecessors, (2086), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-19 09:17:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2147 transitions. [2024-11-19 09:17:07,411 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2147 transitions. Word has length 74 [2024-11-19 09:17:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:07,412 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2147 transitions. [2024-11-19 09:17:07,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:17:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2147 transitions. [2024-11-19 09:17:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 09:17:07,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:07,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:07,426 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 (20)] Forceful destruction successful, exit code 0 [2024-11-19 09:17:07,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-11-19 09:17:07,614 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:17:07,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:07,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2023437919, now seen corresponding path program 1 times [2024-11-19 09:17:07,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:07,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728037601] [2024-11-19 09:17:07,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:07,615 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-11-19 09:17:07,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:07,616 INFO L229 MonitoredProcess]: Starting monitored process 21 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-11-19 09:17:07,617 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 (21)] Waiting until timeout for monitored process [2024-11-19 09:17:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:07,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:17:07,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:07,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:17:07,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:17:07,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 09:17:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:08,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:08,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:08,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728037601] [2024-11-19 09:17:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728037601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:08,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:08,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:17:08,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647080768] [2024-11-19 09:17:08,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:08,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:17:08,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:08,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:17:08,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:17:08,022 INFO L87 Difference]: Start difference. First operand 1584 states and 2147 transitions. Second operand has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:17:10,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:10,573 INFO L93 Difference]: Finished difference Result 1599 states and 2163 transitions. [2024-11-19 09:17:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:17:10,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-11-19 09:17:10,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:10,576 INFO L225 Difference]: With dead ends: 1599 [2024-11-19 09:17:10,576 INFO L226 Difference]: Without dead ends: 1599 [2024-11-19 09:17:10,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:17:10,577 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 16 mSDsluCounter, 3080 mSDsCounter, 0 mSdLazyCounter, 2495 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4000 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:10,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4000 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2495 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 09:17:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2024-11-19 09:17:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1598. [2024-11-19 09:17:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1178 states have (on average 1.7843803056027165) internal successors, (2102), 1560 states have internal predecessors, (2102), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-19 09:17:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2163 transitions. [2024-11-19 09:17:10,626 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2163 transitions. Word has length 81 [2024-11-19 09:17:10,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:10,628 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2163 transitions. [2024-11-19 09:17:10,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 09:17:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2163 transitions. [2024-11-19 09:17:10,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 09:17:10,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:10,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:10,640 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 (21)] Ended with exit code 0 [2024-11-19 09:17:10,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-11-19 09:17:10,830 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:17:10,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1697934027, now seen corresponding path program 1 times [2024-11-19 09:17:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:10,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529369070] [2024-11-19 09:17:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:10,831 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-11-19 09:17:10,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:10,833 INFO L229 MonitoredProcess]: Starting monitored process 22 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-11-19 09:17:10,835 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 (22)] Waiting until timeout for monitored process [2024-11-19 09:17:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:11,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 09:17:11,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:11,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:17:11,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:17:11,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 09:17:11,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 09:17:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:11,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:11,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:11,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529369070] [2024-11-19 09:17:11,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529369070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:11,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:11,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:17:11,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22269459] [2024-11-19 09:17:11,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:11,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:17:11,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:11,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:17:11,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:17:11,307 INFO L87 Difference]: Start difference. First operand 1598 states and 2163 transitions. Second operand has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:17:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:14,606 INFO L93 Difference]: Finished difference Result 1598 states and 2161 transitions. [2024-11-19 09:17:14,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:17:14,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2024-11-19 09:17:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:14,609 INFO L225 Difference]: With dead ends: 1598 [2024-11-19 09:17:14,609 INFO L226 Difference]: Without dead ends: 1598 [2024-11-19 09:17:14,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:17:14,610 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 13 mSDsluCounter, 3837 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:14,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4753 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 09:17:14,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2024-11-19 09:17:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2024-11-19 09:17:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1178 states have (on average 1.7826825127334465) internal successors, (2100), 1560 states have internal predecessors, (2100), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-19 09:17:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2161 transitions. [2024-11-19 09:17:14,629 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2161 transitions. Word has length 82 [2024-11-19 09:17:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:14,630 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2161 transitions. [2024-11-19 09:17:14,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 09:17:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2161 transitions. [2024-11-19 09:17:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 09:17:14,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:14,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:14,642 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 (22)] Ended with exit code 0 [2024-11-19 09:17:14,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-11-19 09:17:14,832 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:17:14,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:14,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1028513902, now seen corresponding path program 1 times [2024-11-19 09:17:14,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:14,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152378434] [2024-11-19 09:17:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:14,833 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-11-19 09:17:14,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:14,834 INFO L229 MonitoredProcess]: Starting monitored process 23 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-11-19 09:17:14,836 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 (23)] Waiting until timeout for monitored process [2024-11-19 09:17:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:15,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:17:15,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:15,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:15,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:17:15,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:15,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152378434] [2024-11-19 09:17:15,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152378434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:17:15,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:17:15,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:17:15,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520559088] [2024-11-19 09:17:15,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:17:15,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:17:15,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:15,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:17:15,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:15,232 INFO L87 Difference]: Start difference. First operand 1598 states and 2161 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 09:17:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:15,301 INFO L93 Difference]: Finished difference Result 1614 states and 2179 transitions. [2024-11-19 09:17:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:17:15,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 89 [2024-11-19 09:17:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:15,305 INFO L225 Difference]: With dead ends: 1614 [2024-11-19 09:17:15,306 INFO L226 Difference]: Without dead ends: 1608 [2024-11-19 09:17:15,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:17:15,307 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 3 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:15,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3684 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:17:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-11-19 09:17:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2024-11-19 09:17:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1186 states have (on average 1.779089376053963) internal successors, (2110), 1570 states have internal predecessors, (2110), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-19 09:17:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2173 transitions. [2024-11-19 09:17:15,328 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2173 transitions. Word has length 89 [2024-11-19 09:17:15,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:15,328 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2173 transitions. [2024-11-19 09:17:15,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 09:17:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2173 transitions. [2024-11-19 09:17:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 09:17:15,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:15,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:17:15,341 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 (23)] Ended with exit code 0 [2024-11-19 09:17:15,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-11-19 09:17:15,534 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:17:15,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:15,534 INFO L85 PathProgramCache]: Analyzing trace with hash -659854572, now seen corresponding path program 1 times [2024-11-19 09:17:15,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:15,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668402223] [2024-11-19 09:17:15,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:17:15,535 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-11-19 09:17:15,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:15,538 INFO L229 MonitoredProcess]: Starting monitored process 24 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-11-19 09:17:15,539 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 (24)] Waiting until timeout for monitored process [2024-11-19 09:17:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:17:15,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:17:15,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:15,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:17:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:16,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:16,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668402223] [2024-11-19 09:17:16,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668402223] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:17:16,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:17:16,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-19 09:17:16,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723717831] [2024-11-19 09:17:16,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:17:16,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:17:16,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:17:16,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:17:16,024 INFO L87 Difference]: Start difference. First operand 1608 states and 2173 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:16,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:16,188 INFO L93 Difference]: Finished difference Result 1634 states and 2203 transitions. [2024-11-19 09:17:16,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:17:16,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 90 [2024-11-19 09:17:16,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:16,191 INFO L225 Difference]: With dead ends: 1634 [2024-11-19 09:17:16,191 INFO L226 Difference]: Without dead ends: 1622 [2024-11-19 09:17:16,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:17:16,192 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 21 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3688 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:16,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3688 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:17:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-11-19 09:17:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1616. [2024-11-19 09:17:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1194 states have (on average 1.7755443886097153) internal successors, (2120), 1578 states have internal predecessors, (2120), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-19 09:17:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2183 transitions. [2024-11-19 09:17:16,222 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2183 transitions. Word has length 90 [2024-11-19 09:17:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:16,223 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2183 transitions. [2024-11-19 09:17:16,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2183 transitions. [2024-11-19 09:17:16,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 09:17:16,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:16,225 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 09:17:16,236 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 (24)] Forceful destruction successful, exit code 0 [2024-11-19 09:17:16,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-11-19 09:17:16,426 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:17:16,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:16,426 INFO L85 PathProgramCache]: Analyzing trace with hash -307340818, now seen corresponding path program 2 times [2024-11-19 09:17:16,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:16,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969273174] [2024-11-19 09:17:16,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:17:16,427 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-11-19 09:17:16,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:16,428 INFO L229 MonitoredProcess]: Starting monitored process 25 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-11-19 09:17:16,429 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 (25)] Waiting until timeout for monitored process [2024-11-19 09:17:17,128 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:17:17,129 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:17:17,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:17:17,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:17,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:17:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:17,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:17,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969273174] [2024-11-19 09:17:17,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969273174] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:17:17,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:17:17,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-19 09:17:17,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712300753] [2024-11-19 09:17:17,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:17:17,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:17:17,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:17,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:17:17,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-19 09:17:17,416 INFO L87 Difference]: Start difference. First operand 1616 states and 2183 transitions. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:17,876 INFO L93 Difference]: Finished difference Result 1652 states and 2233 transitions. [2024-11-19 09:17:17,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 09:17:17,878 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 93 [2024-11-19 09:17:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:17,881 INFO L225 Difference]: With dead ends: 1652 [2024-11-19 09:17:17,881 INFO L226 Difference]: Without dead ends: 1640 [2024-11-19 09:17:17,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-19 09:17:17,882 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 36 mSDsluCounter, 7361 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 8286 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:17,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 8286 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:17:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-19 09:17:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1634. [2024-11-19 09:17:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1212 states have (on average 1.768976897689769) internal successors, (2144), 1596 states have internal predecessors, (2144), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-19 09:17:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2207 transitions. [2024-11-19 09:17:17,902 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2207 transitions. Word has length 93 [2024-11-19 09:17:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:17,902 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2207 transitions. [2024-11-19 09:17:17,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2207 transitions. [2024-11-19 09:17:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 09:17:17,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:17,903 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 09:17:17,917 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 (25)] Ended with exit code 0 [2024-11-19 09:17:18,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-11-19 09:17:18,104 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:17:18,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:18,105 INFO L85 PathProgramCache]: Analyzing trace with hash -257513426, now seen corresponding path program 3 times [2024-11-19 09:17:18,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:18,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582908635] [2024-11-19 09:17:18,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:17:18,106 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-11-19 09:17:18,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:18,108 INFO L229 MonitoredProcess]: Starting monitored process 26 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-11-19 09:17:18,109 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 (26)] Waiting until timeout for monitored process [2024-11-19 09:17:19,076 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 09:17:19,076 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:17:19,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 09:17:19,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:19,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:17:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:19,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:19,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582908635] [2024-11-19 09:17:19,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582908635] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:17:19,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:17:19,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-19 09:17:19,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784986737] [2024-11-19 09:17:19,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:17:19,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 09:17:19,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:19,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 09:17:19,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-11-19 09:17:19,874 INFO L87 Difference]: Start difference. First operand 1634 states and 2207 transitions. Second operand has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:21,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:21,782 INFO L93 Difference]: Finished difference Result 1688 states and 2291 transitions. [2024-11-19 09:17:21,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-19 09:17:21,782 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 99 [2024-11-19 09:17:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:21,785 INFO L225 Difference]: With dead ends: 1688 [2024-11-19 09:17:21,785 INFO L226 Difference]: Without dead ends: 1670 [2024-11-19 09:17:21,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-11-19 09:17:21,787 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 43 mSDsluCounter, 11960 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 12885 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:21,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 12885 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 09:17:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2024-11-19 09:17:21,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2024-11-19 09:17:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1248 states have (on average 1.7548076923076923) internal successors, (2190), 1632 states have internal predecessors, (2190), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-19 09:17:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2253 transitions. [2024-11-19 09:17:21,804 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2253 transitions. Word has length 99 [2024-11-19 09:17:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:21,805 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2253 transitions. [2024-11-19 09:17:21,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2253 transitions. [2024-11-19 09:17:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 09:17:21,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:21,806 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 09:17:21,818 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 (26)] Forceful destruction successful, exit code 0 [2024-11-19 09:17:22,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-11-19 09:17:22,007 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:17:22,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:22,008 INFO L85 PathProgramCache]: Analyzing trace with hash 351286446, now seen corresponding path program 4 times [2024-11-19 09:17:22,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:22,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104451165] [2024-11-19 09:17:22,008 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:17:22,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-11-19 09:17:22,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:22,010 INFO L229 MonitoredProcess]: Starting monitored process 27 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-11-19 09:17:22,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 (27)] Waiting until timeout for monitored process [2024-11-19 09:17:22,868 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:17:22,868 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:17:22,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 09:17:22,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:23,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:17:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:17:24,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:24,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104451165] [2024-11-19 09:17:24,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104451165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:17:24,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:17:24,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-19 09:17:24,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284600739] [2024-11-19 09:17:24,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:17:24,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-19 09:17:24,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:17:24,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 09:17:24,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 09:17:24,803 INFO L87 Difference]: Start difference. First operand 1670 states and 2253 transitions. Second operand has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:17:33,009 INFO L93 Difference]: Finished difference Result 1756 states and 2403 transitions. [2024-11-19 09:17:33,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-19 09:17:33,011 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 111 [2024-11-19 09:17:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:17:33,013 INFO L225 Difference]: With dead ends: 1756 [2024-11-19 09:17:33,014 INFO L226 Difference]: Without dead ends: 1744 [2024-11-19 09:17:33,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2024-11-19 09:17:33,016 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 101 mSDsluCounter, 22101 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 23026 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:17:33,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 23026 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 09:17:33,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2024-11-19 09:17:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1738. [2024-11-19 09:17:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1316 states have (on average 1.7340425531914894) internal successors, (2282), 1700 states have internal predecessors, (2282), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-19 09:17:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2345 transitions. [2024-11-19 09:17:33,036 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2345 transitions. Word has length 111 [2024-11-19 09:17:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:17:33,037 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2345 transitions. [2024-11-19 09:17:33,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 09:17:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2345 transitions. [2024-11-19 09:17:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 09:17:33,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:17:33,038 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-19 09:17:33,056 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 (27)] Ended with exit code 0 [2024-11-19 09:17:33,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-11-19 09:17:33,243 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-19 09:17:33,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:17:33,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2042747118, now seen corresponding path program 5 times [2024-11-19 09:17:33,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:17:33,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654095976] [2024-11-19 09:17:33,246 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:17:33,246 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-11-19 09:17:33,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:17:33,249 INFO L229 MonitoredProcess]: Starting monitored process 28 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-11-19 09:17:33,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 (28)] Waiting until timeout for monitored process [2024-11-19 09:17:34,508 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-19 09:17:34,508 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:17:34,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-19 09:17:34,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:17:34,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:17:34,761 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 09:17:34,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 09:17:34,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:17:34,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-19 09:17:36,071 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:17:36,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-19 09:17:36,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-19 09:17:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2024-11-19 09:17:36,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:17:36,485 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem71#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-19 09:17:36,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:17:36,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654095976] [2024-11-19 09:17:36,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654095976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:17:36,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [875902854] [2024-11-19 09:17:36,487 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 09:17:36,487 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 09:17:36,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 09:17:36,488 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 09:17:36,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process