./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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_OAT_nondet_test2-2.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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:33:31,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:33:31,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:33:31,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:33:31,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:33:31,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:33:31,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:33:31,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:33:31,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:33:31,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:33:31,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:33:31,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:33:31,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:33:31,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:33:31,734 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:33:31,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:33:31,734 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:33:31,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:33:31,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:33:31,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:33:31,736 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:33:31,738 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:33:31,739 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:33:31,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:33:31,739 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:33:31,739 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:33:31,740 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:33:31,740 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:33:31,740 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:33:31,740 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:33:31,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:33:31,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:33:31,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:33:31,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:33:31,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:33:31,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:33:31,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:33:31,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:33:31,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:33:31,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:33:31,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:33:31,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:33:31,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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-10 17:33:32,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:33:32,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:33:32,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:33:32,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:33:32,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:33:32,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-10 17:33:33,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:33:33,884 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:33:33,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-10 17:33:33,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edd3781a/ee74119f92c6492a9f6b782d935b30fe/FLAG7d5b9903c [2024-11-10 17:33:33,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6edd3781a/ee74119f92c6492a9f6b782d935b30fe [2024-11-10 17:33:33,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:33:33,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:33:33,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:33:33,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:33:33,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:33:33,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:33:33" (1/1) ... [2024-11-10 17:33:33,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122764b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:33, skipping insertion in model container [2024-11-10 17:33:33,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:33:33" (1/1) ... [2024-11-10 17:33:33,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:33:34,492 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,532 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,536 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,540 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,554 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,603 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,605 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,608 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,612 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,614 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,618 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,623 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,624 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,626 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,632 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:34,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:33:34,664 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-10 17:33:34,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7e9ca4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:34, skipping insertion in model container [2024-11-10 17:33:34,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:33:34,666 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 17:33:34,668 INFO L158 Benchmark]: Toolchain (without parser) took 743.49ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 60.0MB in the beginning and 118.3MB in the end (delta: -58.3MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-10 17:33:34,668 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 134.2MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:33:34,670 INFO L158 Benchmark]: CACSL2BoogieTranslator took 741.46ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 59.8MB in the beginning and 118.3MB in the end (delta: -58.5MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-10 17:33:34,672 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.22ms. Allocated memory is still 134.2MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 741.46ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 59.8MB in the beginning and 118.3MB in the end (delta: -58.5MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 831]: 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_OAT_nondet_test2-2.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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:33:36,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:33:36,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:33:36,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:33:36,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:33:36,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:33:36,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:33:36,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:33:36,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:33:36,904 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:33:36,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:33:36,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:33:36,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:33:36,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:33:36,907 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:33:36,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:33:36,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:33:36,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:33:36,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:33:36,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:33:36,911 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:33:36,912 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:33:36,912 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:33:36,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:33:36,912 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:33:36,918 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:33:36,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:33:36,919 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:33:36,920 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:33:36,920 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:33:36,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:33:36,921 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:33:36,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:33:36,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:33:36,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:33:36,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:33:36,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:33:36,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:33:36,923 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:33:36,924 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:33:36,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:33:36,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:33:36,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:33:36,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:33:36,925 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-10 17:33:37,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:33:37,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:33:37,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:33:37,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:33:37,314 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:33:37,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-10 17:33:39,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:33:39,366 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:33:39,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test2-2.i [2024-11-10 17:33:39,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5533c77c8/0b1bb18b8cc14236b6407d000e7085e4/FLAG6423fc00c [2024-11-10 17:33:39,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5533c77c8/0b1bb18b8cc14236b6407d000e7085e4 [2024-11-10 17:33:39,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:33:39,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:33:39,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:33:39,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:33:39,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:33:39,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:33:39" (1/1) ... [2024-11-10 17:33:39,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577fa0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:39, skipping insertion in model container [2024-11-10 17:33:39,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:33:39" (1/1) ... [2024-11-10 17:33:39,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:33:39,940 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:39,978 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:39,986 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:39,991 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,000 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,036 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,036 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,039 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,040 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,042 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,044 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,046 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,047 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,047 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,062 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:33:40,086 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 17:33:40,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:33:40,124 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,138 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,140 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,143 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,147 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,170 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,171 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,173 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,173 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,175 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,177 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,178 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,178 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,179 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,183 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:33:40,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:33:40,194 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:33:40,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:33:40,375 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:33:40,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40 WrapperNode [2024-11-10 17:33:40,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:33:40,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:33:40,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:33:40,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:33:40,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40" (1/1) ... [2024-11-10 17:33:40,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40" (1/1) ... [2024-11-10 17:33:40,492 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1024 [2024-11-10 17:33:40,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:33:40,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:33:40,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:33:40,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:33:40,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40" (1/1) ... [2024-11-10 17:33:40,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40" (1/1) ... [2024-11-10 17:33:40,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40" (1/1) ... [2024-11-10 17:33:40,647 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-10 17:33:40,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40" (1/1) ... [2024-11-10 17:33:40,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40" (1/1) ... [2024-11-10 17:33:40,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40" (1/1) ... [2024-11-10 17:33:40,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40" (1/1) ... [2024-11-10 17:33:40,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40" (1/1) ... [2024-11-10 17:33:40,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40" (1/1) ... [2024-11-10 17:33:40,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:33:40,744 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:33:40,744 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:33:40,744 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:33:40,745 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40" (1/1) ... [2024-11-10 17:33:40,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:33:40,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:33:40,782 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-10 17:33:40,785 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-10 17:33:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 17:33:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 17:33:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 17:33:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 17:33:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 17:33:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 17:33:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:33:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:33:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-10 17:33:40,821 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:33:40,821 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:33:40,821 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-10 17:33:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 17:33:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:33:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:33:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 17:33:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 17:33:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 17:33:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 17:33:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:33:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:33:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 17:33:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 17:33:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:33:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:33:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:33:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:33:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 17:33:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:33:40,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:33:41,109 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:33:41,111 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:33:44,908 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-10 17:33:45,024 INFO L? ?]: Removed 1086 outVars from TransFormulas that were not future-live. [2024-11-10 17:33:45,025 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:33:45,078 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:33:45,078 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:33:45,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:33:45 BoogieIcfgContainer [2024-11-10 17:33:45,078 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:33:45,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:33:45,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:33:45,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:33:45,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:33:39" (1/3) ... [2024-11-10 17:33:45,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a9679e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:33:45, skipping insertion in model container [2024-11-10 17:33:45,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:33:40" (2/3) ... [2024-11-10 17:33:45,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a9679e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:33:45, skipping insertion in model container [2024-11-10 17:33:45,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:33:45" (3/3) ... [2024-11-10 17:33:45,090 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test2-2.i [2024-11-10 17:33:45,106 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:33:45,107 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 525 error locations. [2024-11-10 17:33:45,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:33:45,224 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;@c8fc606, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:33:45,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-11-10 17:33:45,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 1086 states, 559 states have (on average 2.1592128801431127) internal successors, (1207), 1081 states have internal predecessors, (1207), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:45,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 17:33:45,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:45,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 17:33:45,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:33:45,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash 38571324, now seen corresponding path program 1 times [2024-11-10 17:33:45,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:45,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229859494] [2024-11-10 17:33:45,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:45,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-10 17:33:45,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:45,265 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-10 17:33:45,286 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-10 17:33:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:45,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:33:45,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:45,508 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-10 17:33:45,523 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-10 17:33:45,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:45,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:45,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229859494] [2024-11-10 17:33:45,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229859494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:45,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:45,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:33:45,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795240859] [2024-11-10 17:33:45,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:45,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:33:45,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:45,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:33:45,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:45,563 INFO L87 Difference]: Start difference. First operand has 1086 states, 559 states have (on average 2.1592128801431127) internal successors, (1207), 1081 states have internal predecessors, (1207), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10 17:33:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:47,205 INFO L93 Difference]: Finished difference Result 1257 states and 1325 transitions. [2024-11-10 17:33:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:33:47,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-10 17:33:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:47,227 INFO L225 Difference]: With dead ends: 1257 [2024-11-10 17:33:47,227 INFO L226 Difference]: Without dead ends: 1254 [2024-11-10 17:33:47,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 17:33:47,238 INFO L432 NwaCegarLoop]: 655 mSDtfsCounter, 991 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:47,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 808 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 17:33:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-11-10 17:33:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1069. [2024-11-10 17:33:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 559 states have (on average 2.007155635062612) internal successors, (1122), 1064 states have internal predecessors, (1122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1128 transitions. [2024-11-10 17:33:47,345 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1128 transitions. Word has length 4 [2024-11-10 17:33:47,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:47,345 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1128 transitions. [2024-11-10 17:33:47,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10 17:33:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1128 transitions. [2024-11-10 17:33:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 17:33:47,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:47,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 17:33:47,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 17:33:47,550 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-10 17:33:47,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr524REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:33:47,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:47,551 INFO L85 PathProgramCache]: Analyzing trace with hash 38571325, now seen corresponding path program 1 times [2024-11-10 17:33:47,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:47,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138457085] [2024-11-10 17:33:47,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:47,552 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-10 17:33:47,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:47,555 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-10 17:33:47,557 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-10 17:33:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:47,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:33:47,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:47,682 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-10 17:33:47,704 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-10 17:33:47,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:47,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:47,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138457085] [2024-11-10 17:33:47,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138457085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:47,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:47,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:33:47,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147029773] [2024-11-10 17:33:47,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:47,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:33:47,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:47,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:33:47,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:47,709 INFO L87 Difference]: Start difference. First operand 1069 states and 1128 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10 17:33:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:49,745 INFO L93 Difference]: Finished difference Result 1495 states and 1586 transitions. [2024-11-10 17:33:49,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:33:49,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-10 17:33:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:49,752 INFO L225 Difference]: With dead ends: 1495 [2024-11-10 17:33:49,752 INFO L226 Difference]: Without dead ends: 1495 [2024-11-10 17:33:49,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 17:33:49,753 INFO L432 NwaCegarLoop]: 928 mSDtfsCounter, 458 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:49,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1531 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 17:33:49,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-10 17:33:49,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1202. [2024-11-10 17:33:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 693 states have (on average 1.9610389610389611) internal successors, (1359), 1197 states have internal predecessors, (1359), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1365 transitions. [2024-11-10 17:33:49,801 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1365 transitions. Word has length 4 [2024-11-10 17:33:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:49,802 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1365 transitions. [2024-11-10 17:33:49,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10 17:33:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1365 transitions. [2024-11-10 17:33:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 17:33:49,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:49,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 17:33:49,806 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-10 17:33:50,005 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-10 17:33:50,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:33:50,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:50,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1195672931, now seen corresponding path program 1 times [2024-11-10 17:33:50,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:50,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645093018] [2024-11-10 17:33:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:50,008 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-10 17:33:50,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:50,011 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-10 17:33:50,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 (4)] Waiting until timeout for monitored process [2024-11-10 17:33:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:50,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:33:50,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:50,151 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_48|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_48| (_ bv0 1))))) is different from true [2024-11-10 17:33:50,163 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-10 17:33:50,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:50,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:50,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645093018] [2024-11-10 17:33:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645093018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:50,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:50,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:33:50,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827069189] [2024-11-10 17:33:50,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:50,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:33:50,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:50,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:33:50,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-10 17:33:50,165 INFO L87 Difference]: Start difference. First operand 1202 states and 1365 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-10 17:33:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:52,244 INFO L93 Difference]: Finished difference Result 1481 states and 1570 transitions. [2024-11-10 17:33:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:33:52,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-10 17:33:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:52,249 INFO L225 Difference]: With dead ends: 1481 [2024-11-10 17:33:52,249 INFO L226 Difference]: Without dead ends: 1479 [2024-11-10 17:33:52,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-10 17:33:52,251 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 440 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1560 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:52,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1525 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 718 Invalid, 0 Unknown, 1560 Unchecked, 2.0s Time] [2024-11-10 17:33:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2024-11-10 17:33:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1202. [2024-11-10 17:33:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 693 states have (on average 1.9595959595959596) internal successors, (1358), 1197 states have internal predecessors, (1358), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1364 transitions. [2024-11-10 17:33:52,276 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1364 transitions. Word has length 5 [2024-11-10 17:33:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:52,276 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1364 transitions. [2024-11-10 17:33:52,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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-10 17:33:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1364 transitions. [2024-11-10 17:33:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:33:52,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:52,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:52,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:52,477 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-10 17:33:52,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr520REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:33:52,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash -767703104, now seen corresponding path program 1 times [2024-11-10 17:33:52,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:52,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568466219] [2024-11-10 17:33:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:52,479 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-10 17:33:52,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:52,482 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-10 17:33:52,483 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-10 17:33:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:52,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:33:52,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:52,624 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-10 17:33:52,637 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-10 17:33:52,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:33:52,723 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-10 17:33:52,741 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:33:52,742 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-10 17:33:52,768 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-10 17:33:52,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:52,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:52,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568466219] [2024-11-10 17:33:52,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568466219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:52,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:52,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:33:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608386242] [2024-11-10 17:33:52,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:52,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:33:52,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:52,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:33:52,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:33:52,771 INFO L87 Difference]: Start difference. First operand 1202 states and 1364 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-10 17:33:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:54,920 INFO L93 Difference]: Finished difference Result 1376 states and 1546 transitions. [2024-11-10 17:33:54,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:33:54,921 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-10 17:33:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:54,925 INFO L225 Difference]: With dead ends: 1376 [2024-11-10 17:33:54,926 INFO L226 Difference]: Without dead ends: 1376 [2024-11-10 17:33:54,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-10 17:33:54,927 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 1280 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:54,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 478 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 17:33:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-10 17:33:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1057. [2024-11-10 17:33:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 559 states have (on average 1.9821109123434706) internal successors, (1108), 1052 states have internal predecessors, (1108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1114 transitions. [2024-11-10 17:33:54,953 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1114 transitions. Word has length 9 [2024-11-10 17:33:54,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:54,953 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1114 transitions. [2024-11-10 17:33:54,953 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-10 17:33:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1114 transitions. [2024-11-10 17:33:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 17:33:54,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:54,954 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:54,960 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 (5)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:55,158 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-10 17:33:55,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:33:55,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:55,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1971008690, now seen corresponding path program 1 times [2024-11-10 17:33:55,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:55,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855326229] [2024-11-10 17:33:55,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:55,159 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-10 17:33:55,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:55,163 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-10 17:33:55,164 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-10 17:33:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:55,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:33:55,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:55,293 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-10 17:33:55,302 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-10 17:33:55,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:55,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:55,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855326229] [2024-11-10 17:33:55,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855326229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:55,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:55,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:33:55,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282009415] [2024-11-10 17:33:55,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:55,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:33:55,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:55,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:33:55,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:55,305 INFO L87 Difference]: Start difference. First operand 1057 states and 1114 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:56,499 INFO L93 Difference]: Finished difference Result 1230 states and 1308 transitions. [2024-11-10 17:33:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:33:56,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 17:33:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:56,503 INFO L225 Difference]: With dead ends: 1230 [2024-11-10 17:33:56,503 INFO L226 Difference]: Without dead ends: 1230 [2024-11-10 17:33:56,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-10 17:33:56,504 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 766 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:56,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1161 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:33:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2024-11-10 17:33:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1010. [2024-11-10 17:33:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 559 states have (on average 1.8980322003577819) internal successors, (1061), 1005 states have internal predecessors, (1061), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1067 transitions. [2024-11-10 17:33:56,524 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1067 transitions. Word has length 10 [2024-11-10 17:33:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:56,525 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1067 transitions. [2024-11-10 17:33:56,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1067 transitions. [2024-11-10 17:33:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 17:33:56,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:56,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:56,530 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-10 17:33:56,729 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-10 17:33:56,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:33:56,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1971008691, now seen corresponding path program 1 times [2024-11-10 17:33:56,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:56,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052083441] [2024-11-10 17:33:56,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:56,732 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-10 17:33:56,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:56,735 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-10 17:33:56,736 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-10 17:33:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:56,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:33:56,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:56,878 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-10 17:33:56,907 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-10 17:33:56,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:56,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:56,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052083441] [2024-11-10 17:33:56,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052083441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:56,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:56,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:33:56,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25837221] [2024-11-10 17:33:56,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:56,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:33:56,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:56,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:33:56,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:56,909 INFO L87 Difference]: Start difference. First operand 1010 states and 1067 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:58,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:58,668 INFO L93 Difference]: Finished difference Result 1308 states and 1389 transitions. [2024-11-10 17:33:58,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:33:58,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 17:33:58,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:58,672 INFO L225 Difference]: With dead ends: 1308 [2024-11-10 17:33:58,672 INFO L226 Difference]: Without dead ends: 1308 [2024-11-10 17:33:58,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-10 17:33:58,673 INFO L432 NwaCegarLoop]: 1076 mSDtfsCounter, 513 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:58,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1517 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:33:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2024-11-10 17:33:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1039. [2024-11-10 17:33:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 598 states have (on average 1.8846153846153846) internal successors, (1127), 1034 states have internal predecessors, (1127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1133 transitions. [2024-11-10 17:33:58,691 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1133 transitions. Word has length 10 [2024-11-10 17:33:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:58,691 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1133 transitions. [2024-11-10 17:33:58,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:33:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1133 transitions. [2024-11-10 17:33:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 17:33:58,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:58,693 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:58,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:58,895 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-10 17:33:58,896 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:33:58,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1422651079, now seen corresponding path program 1 times [2024-11-10 17:33:58,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:58,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589557746] [2024-11-10 17:33:58,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:58,897 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-10 17:33:58,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:58,900 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-10 17:33:58,901 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-10 17:33:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:59,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:33:59,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:59,106 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-10 17:33:59,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:59,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:59,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589557746] [2024-11-10 17:33:59,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589557746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:59,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:59,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:33:59,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096527552] [2024-11-10 17:33:59,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:59,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:33:59,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:59,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:33:59,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:59,109 INFO L87 Difference]: Start difference. First operand 1039 states and 1133 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10 17:33:59,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:59,279 INFO L93 Difference]: Finished difference Result 1490 states and 1639 transitions. [2024-11-10 17:33:59,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:33:59,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-11-10 17:33:59,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:59,284 INFO L225 Difference]: With dead ends: 1490 [2024-11-10 17:33:59,284 INFO L226 Difference]: Without dead ends: 1490 [2024-11-10 17:33:59,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-10 17:33:59,285 INFO L432 NwaCegarLoop]: 1119 mSDtfsCounter, 475 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:33:59,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 2083 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:33:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2024-11-10 17:33:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1218. [2024-11-10 17:33:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 777 states have (on average 1.833976833976834) internal successors, (1425), 1213 states have internal predecessors, (1425), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1431 transitions. [2024-11-10 17:33:59,305 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1431 transitions. Word has length 14 [2024-11-10 17:33:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:59,306 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1431 transitions. [2024-11-10 17:33:59,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10 17:33:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1431 transitions. [2024-11-10 17:33:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 17:33:59,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:59,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:59,311 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 (8)] Forceful destruction successful, exit code 0 [2024-11-10 17:33:59,507 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-10 17:33:59,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr193REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:33:59,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash 586733750, now seen corresponding path program 1 times [2024-11-10 17:33:59,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:59,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052529438] [2024-11-10 17:33:59,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:59,509 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-10 17:33:59,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:59,510 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-10 17:33:59,511 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-10 17:33:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:33:59,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:33:59,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:33:59,634 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-10 17:33:59,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:33:59,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:33:59,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052529438] [2024-11-10 17:33:59,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052529438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:33:59,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:33:59,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:33:59,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990399021] [2024-11-10 17:33:59,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:33:59,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:33:59,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:33:59,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:33:59,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:33:59,635 INFO L87 Difference]: Start difference. First operand 1218 states and 1431 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 17:33:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:33:59,662 INFO L93 Difference]: Finished difference Result 1158 states and 1345 transitions. [2024-11-10 17:33:59,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:33:59,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-11-10 17:33:59,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:33:59,667 INFO L225 Difference]: With dead ends: 1158 [2024-11-10 17:33:59,667 INFO L226 Difference]: Without dead ends: 1158 [2024-11-10 17:33:59,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-10 17:33:59,668 INFO L432 NwaCegarLoop]: 994 mSDtfsCounter, 71 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1924 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-10 17:33:59,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1924 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:33:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-10 17:33:59,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1158. [2024-11-10 17:33:59,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 741 states have (on average 1.8070175438596492) internal successors, (1339), 1153 states have internal predecessors, (1339), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:33:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1345 transitions. [2024-11-10 17:33:59,688 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1345 transitions. Word has length 17 [2024-11-10 17:33:59,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:33:59,688 INFO L471 AbstractCegarLoop]: Abstraction has 1158 states and 1345 transitions. [2024-11-10 17:33:59,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 17:33:59,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1345 transitions. [2024-11-10 17:33:59,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 17:33:59,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:33:59,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:33:59,694 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-10 17:33:59,890 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-10 17:33:59,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:33:59,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:33:59,891 INFO L85 PathProgramCache]: Analyzing trace with hash -495457004, now seen corresponding path program 1 times [2024-11-10 17:33:59,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:33:59,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733353935] [2024-11-10 17:33:59,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:33:59,892 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-10 17:33:59,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:33:59,893 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-10 17:33:59,894 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-10 17:34:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:00,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:34:00,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:00,105 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-10 17:34:00,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:00,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:00,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733353935] [2024-11-10 17:34:00,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733353935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:00,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:00,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:34:00,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359164435] [2024-11-10 17:34:00,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:00,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:34:00,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:00,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:34:00,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:34:00,107 INFO L87 Difference]: Start difference. First operand 1158 states and 1345 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-10 17:34:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:00,569 INFO L93 Difference]: Finished difference Result 1409 states and 1556 transitions. [2024-11-10 17:34:00,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:34:00,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-10 17:34:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:00,573 INFO L225 Difference]: With dead ends: 1409 [2024-11-10 17:34:00,573 INFO L226 Difference]: Without dead ends: 1409 [2024-11-10 17:34:00,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-10 17:34:00,574 INFO L432 NwaCegarLoop]: 1075 mSDtfsCounter, 436 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:00,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 2965 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 17:34:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-11-10 17:34:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1161. [2024-11-10 17:34:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 744 states have (on average 1.803763440860215) internal successors, (1342), 1156 states have internal predecessors, (1342), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1348 transitions. [2024-11-10 17:34:00,591 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1348 transitions. Word has length 18 [2024-11-10 17:34:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:00,591 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1348 transitions. [2024-11-10 17:34:00,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-10 17:34:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1348 transitions. [2024-11-10 17:34:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 17:34:00,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:00,592 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-10 17:34:00,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 17:34:00,792 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-10 17:34:00,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:00,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:00,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1820459967, now seen corresponding path program 1 times [2024-11-10 17:34:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:00,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475658682] [2024-11-10 17:34:00,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:00,794 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-10 17:34:00,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:00,795 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-10 17:34:00,796 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-10 17:34:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:00,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:34:00,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:01,039 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_49| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_49| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_49|)))) is different from true [2024-11-10 17:34:01,045 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-10 17:34:01,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:01,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:01,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475658682] [2024-11-10 17:34:01,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475658682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:01,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:01,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:34:01,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758294274] [2024-11-10 17:34:01,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:01,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:34:01,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:01,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:34:01,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-10 17:34:01,047 INFO L87 Difference]: Start difference. First operand 1161 states and 1348 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-10 17:34:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:01,949 INFO L93 Difference]: Finished difference Result 1263 states and 1461 transitions. [2024-11-10 17:34:01,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:34:01,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-10 17:34:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:01,962 INFO L225 Difference]: With dead ends: 1263 [2024-11-10 17:34:01,962 INFO L226 Difference]: Without dead ends: 1255 [2024-11-10 17:34:01,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-10 17:34:01,963 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 103 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1123 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:01,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1536 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 473 Invalid, 0 Unknown, 1123 Unchecked, 0.9s Time] [2024-11-10 17:34:01,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-10 17:34:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1230. [2024-11-10 17:34:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 813 states have (on average 1.7773677736777367) internal successors, (1445), 1225 states have internal predecessors, (1445), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1451 transitions. [2024-11-10 17:34:01,979 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1451 transitions. Word has length 19 [2024-11-10 17:34:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:01,980 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1451 transitions. [2024-11-10 17:34:01,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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-10 17:34:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1451 transitions. [2024-11-10 17:34:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 17:34:01,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:01,981 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-10 17:34:01,987 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-10 17:34:02,185 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-10 17:34:02,186 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr169REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:02,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1210361418, now seen corresponding path program 1 times [2024-11-10 17:34:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:02,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685168549] [2024-11-10 17:34:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:02,188 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-10 17:34:02,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:02,191 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-10 17:34:02,192 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-10 17:34:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:02,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:34:02,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:02,325 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-10 17:34:02,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:02,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:02,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685168549] [2024-11-10 17:34:02,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685168549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:02,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:02,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:34:02,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631865640] [2024-11-10 17:34:02,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:02,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:34:02,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:02,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:34:02,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:34:02,327 INFO L87 Difference]: Start difference. First operand 1230 states and 1451 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-10 17:34:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:02,381 INFO L93 Difference]: Finished difference Result 1192 states and 1364 transitions. [2024-11-10 17:34:02,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:34:02,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-10 17:34:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:02,384 INFO L225 Difference]: With dead ends: 1192 [2024-11-10 17:34:02,385 INFO L226 Difference]: Without dead ends: 1192 [2024-11-10 17:34:02,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-10 17:34:02,385 INFO L432 NwaCegarLoop]: 949 mSDtfsCounter, 48 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2820 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:02,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2820 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:34:02,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-11-10 17:34:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2024-11-10 17:34:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 789 states have (on average 1.721166032953105) internal successors, (1358), 1187 states have internal predecessors, (1358), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1364 transitions. [2024-11-10 17:34:02,402 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1364 transitions. Word has length 19 [2024-11-10 17:34:02,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:02,403 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1364 transitions. [2024-11-10 17:34:02,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 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-10 17:34:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1364 transitions. [2024-11-10 17:34:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 17:34:02,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:02,404 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-10 17:34:02,408 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-10 17:34:02,604 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-10 17:34:02,604 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:02,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash -550509454, now seen corresponding path program 1 times [2024-11-10 17:34:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99951756] [2024-11-10 17:34:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:02,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:34:02,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:02,607 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-10 17:34:02,607 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-10 17:34:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:02,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:34:02,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:02,762 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-10 17:34:02,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:02,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:02,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99951756] [2024-11-10 17:34:02,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99951756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:02,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:02,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:34:02,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721395749] [2024-11-10 17:34:02,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:02,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:34:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:02,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:34:02,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:34:02,765 INFO L87 Difference]: Start difference. First operand 1192 states and 1364 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-10 17:34:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:02,793 INFO L93 Difference]: Finished difference Result 1132 states and 1278 transitions. [2024-11-10 17:34:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:34:02,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-10 17:34:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:02,797 INFO L225 Difference]: With dead ends: 1132 [2024-11-10 17:34:02,797 INFO L226 Difference]: Without dead ends: 1132 [2024-11-10 17:34:02,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-10 17:34:02,798 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 71 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1768 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-10 17:34:02,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1768 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:34:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-10 17:34:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2024-11-10 17:34:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 753 states have (on average 1.6892430278884463) internal successors, (1272), 1127 states have internal predecessors, (1272), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:02,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1278 transitions. [2024-11-10 17:34:02,812 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1278 transitions. Word has length 21 [2024-11-10 17:34:02,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:02,813 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1278 transitions. [2024-11-10 17:34:02,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-10 17:34:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1278 transitions. [2024-11-10 17:34:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 17:34:02,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:02,814 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] [2024-11-10 17:34:02,820 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 (13)] Forceful destruction successful, exit code 0 [2024-11-10 17:34:03,014 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-10 17:34:03,015 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr485REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:03,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash -758642810, now seen corresponding path program 1 times [2024-11-10 17:34:03,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:03,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890772356] [2024-11-10 17:34:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:03,016 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-10 17:34:03,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:03,019 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-10 17:34:03,020 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-10 17:34:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:03,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:34:03,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:03,195 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-10 17:34:03,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:03,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:03,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890772356] [2024-11-10 17:34:03,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890772356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:03,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:03,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:34:03,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409016143] [2024-11-10 17:34:03,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:03,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:34:03,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:03,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:34:03,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:34:03,197 INFO L87 Difference]: Start difference. First operand 1132 states and 1278 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-10 17:34:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:03,261 INFO L93 Difference]: Finished difference Result 1102 states and 1220 transitions. [2024-11-10 17:34:03,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:34:03,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-10 17:34:03,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:03,265 INFO L225 Difference]: With dead ends: 1102 [2024-11-10 17:34:03,265 INFO L226 Difference]: Without dead ends: 1102 [2024-11-10 17:34:03,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-10 17:34:03,267 INFO L432 NwaCegarLoop]: 871 mSDtfsCounter, 48 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2586 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:03,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2586 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:34:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2024-11-10 17:34:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2024-11-10 17:34:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 737 states have (on average 1.6472184531886025) internal successors, (1214), 1097 states have internal predecessors, (1214), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1220 transitions. [2024-11-10 17:34:03,280 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1220 transitions. Word has length 23 [2024-11-10 17:34:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:03,280 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1220 transitions. [2024-11-10 17:34:03,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-10 17:34:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1220 transitions. [2024-11-10 17:34:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 17:34:03,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:03,283 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] [2024-11-10 17:34:03,289 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-10 17:34:03,483 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-10 17:34:03,483 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:03,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:03,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1675753888, now seen corresponding path program 1 times [2024-11-10 17:34:03,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:03,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564931163] [2024-11-10 17:34:03,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:03,484 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-10 17:34:03,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:03,488 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-10 17:34:03,489 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-10 17:34:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:03,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:34:03,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:03,621 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-10 17:34:03,692 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-10 17:34:03,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:03,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:03,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564931163] [2024-11-10 17:34:03,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564931163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:03,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:03,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:34:03,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402375274] [2024-11-10 17:34:03,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:03,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:34:03,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:03,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:34:03,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:34:03,694 INFO L87 Difference]: Start difference. First operand 1102 states and 1220 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-10 17:34:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:05,012 INFO L93 Difference]: Finished difference Result 1295 states and 1414 transitions. [2024-11-10 17:34:05,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:34:05,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-11-10 17:34:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:05,016 INFO L225 Difference]: With dead ends: 1295 [2024-11-10 17:34:05,016 INFO L226 Difference]: Without dead ends: 1295 [2024-11-10 17:34:05,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-10 17:34:05,016 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 795 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:05,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1167 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:34:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-11-10 17:34:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1098. [2024-11-10 17:34:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 737 states have (on average 1.6309362279511532) internal successors, (1202), 1093 states have internal predecessors, (1202), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1208 transitions. [2024-11-10 17:34:05,028 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1208 transitions. Word has length 33 [2024-11-10 17:34:05,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:05,042 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1208 transitions. [2024-11-10 17:34:05,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-10 17:34:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1208 transitions. [2024-11-10 17:34:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 17:34:05,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:05,044 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] [2024-11-10 17:34:05,050 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-10 17:34:05,244 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-10 17:34:05,244 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:05,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:05,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1675753889, now seen corresponding path program 1 times [2024-11-10 17:34:05,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:05,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496404345] [2024-11-10 17:34:05,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:05,245 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-10 17:34:05,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:05,247 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-10 17:34:05,248 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-10 17:34:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:05,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:34:05,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:05,392 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-10 17:34:05,562 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-10 17:34:05,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:05,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:05,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496404345] [2024-11-10 17:34:05,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496404345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:05,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:05,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:34:05,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367855981] [2024-11-10 17:34:05,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:05,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:34:05,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:34:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:34:05,564 INFO L87 Difference]: Start difference. First operand 1098 states and 1208 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-10 17:34:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:07,165 INFO L93 Difference]: Finished difference Result 1105 states and 1210 transitions. [2024-11-10 17:34:07,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:34:07,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-11-10 17:34:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:07,168 INFO L225 Difference]: With dead ends: 1105 [2024-11-10 17:34:07,168 INFO L226 Difference]: Without dead ends: 1105 [2024-11-10 17:34:07,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-10 17:34:07,169 INFO L432 NwaCegarLoop]: 877 mSDtfsCounter, 80 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:07,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1824 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:34:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-11-10 17:34:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1098. [2024-11-10 17:34:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 737 states have (on average 1.6255088195386702) internal successors, (1198), 1093 states have internal predecessors, (1198), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1204 transitions. [2024-11-10 17:34:07,179 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1204 transitions. Word has length 33 [2024-11-10 17:34:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:07,180 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1204 transitions. [2024-11-10 17:34:07,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-10 17:34:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1204 transitions. [2024-11-10 17:34:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 17:34:07,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:07,181 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] [2024-11-10 17:34:07,185 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-10 17:34:07,384 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-10 17:34:07,384 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr471REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:07,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:07,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1103966556, now seen corresponding path program 1 times [2024-11-10 17:34:07,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:07,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997317122] [2024-11-10 17:34:07,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:07,386 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-10 17:34:07,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:07,387 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-10 17:34:07,388 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-10 17:34:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:07,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:34:07,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:07,565 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-10 17:34:07,640 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-10 17:34:07,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:07,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:07,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997317122] [2024-11-10 17:34:07,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997317122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:07,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:07,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:34:07,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098301843] [2024-11-10 17:34:07,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:07,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:34:07,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:07,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:34:07,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:34:07,643 INFO L87 Difference]: Start difference. First operand 1098 states and 1204 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-10 17:34:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:08,985 INFO L93 Difference]: Finished difference Result 1105 states and 1206 transitions. [2024-11-10 17:34:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:34:08,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2024-11-10 17:34:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:08,988 INFO L225 Difference]: With dead ends: 1105 [2024-11-10 17:34:08,988 INFO L226 Difference]: Without dead ends: 1105 [2024-11-10 17:34:08,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-10 17:34:08,989 INFO L432 NwaCegarLoop]: 639 mSDtfsCounter, 617 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:08,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1287 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:34:08,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2024-11-10 17:34:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1094. [2024-11-10 17:34:08,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 737 states have (on average 1.6146540027137042) internal successors, (1190), 1089 states have internal predecessors, (1190), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1196 transitions. [2024-11-10 17:34:08,999 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1196 transitions. Word has length 37 [2024-11-10 17:34:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:08,999 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1196 transitions. [2024-11-10 17:34:08,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-10 17:34:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1196 transitions. [2024-11-10 17:34:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 17:34:09,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:09,000 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] [2024-11-10 17:34:09,007 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-10 17:34:09,204 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-10 17:34:09,205 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr472REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:09,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1103966557, now seen corresponding path program 1 times [2024-11-10 17:34:09,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:09,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195497568] [2024-11-10 17:34:09,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:09,206 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-10 17:34:09,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:09,207 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-10 17:34:09,208 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-10 17:34:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:09,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:34:09,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:09,391 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-10 17:34:09,546 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-10 17:34:09,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:09,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:09,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195497568] [2024-11-10 17:34:09,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195497568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:09,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:09,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:34:09,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689657537] [2024-11-10 17:34:09,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:09,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:34:09,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:09,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:34:09,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:34:09,548 INFO L87 Difference]: Start difference. First operand 1094 states and 1196 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-10 17:34:11,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:11,235 INFO L93 Difference]: Finished difference Result 1361 states and 1448 transitions. [2024-11-10 17:34:11,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:34:11,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2024-11-10 17:34:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:11,239 INFO L225 Difference]: With dead ends: 1361 [2024-11-10 17:34:11,239 INFO L226 Difference]: Without dead ends: 1361 [2024-11-10 17:34:11,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-10 17:34:11,240 INFO L432 NwaCegarLoop]: 997 mSDtfsCounter, 360 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:11,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1989 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:34:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-10 17:34:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1090. [2024-11-10 17:34:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 737 states have (on average 1.6037991858887382) internal successors, (1182), 1085 states have internal predecessors, (1182), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1188 transitions. [2024-11-10 17:34:11,251 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1188 transitions. Word has length 37 [2024-11-10 17:34:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:11,251 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1188 transitions. [2024-11-10 17:34:11,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 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-10 17:34:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1188 transitions. [2024-11-10 17:34:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-10 17:34:11,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:11,252 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] [2024-11-10 17:34:11,256 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-10 17:34:11,452 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-10 17:34:11,452 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:11,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1429023718, now seen corresponding path program 1 times [2024-11-10 17:34:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:11,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586982452] [2024-11-10 17:34:11,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:11,453 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-10 17:34:11,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:11,457 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-10 17:34:11,459 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-10 17:34:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:11,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:34:11,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:11,633 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-10 17:34:11,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:11,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:11,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586982452] [2024-11-10 17:34:11,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586982452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:11,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:11,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:34:11,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081734874] [2024-11-10 17:34:11,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:11,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:34:11,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:11,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:34:11,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:34:11,635 INFO L87 Difference]: Start difference. First operand 1090 states and 1188 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-10 17:34:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:11,684 INFO L93 Difference]: Finished difference Result 1072 states and 1158 transitions. [2024-11-10 17:34:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:34:11,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2024-11-10 17:34:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:11,688 INFO L225 Difference]: With dead ends: 1072 [2024-11-10 17:34:11,688 INFO L226 Difference]: Without dead ends: 1072 [2024-11-10 17:34:11,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-10 17:34:11,689 INFO L432 NwaCegarLoop]: 861 mSDtfsCounter, 27 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2545 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-10 17:34:11,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2545 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:34:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-10 17:34:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2024-11-10 17:34:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 719 states have (on average 1.6022253129346313) internal successors, (1152), 1067 states have internal predecessors, (1152), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1158 transitions. [2024-11-10 17:34:11,702 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1158 transitions. Word has length 53 [2024-11-10 17:34:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:11,702 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1158 transitions. [2024-11-10 17:34:11,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-10 17:34:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1158 transitions. [2024-11-10 17:34:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-10 17:34:11,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:11,703 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] [2024-11-10 17:34:11,708 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 (19)] Forceful destruction successful, exit code 0 [2024-11-10 17:34:11,903 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-10 17:34:11,904 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr428REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:11,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:11,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1386542889, now seen corresponding path program 1 times [2024-11-10 17:34:11,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:11,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6724959] [2024-11-10 17:34:11,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:11,905 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-10 17:34:11,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:11,906 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-10 17:34:11,908 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-10 17:34:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:12,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:34:12,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:12,143 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-10 17:34:12,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:12,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:12,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6724959] [2024-11-10 17:34:12,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6724959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:12,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:12,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:34:12,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503123791] [2024-11-10 17:34:12,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:12,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:34:12,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:12,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:34:12,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:34:12,153 INFO L87 Difference]: Start difference. First operand 1072 states and 1158 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-10 17:34:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:12,211 INFO L93 Difference]: Finished difference Result 1060 states and 1138 transitions. [2024-11-10 17:34:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:34:12,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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 57 [2024-11-10 17:34:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:12,215 INFO L225 Difference]: With dead ends: 1060 [2024-11-10 17:34:12,215 INFO L226 Difference]: Without dead ends: 1060 [2024-11-10 17:34:12,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-10 17:34:12,216 INFO L432 NwaCegarLoop]: 857 mSDtfsCounter, 21 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2539 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-10 17:34:12,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2539 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:34:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-11-10 17:34:12,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2024-11-10 17:34:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 707 states have (on average 1.6011315417256011) internal successors, (1132), 1055 states have internal predecessors, (1132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1138 transitions. [2024-11-10 17:34:12,230 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1138 transitions. Word has length 57 [2024-11-10 17:34:12,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:12,231 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1138 transitions. [2024-11-10 17:34:12,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-10 17:34:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1138 transitions. [2024-11-10 17:34:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 17:34:12,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:12,232 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] [2024-11-10 17:34:12,241 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-10 17:34:12,432 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-10 17:34:12,432 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:12,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash -365650590, now seen corresponding path program 1 times [2024-11-10 17:34:12,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:12,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561136468] [2024-11-10 17:34:12,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:12,433 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-10 17:34:12,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:12,435 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-10 17:34:12,435 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-10 17:34:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:12,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:34:12,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:12,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:34:12,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:34:12,642 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:34:12,646 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-10 17:34:12,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 17:34:12,720 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-10 17:34:12,763 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-10 17:34:12,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:12,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:12,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561136468] [2024-11-10 17:34:12,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561136468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:12,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:12,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:34:12,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569675899] [2024-11-10 17:34:12,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:12,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:34:12,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:12,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:34:12,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:34:12,765 INFO L87 Difference]: Start difference. First operand 1060 states and 1138 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-10 17:34:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:13,043 INFO L93 Difference]: Finished difference Result 1544 states and 1643 transitions. [2024-11-10 17:34:13,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:34:13,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 61 [2024-11-10 17:34:13,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:13,048 INFO L225 Difference]: With dead ends: 1544 [2024-11-10 17:34:13,049 INFO L226 Difference]: Without dead ends: 1540 [2024-11-10 17:34:13,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:34:13,050 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 1229 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:13,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 3155 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:34:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2024-11-10 17:34:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1004. [2024-11-10 17:34:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 651 states have (on average 1.6497695852534562) internal successors, (1074), 999 states have internal predecessors, (1074), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1080 transitions. [2024-11-10 17:34:13,066 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1080 transitions. Word has length 61 [2024-11-10 17:34:13,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:13,066 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1080 transitions. [2024-11-10 17:34:13,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-10 17:34:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1080 transitions. [2024-11-10 17:34:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 17:34:13,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:13,067 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] [2024-11-10 17:34:13,075 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-10 17:34:13,267 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-10 17:34:13,268 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr428REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:13,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:13,268 INFO L85 PathProgramCache]: Analyzing trace with hash -989927393, now seen corresponding path program 1 times [2024-11-10 17:34:13,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:13,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695560288] [2024-11-10 17:34:13,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:13,269 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-10 17:34:13,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:13,270 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-10 17:34:13,271 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-10 17:34:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:13,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:34:13,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:13,574 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-10 17:34:13,585 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-10 17:34:14,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:34:14,086 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-10 17:34:14,102 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:34:14,102 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-10 17:34:14,116 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-10 17:34:14,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:14,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695560288] [2024-11-10 17:34:14,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695560288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:14,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:14,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:34:14,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289175916] [2024-11-10 17:34:14,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:14,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:34:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:14,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:34:14,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:34:14,119 INFO L87 Difference]: Start difference. First operand 1004 states and 1080 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 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-10 17:34:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:15,442 INFO L93 Difference]: Finished difference Result 966 states and 1042 transitions. [2024-11-10 17:34:15,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:34:15,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2024-11-10 17:34:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:15,446 INFO L225 Difference]: With dead ends: 966 [2024-11-10 17:34:15,446 INFO L226 Difference]: Without dead ends: 966 [2024-11-10 17:34:15,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 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-10 17:34:15,447 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 1074 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:15,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 579 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:34:15,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-11-10 17:34:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 927. [2024-11-10 17:34:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 612 states have (on average 1.5686274509803921) internal successors, (960), 922 states have internal predecessors, (960), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 966 transitions. [2024-11-10 17:34:15,455 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 966 transitions. Word has length 65 [2024-11-10 17:34:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:15,455 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 966 transitions. [2024-11-10 17:34:15,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 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-10 17:34:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 966 transitions. [2024-11-10 17:34:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 17:34:15,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:15,456 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] [2024-11-10 17:34:15,463 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-10 17:34:15,656 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-10 17:34:15,657 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:15,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:15,657 INFO L85 PathProgramCache]: Analyzing trace with hash -150817521, now seen corresponding path program 1 times [2024-11-10 17:34:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:15,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014030825] [2024-11-10 17:34:15,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:15,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:34:15,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:15,659 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-10 17:34:15,660 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-10 17:34:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:15,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:34:15,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:15,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 17:34:15,928 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-10 17:34:15,942 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-10 17:34:15,948 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-10 17:34:15,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:15,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:15,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014030825] [2024-11-10 17:34:15,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014030825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:15,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:15,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:34:15,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442673923] [2024-11-10 17:34:15,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:15,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:34:15,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:15,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:34:15,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:34:15,950 INFO L87 Difference]: Start difference. First operand 927 states and 966 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-10 17:34:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:17,411 INFO L93 Difference]: Finished difference Result 926 states and 965 transitions. [2024-11-10 17:34:17,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:34:17,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 70 [2024-11-10 17:34:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:17,414 INFO L225 Difference]: With dead ends: 926 [2024-11-10 17:34:17,414 INFO L226 Difference]: Without dead ends: 926 [2024-11-10 17:34:17,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:34:17,415 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 2 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:17,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2164 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:34:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-10 17:34:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2024-11-10 17:34:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 612 states have (on average 1.5669934640522876) internal successors, (959), 921 states have internal predecessors, (959), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 965 transitions. [2024-11-10 17:34:17,441 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 965 transitions. Word has length 70 [2024-11-10 17:34:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:17,442 INFO L471 AbstractCegarLoop]: Abstraction has 926 states and 965 transitions. [2024-11-10 17:34:17,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-10 17:34:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 965 transitions. [2024-11-10 17:34:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 17:34:17,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:17,443 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] [2024-11-10 17:34:17,454 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 (23)] Forceful destruction successful, exit code 0 [2024-11-10 17:34:17,643 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-10 17:34:17,644 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:17,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash -150817520, now seen corresponding path program 1 times [2024-11-10 17:34:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:17,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568219952] [2024-11-10 17:34:17,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:17,645 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-10 17:34:17,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:17,646 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-10 17:34:17,647 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-10 17:34:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:17,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 17:34:17,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:17,922 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-10 17:34:17,941 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-10 17:34:17,951 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-10 17:34:17,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 21 treesize of output 9 [2024-11-10 17:34:18,012 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-10 17:34:18,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:18,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:18,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568219952] [2024-11-10 17:34:18,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568219952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:18,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:18,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:34:18,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515368733] [2024-11-10 17:34:18,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:18,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:34:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:18,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:34:18,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:34:18,014 INFO L87 Difference]: Start difference. First operand 926 states and 965 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-10 17:34:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:20,055 INFO L93 Difference]: Finished difference Result 925 states and 964 transitions. [2024-11-10 17:34:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:34:20,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 70 [2024-11-10 17:34:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:20,058 INFO L225 Difference]: With dead ends: 925 [2024-11-10 17:34:20,058 INFO L226 Difference]: Without dead ends: 925 [2024-11-10 17:34:20,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:34:20,059 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 1 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:20,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2196 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 17:34:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-11-10 17:34:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2024-11-10 17:34:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 611 states have (on average 1.5679214402618658) internal successors, (958), 920 states have internal predecessors, (958), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 17:34:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 964 transitions. [2024-11-10 17:34:20,069 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 964 transitions. Word has length 70 [2024-11-10 17:34:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:20,070 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 964 transitions. [2024-11-10 17:34:20,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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-10 17:34:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 964 transitions. [2024-11-10 17:34:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 17:34:20,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:20,071 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] [2024-11-10 17:34:20,083 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 (24)] Ended with exit code 0 [2024-11-10 17:34:20,271 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-10 17:34:20,271 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:20,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:20,272 INFO L85 PathProgramCache]: Analyzing trace with hash -546754771, now seen corresponding path program 1 times [2024-11-10 17:34:20,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:20,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119018859] [2024-11-10 17:34:20,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:20,272 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-10 17:34:20,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:20,274 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-10 17:34:20,275 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-10 17:34:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:20,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:34:20,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:20,552 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-10 17:34:20,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:34:20,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119018859] [2024-11-10 17:34:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119018859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:34:20,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:34:20,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:34:20,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105161201] [2024-11-10 17:34:20,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:34:20,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:34:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:20,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:34:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:34:20,555 INFO L87 Difference]: Start difference. First operand 925 states and 964 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-10 17:34:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:20,584 INFO L93 Difference]: Finished difference Result 928 states and 968 transitions. [2024-11-10 17:34:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:34:20,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 78 [2024-11-10 17:34:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:20,588 INFO L225 Difference]: With dead ends: 928 [2024-11-10 17:34:20,588 INFO L226 Difference]: Without dead ends: 928 [2024-11-10 17:34:20,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 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-10 17:34:20,589 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 0 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2485 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:20,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2485 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:34:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-11-10 17:34:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2024-11-10 17:34:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 613 states have (on average 1.567699836867863) internal successors, (961), 923 states have internal predecessors, (961), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:34:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 968 transitions. [2024-11-10 17:34:20,603 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 968 transitions. Word has length 78 [2024-11-10 17:34:20,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:20,603 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 968 transitions. [2024-11-10 17:34:20,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-10 17:34:20,604 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 968 transitions. [2024-11-10 17:34:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 17:34:20,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:20,604 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] [2024-11-10 17:34:20,614 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 (25)] Forceful destruction successful, exit code 0 [2024-11-10 17:34:20,805 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-10 17:34:20,805 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:20,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1867228317, now seen corresponding path program 1 times [2024-11-10 17:34:20,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:20,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717185753] [2024-11-10 17:34:20,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:34:20,806 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-10 17:34:20,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:20,808 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-10 17:34:20,808 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-10 17:34:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:34:21,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:34:21,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:21,099 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-10 17:34:21,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:34:21,154 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-10 17:34:21,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:21,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717185753] [2024-11-10 17:34:21,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717185753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:34:21,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:34:21,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 17:34:21,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982458773] [2024-11-10 17:34:21,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:34:21,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 17:34:21,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:21,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 17:34:21,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:34:21,157 INFO L87 Difference]: Start difference. First operand 928 states and 968 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:34:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:21,279 INFO L93 Difference]: Finished difference Result 940 states and 985 transitions. [2024-11-10 17:34:21,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:34:21,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 79 [2024-11-10 17:34:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:21,282 INFO L225 Difference]: With dead ends: 940 [2024-11-10 17:34:21,282 INFO L226 Difference]: Without dead ends: 940 [2024-11-10 17:34:21,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-10 17:34:21,283 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 8 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:21,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2488 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:34:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-11-10 17:34:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 938. [2024-11-10 17:34:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 622 states have (on average 1.5691318327974277) internal successors, (976), 932 states have internal predecessors, (976), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:34:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 983 transitions. [2024-11-10 17:34:21,298 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 983 transitions. Word has length 79 [2024-11-10 17:34:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:21,298 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 983 transitions. [2024-11-10 17:34:21,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:34:21,298 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 983 transitions. [2024-11-10 17:34:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-10 17:34:21,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:21,299 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] [2024-11-10 17:34:21,307 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 (26)] Ended with exit code 0 [2024-11-10 17:34:21,499 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-10 17:34:21,500 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:21,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:21,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1861061805, now seen corresponding path program 2 times [2024-11-10 17:34:21,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:21,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216308599] [2024-11-10 17:34:21,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:34:21,501 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-10 17:34:21,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:21,504 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-10 17:34:21,506 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-10 17:34:21,920 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 17:34:21,921 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:34:21,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 17:34:21,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:21,974 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-10 17:34:21,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:34:22,087 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-10 17:34:22,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:22,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216308599] [2024-11-10 17:34:22,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216308599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:34:22,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:34:22,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 17:34:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443679606] [2024-11-10 17:34:22,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:34:22,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:34:22,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:22,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:34:22,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:34:22,090 INFO L87 Difference]: Start difference. First operand 938 states and 983 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:34:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:22,538 INFO L93 Difference]: Finished difference Result 953 states and 1005 transitions. [2024-11-10 17:34:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 17:34:22,539 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2024-11-10 17:34:22,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:22,541 INFO L225 Difference]: With dead ends: 953 [2024-11-10 17:34:22,542 INFO L226 Difference]: Without dead ends: 949 [2024-11-10 17:34:22,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 17:34:22,543 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 12 mSDsluCounter, 4138 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4968 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:22,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4968 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 17:34:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-10 17:34:22,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 947. [2024-11-10 17:34:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 631 states have (on average 1.565768621236133) internal successors, (988), 941 states have internal predecessors, (988), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:34:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 995 transitions. [2024-11-10 17:34:22,556 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 995 transitions. Word has length 82 [2024-11-10 17:34:22,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:22,557 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 995 transitions. [2024-11-10 17:34:22,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:34:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 995 transitions. [2024-11-10 17:34:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 17:34:22,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:22,558 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] [2024-11-10 17:34:22,568 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 (27)] Forceful destruction successful, exit code 0 [2024-11-10 17:34:22,758 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-10 17:34:22,759 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:22,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:22,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1143344915, now seen corresponding path program 3 times [2024-11-10 17:34:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:22,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930060166] [2024-11-10 17:34:22,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:34:22,760 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-10 17:34:22,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:22,761 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-10 17:34:22,762 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-10 17:34:23,382 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 17:34:23,382 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:34:23,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 17:34:23,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:23,568 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-10 17:34:23,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:34:24,164 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-10 17:34:24,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930060166] [2024-11-10 17:34:24,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930060166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:34:24,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:34:24,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 17:34:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447551382] [2024-11-10 17:34:24,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:34:24,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:34:24,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:24,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:34:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 17:34:24,166 INFO L87 Difference]: Start difference. First operand 947 states and 995 transitions. Second operand has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:34:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:25,732 INFO L93 Difference]: Finished difference Result 971 states and 1034 transitions. [2024-11-10 17:34:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 17:34:25,733 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-10 17:34:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:25,735 INFO L225 Difference]: With dead ends: 971 [2024-11-10 17:34:25,736 INFO L226 Difference]: Without dead ends: 965 [2024-11-10 17:34:25,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 17:34:25,737 INFO L432 NwaCegarLoop]: 831 mSDtfsCounter, 26 mSDsluCounter, 9110 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9941 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:25,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9941 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 17:34:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-11-10 17:34:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2024-11-10 17:34:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 649 states have (on average 1.5577812018489985) internal successors, (1011), 959 states have internal predecessors, (1011), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:34:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1018 transitions. [2024-11-10 17:34:25,754 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1018 transitions. Word has length 88 [2024-11-10 17:34:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:25,754 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1018 transitions. [2024-11-10 17:34:25,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:34:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1018 transitions. [2024-11-10 17:34:25,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 17:34:25,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:25,755 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] [2024-11-10 17:34:25,766 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 (28)] Forceful destruction successful, exit code 0 [2024-11-10 17:34:25,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-10 17:34:25,956 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:25,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:25,957 INFO L85 PathProgramCache]: Analyzing trace with hash -357422739, now seen corresponding path program 4 times [2024-11-10 17:34:25,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:25,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492794392] [2024-11-10 17:34:25,957 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:34:25,958 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-10 17:34:25,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:25,960 INFO L229 MonitoredProcess]: Starting monitored process 29 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-10 17:34:25,961 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 (29)] Waiting until timeout for monitored process [2024-11-10 17:34:26,420 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:34:26,421 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:34:26,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 17:34:26,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:26,769 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-10 17:34:26,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:34:27,901 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-10 17:34:27,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:27,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492794392] [2024-11-10 17:34:27,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492794392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:34:27,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:34:27,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 17:34:27,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392382620] [2024-11-10 17:34:27,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:34:27,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 17:34:27,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:34:27,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 17:34:27,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 17:34:27,905 INFO L87 Difference]: Start difference. First operand 965 states and 1018 transitions. Second operand has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:34:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:34:32,913 INFO L93 Difference]: Finished difference Result 1005 states and 1090 transitions. [2024-11-10 17:34:32,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 17:34:32,914 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-10 17:34:32,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:34:32,916 INFO L225 Difference]: With dead ends: 1005 [2024-11-10 17:34:32,916 INFO L226 Difference]: Without dead ends: 1001 [2024-11-10 17:34:32,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 17:34:32,919 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 27 mSDsluCounter, 19024 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 19854 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:34:32,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 19854 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 17:34:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-10 17:34:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 999. [2024-11-10 17:34:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 683 states have (on average 1.547584187408492) internal successors, (1057), 993 states have internal predecessors, (1057), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 17:34:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1064 transitions. [2024-11-10 17:34:32,930 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1064 transitions. Word has length 100 [2024-11-10 17:34:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:34:32,931 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1064 transitions. [2024-11-10 17:34:32,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:34:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1064 transitions. [2024-11-10 17:34:32,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 17:34:32,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:34:32,932 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] [2024-11-10 17:34:32,946 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 (29)] Forceful destruction successful, exit code 0 [2024-11-10 17:34:33,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-10 17:34:33,133 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-11-10 17:34:33,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:34:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash -871763027, now seen corresponding path program 5 times [2024-11-10 17:34:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:34:33,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642865672] [2024-11-10 17:34:33,134 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:34:33,134 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-10 17:34:33,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:34:33,135 INFO L229 MonitoredProcess]: Starting monitored process 30 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-10 17:34:33,136 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 (30)] Waiting until timeout for monitored process [2024-11-10 17:34:34,214 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-10 17:34:34,214 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:34:34,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-11-10 17:34:34,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:34:34,257 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-10 17:34:34,396 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:34:34,396 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-10 17:34:34,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-10 17:34:34,431 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-10 17:34:34,440 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-10 17:34:34,568 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 22 treesize of output 10 [2024-11-10 17:34:34,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2024-11-10 17:34:35,381 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:34:35,382 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 62 treesize of output 57 [2024-11-10 17:34:35,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:34:35,457 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 31 treesize of output 13 [2024-11-10 17:34:35,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2024-11-10 17:34:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 17:34:35,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:34:36,531 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-10 17:34:36,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:34:36,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642865672] [2024-11-10 17:34:36,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642865672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:34:36,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [919242336] [2024-11-10 17:34:36,539 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:34:36,539 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 17:34:36,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 17:34:36,540 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 17:34:36,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process