./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:07:29,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:07:29,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:07:29,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:07:29,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:07:29,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:07:29,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:07:29,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:07:29,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:07:29,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:07:29,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:07:29,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:07:29,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:07:29,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:07:29,860 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:07:29,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:07:29,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:07:29,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:07:29,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:07:29,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:07:29,862 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:07:29,862 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:07:29,862 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:07:29,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:07:29,863 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:07:29,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:07:29,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:07:29,863 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:07:29,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:07:29,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:07:29,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:07:29,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:07:29,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:07:29,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:07:29,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:07:29,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:07:29,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:07:29,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:07:29,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:07:29,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:07:29,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:07:29,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:07:29,871 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 -> 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 [2024-10-24 16:07:30,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:07:30,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:07:30,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:07:30,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:07:30,094 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:07:30,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2024-10-24 16:07:31,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:07:31,503 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:07:31,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2024-10-24 16:07:31,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8e08a38/34a9219bec3d4540a465b32d6b6b84ad/FLAGf90cf07fe [2024-10-24 16:07:31,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e8e08a38/34a9219bec3d4540a465b32d6b6b84ad [2024-10-24 16:07:31,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:07:31,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:07:31,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:07:31,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:07:31,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:07:31,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:07:31" (1/1) ... [2024-10-24 16:07:31,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29107441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:31, skipping insertion in model container [2024-10-24 16:07:31,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:07:31" (1/1) ... [2024-10-24 16:07:31,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:07:32,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:07:32,153 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-24 16:07:32,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7b1d1804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:32, skipping insertion in model container [2024-10-24 16:07:32,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:07:32,154 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 16:07:32,156 INFO L158 Benchmark]: Toolchain (without parser) took 267.58ms. Allocated memory is still 159.4MB. Free memory was 103.1MB in the beginning and 89.6MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 16:07:32,156 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:07:32,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.07ms. Allocated memory is still 159.4MB. Free memory was 102.6MB in the beginning and 89.6MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 16:07:32,158 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.07ms. Allocated memory is still 159.4MB. Free memory was 102.6MB in the beginning and 89.6MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 534]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:07:33,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:07:33,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 16:07:33,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:07:33,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:07:33,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:07:33,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:07:33,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:07:33,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:07:33,797 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:07:33,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:07:33,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:07:33,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:07:33,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:07:33,800 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:07:33,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:07:33,801 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:07:33,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:07:33,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:07:33,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:07:33,802 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:07:33,806 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:07:33,806 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:07:33,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:07:33,806 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:07:33,807 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 16:07:33,807 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:07:33,807 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 16:07:33,807 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:07:33,808 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:07:33,808 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:07:33,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:07:33,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:07:33,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:07:33,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:07:33,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:07:33,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:07:33,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:07:33,810 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 16:07:33,810 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 16:07:33,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:07:33,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:07:33,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:07:33,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:07:33,811 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 16:07:33,812 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 -> 1c36df5364345a00481880384557a6da7ee9f3df41e2ea49d72bfaffe4fac7a5 [2024-10-24 16:07:34,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:07:34,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:07:34,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:07:34,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:07:34,114 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:07:34,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2024-10-24 16:07:35,392 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:07:35,592 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:07:35,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/selectionsort-alloca-1.i [2024-10-24 16:07:35,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5ebd2ca3/3bce2dd6d83c41548fb719e3ea5ccd5a/FLAGba8816949 [2024-10-24 16:07:35,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5ebd2ca3/3bce2dd6d83c41548fb719e3ea5ccd5a [2024-10-24 16:07:35,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:07:35,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:07:35,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:07:35,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:07:35,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:07:35,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:07:35" (1/1) ... [2024-10-24 16:07:35,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48dc1b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:35, skipping insertion in model container [2024-10-24 16:07:35,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:07:35" (1/1) ... [2024-10-24 16:07:35,674 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:07:35,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:07:35,938 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 16:07:35,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:07:35,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:07:35,990 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:07:36,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:07:36,057 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:07:36,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36 WrapperNode [2024-10-24 16:07:36,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:07:36,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:07:36,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:07:36,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:07:36,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36" (1/1) ... [2024-10-24 16:07:36,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36" (1/1) ... [2024-10-24 16:07:36,100 INFO L138 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2024-10-24 16:07:36,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:07:36,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:07:36,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:07:36,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:07:36,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36" (1/1) ... [2024-10-24 16:07:36,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36" (1/1) ... [2024-10-24 16:07:36,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36" (1/1) ... [2024-10-24 16:07:36,130 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2024-10-24 16:07:36,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36" (1/1) ... [2024-10-24 16:07:36,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36" (1/1) ... [2024-10-24 16:07:36,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36" (1/1) ... [2024-10-24 16:07:36,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36" (1/1) ... [2024-10-24 16:07:36,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36" (1/1) ... [2024-10-24 16:07:36,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36" (1/1) ... [2024-10-24 16:07:36,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:07:36,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:07:36,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:07:36,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:07:36,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36" (1/1) ... [2024-10-24 16:07:36,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:07:36,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:07:36,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 16:07:36,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 16:07:36,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 16:07:36,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 16:07:36,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:07:36,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 16:07:36,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:07:36,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:07:36,311 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:07:36,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:07:36,581 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-24 16:07:36,582 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:07:36,619 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:07:36,619 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-24 16:07:36,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:07:36 BoogieIcfgContainer [2024-10-24 16:07:36,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:07:36,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:07:36,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:07:36,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:07:36,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:07:35" (1/3) ... [2024-10-24 16:07:36,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a87f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:07:36, skipping insertion in model container [2024-10-24 16:07:36,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:07:36" (2/3) ... [2024-10-24 16:07:36,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a87f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:07:36, skipping insertion in model container [2024-10-24 16:07:36,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:07:36" (3/3) ... [2024-10-24 16:07:36,640 INFO L112 eAbstractionObserver]: Analyzing ICFG selectionsort-alloca-1.i [2024-10-24 16:07:36,653 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:07:36,653 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-10-24 16:07:36,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:07:36,698 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;@4b6d5887, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:07:36,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-24 16:07:36,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:07:36,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:36,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:07:36,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:36,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:36,714 INFO L85 PathProgramCache]: Analyzing trace with hash 108210107, now seen corresponding path program 1 times [2024-10-24 16:07:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234300808] [2024-10-24 16:07:36,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:36,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:36,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:36,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:07:36,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 16:07:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:36,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:07:36,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:36,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 16:07:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:36,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:07:36,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:36,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234300808] [2024-10-24 16:07:36,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234300808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:07:36,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:07:36,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:07:36,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836956288] [2024-10-24 16:07:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:07:36,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:07:36,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:36,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:07:36,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:07:36,889 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 33 states have internal predecessors, (41), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-10-24 16:07:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:36,949 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-10-24 16:07:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:07:36,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-10-24 16:07:36,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:36,957 INFO L225 Difference]: With dead ends: 33 [2024-10-24 16:07:36,957 INFO L226 Difference]: Without dead ends: 32 [2024-10-24 16:07:36,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:07:36,961 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:36,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:07:36,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-24 16:07:36,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-24 16:07:36,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 2.0) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-24 16:07:36,983 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 5 [2024-10-24 16:07:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:36,984 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-24 16:07:36,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-10-24 16:07:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-24 16:07:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:07:36,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:36,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:07:36,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 16:07:37,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:37,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:37,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash 108210108, now seen corresponding path program 1 times [2024-10-24 16:07:37,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:37,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127355911] [2024-10-24 16:07:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:37,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:37,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:37,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:07:37,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 (3)] Waiting until timeout for monitored process [2024-10-24 16:07:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:37,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 16:07:37,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:37,285 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-10-24 16:07:37,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:37,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:07:37,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:37,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127355911] [2024-10-24 16:07:37,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127355911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:07:37,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:07:37,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:07:37,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998590532] [2024-10-24 16:07:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:07:37,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:07:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:37,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:07:37,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:07:37,322 INFO L87 Difference]: Start difference. First operand 32 states and 36 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-10-24 16:07:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:37,427 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-10-24 16:07:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:07:37,428 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-10-24 16:07:37,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:37,429 INFO L225 Difference]: With dead ends: 39 [2024-10-24 16:07:37,429 INFO L226 Difference]: Without dead ends: 39 [2024-10-24 16:07:37,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:07:37,430 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:37,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:07:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-24 16:07:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-10-24 16:07:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-10-24 16:07:37,436 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 5 [2024-10-24 16:07:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:37,436 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-10-24 16:07:37,437 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-10-24 16:07:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-10-24 16:07:37,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-24 16:07:37,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:37,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-24 16:07:37,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 16:07:37,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:37,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:37,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:37,639 INFO L85 PathProgramCache]: Analyzing trace with hash 108269690, now seen corresponding path program 1 times [2024-10-24 16:07:37,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:37,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080669736] [2024-10-24 16:07:37,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:37,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:37,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:37,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:07:37,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 16:07:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:37,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 16:07:37,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:37,698 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 8 treesize of output 7 [2024-10-24 16:07:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:37,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:07:37,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:37,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080669736] [2024-10-24 16:07:37,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080669736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:07:37,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:07:37,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:07:37,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188314607] [2024-10-24 16:07:37,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:07:37,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:07:37,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:37,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:07:37,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:07:37,764 INFO L87 Difference]: Start difference. First operand 35 states and 39 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-10-24 16:07:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:37,880 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-10-24 16:07:37,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:07:37,881 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-10-24 16:07:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:37,881 INFO L225 Difference]: With dead ends: 37 [2024-10-24 16:07:37,881 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 16:07:37,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:07:37,882 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:37,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:07:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 16:07:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-10-24 16:07:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.9) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-10-24 16:07:37,886 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 5 [2024-10-24 16:07:37,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:37,887 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-10-24 16:07:37,887 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-10-24 16:07:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-10-24 16:07:37,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:07:37,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:37,887 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-24 16:07:37,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 16:07:38,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:38,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:38,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:38,089 INFO L85 PathProgramCache]: Analyzing trace with hash 910767462, now seen corresponding path program 1 times [2024-10-24 16:07:38,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:38,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526072421] [2024-10-24 16:07:38,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:38,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:38,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:38,092 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:07:38,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 16:07:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:38,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 16:07:38,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:38,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:07:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:38,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:38,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526072421] [2024-10-24 16:07:38,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526072421] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:07:38,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:07:38,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 16:07:38,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230184143] [2024-10-24 16:07:38,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:07:38,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:07:38,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:38,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:07:38,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:07:38,189 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:38,251 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-10-24 16:07:38,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:07:38,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 16:07:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:38,252 INFO L225 Difference]: With dead ends: 39 [2024-10-24 16:07:38,252 INFO L226 Difference]: Without dead ends: 39 [2024-10-24 16:07:38,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:07:38,253 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:38,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:07:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-24 16:07:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-10-24 16:07:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.75) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:38,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-10-24 16:07:38,256 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 7 [2024-10-24 16:07:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:38,256 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-24 16:07:38,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-10-24 16:07:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 16:07:38,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:38,257 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-24 16:07:38,259 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-10-24 16:07:38,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:38,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:38,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:38,460 INFO L85 PathProgramCache]: Analyzing trace with hash 968025764, now seen corresponding path program 1 times [2024-10-24 16:07:38,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:38,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556013719] [2024-10-24 16:07:38,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:38,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:38,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:38,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:07:38,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 16:07:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:38,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 16:07:38,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:38,522 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 8 treesize of output 7 [2024-10-24 16:07:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:38,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:07:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:38,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:38,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556013719] [2024-10-24 16:07:38,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556013719] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:07:38,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:07:38,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-24 16:07:38,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443171170] [2024-10-24 16:07:38,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:07:38,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:07:38,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:38,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:07:38,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:07:38,902 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:39,313 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-10-24 16:07:39,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:07:39,314 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 16:07:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:39,316 INFO L225 Difference]: With dead ends: 44 [2024-10-24 16:07:39,316 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 16:07:39,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:07:39,317 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 27 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:39,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 98 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:07:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 16:07:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 16:07:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.7) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-10-24 16:07:39,321 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 7 [2024-10-24 16:07:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:39,321 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-10-24 16:07:39,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-10-24 16:07:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:07:39,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:39,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:07:39,327 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 (6)] Forceful destruction successful, exit code 0 [2024-10-24 16:07:39,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:39,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:39,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1363447380, now seen corresponding path program 1 times [2024-10-24 16:07:39,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:39,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885982499] [2024-10-24 16:07:39,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:39,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:39,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:39,525 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:07:39,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 16:07:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:39,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:07:39,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:39,627 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~malloc9#1.base_12| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc9#1.base_12| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc9#1.base_12|)))) is different from true [2024-10-24 16:07:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:07:39,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:07:39,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:39,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885982499] [2024-10-24 16:07:39,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885982499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:07:39,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:07:39,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:07:39,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740534161] [2024-10-24 16:07:39,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:07:39,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:07:39,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:39,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:07:39,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-24 16:07:39,629 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:39,695 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-10-24 16:07:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:07:39,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 16:07:39,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:39,696 INFO L225 Difference]: With dead ends: 43 [2024-10-24 16:07:39,696 INFO L226 Difference]: Without dead ends: 41 [2024-10-24 16:07:39,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2024-10-24 16:07:39,697 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:39,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 38 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 34 Unchecked, 0.0s Time] [2024-10-24 16:07:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-24 16:07:39,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-24 16:07:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-10-24 16:07:39,699 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 10 [2024-10-24 16:07:39,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:39,700 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-10-24 16:07:39,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-10-24 16:07:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:07:39,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:39,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:07:39,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 16:07:39,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:39,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:39,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:39,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1363448072, now seen corresponding path program 1 times [2024-10-24 16:07:39,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:39,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522657362] [2024-10-24 16:07:39,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:39,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:39,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:39,903 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:07:39,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 16:07:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:39,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 16:07:39,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:07:39,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:07:39,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:39,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522657362] [2024-10-24 16:07:39,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522657362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:07:39,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:07:39,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:07:39,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454865352] [2024-10-24 16:07:39,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:07:39,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:07:39,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:39,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:07:39,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:07:39,972 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:40,010 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-10-24 16:07:40,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:07:40,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 16:07:40,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:40,012 INFO L225 Difference]: With dead ends: 43 [2024-10-24 16:07:40,012 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 16:07:40,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:07:40,012 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:40,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 16:07:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 16:07:40,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 16:07:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-10-24 16:07:40,016 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 10 [2024-10-24 16:07:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:40,016 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-10-24 16:07:40,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-10-24 16:07:40,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:07:40,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:40,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:07:40,021 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-10-24 16:07:40,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:40,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:40,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:40,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2043506442, now seen corresponding path program 1 times [2024-10-24 16:07:40,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:40,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810612514] [2024-10-24 16:07:40,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:40,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:40,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:40,221 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:07:40,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 16:07:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:40,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 16:07:40,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:40,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-10-24 16:07:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:07:40,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:07:40,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:40,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810612514] [2024-10-24 16:07:40,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810612514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:07:40,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:07:40,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:07:40,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35262678] [2024-10-24 16:07:40,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:07:40,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:07:40,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:40,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:07:40,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:07:40,275 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:40,339 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-10-24 16:07:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:07:40,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 16:07:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:40,339 INFO L225 Difference]: With dead ends: 31 [2024-10-24 16:07:40,340 INFO L226 Difference]: Without dead ends: 31 [2024-10-24 16:07:40,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:07:40,340 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:40,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:07:40,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-24 16:07:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-24 16:07:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 30 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-10-24 16:07:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-24 16:07:40,343 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 10 [2024-10-24 16:07:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:40,343 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-24 16:07:40,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-24 16:07:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:07:40,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:40,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:07:40,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 16:07:40,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:40,545 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:40,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:40,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2043506443, now seen corresponding path program 1 times [2024-10-24 16:07:40,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:40,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922575823] [2024-10-24 16:07:40,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:40,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:40,548 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:07:40,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 16:07:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:40,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 16:07:40,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:40,594 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 8 treesize of output 7 [2024-10-24 16:07:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:40,718 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:07:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:40,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922575823] [2024-10-24 16:07:40,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922575823] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 16:07:40,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:07:40,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-24 16:07:40,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207152851] [2024-10-24 16:07:40,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:07:40,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:07:40,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:40,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:07:40,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:07:40,879 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:41,056 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2024-10-24 16:07:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:07:41,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 16:07:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:41,057 INFO L225 Difference]: With dead ends: 37 [2024-10-24 16:07:41,057 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 16:07:41,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:07:41,058 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:41,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 30 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:07:41,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 16:07:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 16:07:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 36 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2024-10-24 16:07:41,060 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 10 [2024-10-24 16:07:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:41,061 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-10-24 16:07:41,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2024-10-24 16:07:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 16:07:41,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:41,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:07:41,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 16:07:41,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:41,263 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:41,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:41,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2043506489, now seen corresponding path program 1 times [2024-10-24 16:07:41,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:41,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399626219] [2024-10-24 16:07:41,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:41,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:41,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:41,267 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:07:41,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 16:07:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:41,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 16:07:41,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:41,321 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 8 treesize of output 7 [2024-10-24 16:07:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:07:41,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:07:41,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:41,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399626219] [2024-10-24 16:07:41,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399626219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:07:41,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:07:41,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:07:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207710311] [2024-10-24 16:07:41,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:07:41,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:07:41,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:07:41,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:07:41,454 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:41,622 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-10-24 16:07:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:07:41,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 16:07:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:41,623 INFO L225 Difference]: With dead ends: 45 [2024-10-24 16:07:41,623 INFO L226 Difference]: Without dead ends: 45 [2024-10-24 16:07:41,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:07:41,624 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:41,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 13 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:07:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-24 16:07:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2024-10-24 16:07:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-10-24 16:07:41,626 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 10 [2024-10-24 16:07:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:41,627 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-10-24 16:07:41,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-10-24 16:07:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:07:41,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:41,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:07:41,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 16:07:41,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:41,830 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:41,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:41,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1075808294, now seen corresponding path program 1 times [2024-10-24 16:07:41,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475399328] [2024-10-24 16:07:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:41,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:41,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:41,832 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:07:41,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 16:07:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:41,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 16:07:41,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:41,895 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 8 treesize of output 7 [2024-10-24 16:07:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:07:42,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:07:42,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:42,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475399328] [2024-10-24 16:07:42,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475399328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:07:42,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:07:42,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:07:42,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329596501] [2024-10-24 16:07:42,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:07:42,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:07:42,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:42,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:07:42,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:07:42,034 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:42,328 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2024-10-24 16:07:42,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:07:42,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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 11 [2024-10-24 16:07:42,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:42,329 INFO L225 Difference]: With dead ends: 54 [2024-10-24 16:07:42,331 INFO L226 Difference]: Without dead ends: 54 [2024-10-24 16:07:42,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:07:42,332 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 36 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:42,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 32 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:07:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-24 16:07:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2024-10-24 16:07:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 47 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-10-24 16:07:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2024-10-24 16:07:42,337 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 11 [2024-10-24 16:07:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:42,337 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2024-10-24 16:07:42,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2024-10-24 16:07:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 16:07:42,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:42,338 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2024-10-24 16:07:42,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-24 16:07:42,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:42,538 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:42,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:42,539 INFO L85 PathProgramCache]: Analyzing trace with hash 919902754, now seen corresponding path program 2 times [2024-10-24 16:07:42,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:42,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193675989] [2024-10-24 16:07:42,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:07:42,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:42,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:42,540 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 16:07:42,542 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-10-24 16:07:42,585 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:07:42,586 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:07:42,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 16:07:42,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:42,625 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 8 treesize of output 7 [2024-10-24 16:07:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:42,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:07:43,401 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:43,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:43,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193675989] [2024-10-24 16:07:43,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193675989] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:07:43,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:07:43,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-24 16:07:43,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727698820] [2024-10-24 16:07:43,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:07:43,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:07:43,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:43,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:07:43,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:07:43,403 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:45,095 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2024-10-24 16:07:45,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 16:07:45,096 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-24 16:07:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:45,096 INFO L225 Difference]: With dead ends: 60 [2024-10-24 16:07:45,096 INFO L226 Difference]: Without dead ends: 60 [2024-10-24 16:07:45,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2024-10-24 16:07:45,097 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:45,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 81 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:07:45,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-24 16:07:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-24 16:07:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.462962962962963) internal successors, (79), 59 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2024-10-24 16:07:45,100 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 13 [2024-10-24 16:07:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:45,100 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2024-10-24 16:07:45,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2024-10-24 16:07:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 16:07:45,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:45,101 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:07:45,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-24 16:07:45,301 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-10-24 16:07:45,301 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:45,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:45,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1758021311, now seen corresponding path program 1 times [2024-10-24 16:07:45,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:45,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494051120] [2024-10-24 16:07:45,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:45,302 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:45,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:45,303 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-10-24 16:07:45,304 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-10-24 16:07:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:45,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 16:07:45,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:45,362 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 8 treesize of output 7 [2024-10-24 16:07:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:45,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:07:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:46,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:46,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494051120] [2024-10-24 16:07:46,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494051120] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:07:46,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:07:46,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2024-10-24 16:07:46,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136656512] [2024-10-24 16:07:46,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:07:46,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:07:46,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:46,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:07:46,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:07:46,024 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:46,559 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2024-10-24 16:07:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:07:46,560 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 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 15 [2024-10-24 16:07:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:46,560 INFO L225 Difference]: With dead ends: 64 [2024-10-24 16:07:46,560 INFO L226 Difference]: Without dead ends: 60 [2024-10-24 16:07:46,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-10-24 16:07:46,561 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:46,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 40 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 16:07:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-24 16:07:46,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-24 16:07:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 59 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2024-10-24 16:07:46,565 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 15 [2024-10-24 16:07:46,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:46,566 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2024-10-24 16:07:46,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2024-10-24 16:07:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 16:07:46,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:46,566 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:07:46,572 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 (14)] Forceful destruction successful, exit code 0 [2024-10-24 16:07:46,766 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-10-24 16:07:46,767 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:46,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1048973207, now seen corresponding path program 2 times [2024-10-24 16:07:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:46,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236151044] [2024-10-24 16:07:46,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:07:46,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:46,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:46,769 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-10-24 16:07:46,769 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-10-24 16:07:46,821 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:07:46,821 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:07:46,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 16:07:46,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:46,842 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 8 treesize of output 7 [2024-10-24 16:07:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:07:47,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:07:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:07:47,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:47,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236151044] [2024-10-24 16:07:47,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236151044] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:07:47,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:07:47,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-10-24 16:07:47,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975923390] [2024-10-24 16:07:47,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:07:47,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 16:07:47,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:47,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 16:07:47,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:07:47,644 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:48,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:48,934 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2024-10-24 16:07:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 16:07:48,935 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 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-10-24 16:07:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:48,936 INFO L225 Difference]: With dead ends: 108 [2024-10-24 16:07:48,936 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 16:07:48,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2024-10-24 16:07:48,937 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 96 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:48,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 21 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:07:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 16:07:48,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2024-10-24 16:07:48,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 98 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 137 transitions. [2024-10-24 16:07:48,945 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 137 transitions. Word has length 17 [2024-10-24 16:07:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:48,945 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 137 transitions. [2024-10-24 16:07:48,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 137 transitions. [2024-10-24 16:07:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:07:48,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:48,947 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:07:48,951 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-10-24 16:07:49,148 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-10-24 16:07:49,148 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:49,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1841568428, now seen corresponding path program 1 times [2024-10-24 16:07:49,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:49,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800140454] [2024-10-24 16:07:49,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:49,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:49,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:49,150 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-10-24 16:07:49,151 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-10-24 16:07:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:49,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 16:07:49,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:49,210 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 8 treesize of output 7 [2024-10-24 16:07:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:07:49,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:07:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:07:49,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:49,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800140454] [2024-10-24 16:07:49,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800140454] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:07:49,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:07:49,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2024-10-24 16:07:49,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726224970] [2024-10-24 16:07:49,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:07:49,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:07:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:49,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:07:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:07:49,652 INFO L87 Difference]: Start difference. First operand 99 states and 137 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:51,010 INFO L93 Difference]: Finished difference Result 131 states and 179 transitions. [2024-10-24 16:07:51,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 16:07:51,011 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 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-10-24 16:07:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:51,012 INFO L225 Difference]: With dead ends: 131 [2024-10-24 16:07:51,012 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 16:07:51,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2024-10-24 16:07:51,013 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 77 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:51,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 29 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:07:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 16:07:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 81. [2024-10-24 16:07:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 80 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2024-10-24 16:07:51,016 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 18 [2024-10-24 16:07:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:51,016 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2024-10-24 16:07:51,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2024-10-24 16:07:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:07:51,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:51,017 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:07:51,021 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-10-24 16:07:51,217 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-10-24 16:07:51,217 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:51,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash 301112748, now seen corresponding path program 1 times [2024-10-24 16:07:51,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:51,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049658017] [2024-10-24 16:07:51,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:51,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:51,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:51,219 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-10-24 16:07:51,220 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-10-24 16:07:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:51,281 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 16:07:51,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:51,291 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 8 treesize of output 7 [2024-10-24 16:07:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:07:51,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:07:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:07:51,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049658017] [2024-10-24 16:07:51,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049658017] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:07:51,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:07:51,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2024-10-24 16:07:51,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000984988] [2024-10-24 16:07:51,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:07:51,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:07:51,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:51,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:07:51,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:07:51,842 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:52,854 INFO L93 Difference]: Finished difference Result 133 states and 186 transitions. [2024-10-24 16:07:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 16:07:52,855 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 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-10-24 16:07:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:52,856 INFO L225 Difference]: With dead ends: 133 [2024-10-24 16:07:52,856 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 16:07:52,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-10-24 16:07:52,856 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:52,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 71 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:07:52,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 16:07:52,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2024-10-24 16:07:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.4552845528455285) internal successors, (179), 127 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 179 transitions. [2024-10-24 16:07:52,860 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 179 transitions. Word has length 23 [2024-10-24 16:07:52,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:52,860 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 179 transitions. [2024-10-24 16:07:52,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 179 transitions. [2024-10-24 16:07:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:07:52,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:52,861 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:07:52,866 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 (17)] Forceful destruction successful, exit code 0 [2024-10-24 16:07:53,061 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-10-24 16:07:53,062 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:53,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:53,062 INFO L85 PathProgramCache]: Analyzing trace with hash 301112794, now seen corresponding path program 1 times [2024-10-24 16:07:53,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:53,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606579301] [2024-10-24 16:07:53,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:07:53,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:53,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:53,064 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-10-24 16:07:53,064 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-10-24 16:07:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:07:53,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 16:07:53,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:53,141 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 8 treesize of output 7 [2024-10-24 16:07:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:07:53,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:07:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:07:53,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:53,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606579301] [2024-10-24 16:07:53,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606579301] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:07:53,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:07:53,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2024-10-24 16:07:53,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277746473] [2024-10-24 16:07:53,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:07:53,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 16:07:53,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:53,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 16:07:53,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:07:53,982 INFO L87 Difference]: Start difference. First operand 128 states and 179 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:07:55,557 INFO L93 Difference]: Finished difference Result 192 states and 267 transitions. [2024-10-24 16:07:55,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-24 16:07:55,558 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 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-10-24 16:07:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:07:55,558 INFO L225 Difference]: With dead ends: 192 [2024-10-24 16:07:55,558 INFO L226 Difference]: Without dead ends: 187 [2024-10-24 16:07:55,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=265, Invalid=665, Unknown=0, NotChecked=0, Total=930 [2024-10-24 16:07:55,559 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 157 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:07:55,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 29 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 16:07:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-24 16:07:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 156. [2024-10-24 16:07:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.423841059602649) internal successors, (215), 155 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions. [2024-10-24 16:07:55,563 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 215 transitions. Word has length 23 [2024-10-24 16:07:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:07:55,563 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 215 transitions. [2024-10-24 16:07:55,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:07:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions. [2024-10-24 16:07:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:07:55,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:07:55,564 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1] [2024-10-24 16:07:55,570 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 (18)] Ended with exit code 0 [2024-10-24 16:07:55,764 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-10-24 16:07:55,764 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:07:55,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:07:55,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1906285982, now seen corresponding path program 3 times [2024-10-24 16:07:55,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:07:55,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126756831] [2024-10-24 16:07:55,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 16:07:55,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:07:55,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:07:55,767 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-10-24 16:07:55,768 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-10-24 16:07:55,917 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-24 16:07:55,917 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:07:55,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 16:07:55,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:07:55,931 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 8 treesize of output 7 [2024-10-24 16:07:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:56,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:07:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:07:57,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:07:57,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126756831] [2024-10-24 16:07:57,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126756831] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:07:57,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:07:57,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2024-10-24 16:07:57,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577685142] [2024-10-24 16:07:57,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:07:57,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-24 16:07:57,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:07:57,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-24 16:07:57,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2024-10-24 16:07:57,661 INFO L87 Difference]: Start difference. First operand 156 states and 215 transitions. Second operand has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:08,871 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2024-10-24 16:08:08,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-24 16:08:08,871 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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 25 [2024-10-24 16:08:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:08,873 INFO L225 Difference]: With dead ends: 180 [2024-10-24 16:08:08,873 INFO L226 Difference]: Without dead ends: 180 [2024-10-24 16:08:08,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1158, Invalid=2502, Unknown=0, NotChecked=0, Total=3660 [2024-10-24 16:08:08,874 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 49 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:08,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 119 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 16:08:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-24 16:08:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-10-24 16:08:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 175 states have (on average 1.4342857142857144) internal successors, (251), 179 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:08,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 251 transitions. [2024-10-24 16:08:08,879 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 251 transitions. Word has length 25 [2024-10-24 16:08:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:08,880 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 251 transitions. [2024-10-24 16:08:08,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 251 transitions. [2024-10-24 16:08:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 16:08:08,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:08,880 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:08:08,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-24 16:08:09,081 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-10-24 16:08:09,081 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:08:09,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:09,081 INFO L85 PathProgramCache]: Analyzing trace with hash -311537291, now seen corresponding path program 1 times [2024-10-24 16:08:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:08:09,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888427413] [2024-10-24 16:08:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:08:09,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:08:09,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:08:09,084 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-10-24 16:08:09,086 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-10-24 16:08:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:08:09,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 16:08:09,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:08:09,176 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 8 treesize of output 7 [2024-10-24 16:08:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 16:08:09,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:08:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 16:08:09,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:08:09,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888427413] [2024-10-24 16:08:09,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888427413] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:08:09,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:08:09,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2024-10-24 16:08:09,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598945539] [2024-10-24 16:08:09,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:08:09,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 16:08:09,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:08:09,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 16:08:09,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:08:09,899 INFO L87 Difference]: Start difference. First operand 180 states and 251 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:11,769 INFO L93 Difference]: Finished difference Result 276 states and 378 transitions. [2024-10-24 16:08:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-24 16:08:11,770 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 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 29 [2024-10-24 16:08:11,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:11,771 INFO L225 Difference]: With dead ends: 276 [2024-10-24 16:08:11,771 INFO L226 Difference]: Without dead ends: 276 [2024-10-24 16:08:11,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 16:08:11,772 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 125 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:11,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 121 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 16:08:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-24 16:08:11,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 179. [2024-10-24 16:08:11,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.4137931034482758) internal successors, (246), 178 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 246 transitions. [2024-10-24 16:08:11,776 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 246 transitions. Word has length 29 [2024-10-24 16:08:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:11,776 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 246 transitions. [2024-10-24 16:08:11,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 246 transitions. [2024-10-24 16:08:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:08:11,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:11,777 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:08:11,785 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 (20)] Ended with exit code 0 [2024-10-24 16:08:11,977 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-10-24 16:08:11,977 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:08:11,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:11,978 INFO L85 PathProgramCache]: Analyzing trace with hash -816786481, now seen corresponding path program 3 times [2024-10-24 16:08:11,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:08:11,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57779899] [2024-10-24 16:08:11,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 16:08:11,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:08:11,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:08:11,979 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-10-24 16:08:11,981 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-10-24 16:08:12,089 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-24 16:08:12,089 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:08:12,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 16:08:12,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:08:12,104 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 8 treesize of output 7 [2024-10-24 16:08:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:08:12,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:08:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:08:31,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:08:31,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57779899] [2024-10-24 16:08:31,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57779899] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:08:31,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:08:31,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2024-10-24 16:08:31,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419869393] [2024-10-24 16:08:31,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:08:31,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 16:08:31,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:08:31,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 16:08:31,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=461, Unknown=3, NotChecked=0, Total=552 [2024-10-24 16:08:31,079 INFO L87 Difference]: Start difference. First operand 179 states and 246 transitions. Second operand has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 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-10-24 16:08:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:37,161 INFO L93 Difference]: Finished difference Result 191 states and 257 transitions. [2024-10-24 16:08:37,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 16:08:37,162 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 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 32 [2024-10-24 16:08:37,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:37,163 INFO L225 Difference]: With dead ends: 191 [2024-10-24 16:08:37,163 INFO L226 Difference]: Without dead ends: 179 [2024-10-24 16:08:37,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=148, Invalid=719, Unknown=3, NotChecked=0, Total=870 [2024-10-24 16:08:37,164 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:37,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 55 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-24 16:08:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-24 16:08:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-10-24 16:08:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.4080459770114941) internal successors, (245), 178 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 245 transitions. [2024-10-24 16:08:37,170 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 245 transitions. Word has length 32 [2024-10-24 16:08:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:37,171 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 245 transitions. [2024-10-24 16:08:37,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 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-10-24 16:08:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 245 transitions. [2024-10-24 16:08:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 16:08:37,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:37,173 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:08:37,179 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 (21)] Forceful destruction successful, exit code 0 [2024-10-24 16:08:37,374 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-10-24 16:08:37,374 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:08:37,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:37,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1010338971, now seen corresponding path program 4 times [2024-10-24 16:08:37,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:08:37,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611688895] [2024-10-24 16:08:37,375 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 16:08:37,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:08:37,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:08:37,377 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-10-24 16:08:37,378 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-10-24 16:08:37,473 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 16:08:37,473 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:08:37,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 16:08:37,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:08:37,504 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 8 treesize of output 7 [2024-10-24 16:08:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:41,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:08:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:50,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:08:50,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611688895] [2024-10-24 16:08:50,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611688895] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:08:50,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:08:50,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-10-24 16:08:50,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445159931] [2024-10-24 16:08:50,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:08:50,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-24 16:08:50,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:08:50,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-24 16:08:50,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2024-10-24 16:08:50,772 INFO L87 Difference]: Start difference. First operand 179 states and 245 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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-10-24 16:08:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:08:54,542 INFO L93 Difference]: Finished difference Result 328 states and 454 transitions. [2024-10-24 16:08:54,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 16:08:54,543 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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 34 [2024-10-24 16:08:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:08:54,544 INFO L225 Difference]: With dead ends: 328 [2024-10-24 16:08:54,544 INFO L226 Difference]: Without dead ends: 327 [2024-10-24 16:08:54,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2024-10-24 16:08:54,545 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-24 16:08:54,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 51 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-24 16:08:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-24 16:08:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2024-10-24 16:08:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.4119496855345912) internal successors, (449), 322 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:08:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 449 transitions. [2024-10-24 16:08:54,551 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 449 transitions. Word has length 34 [2024-10-24 16:08:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:08:54,552 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 449 transitions. [2024-10-24 16:08:54,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 28 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-10-24 16:08:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 449 transitions. [2024-10-24 16:08:54,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-24 16:08:54,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:08:54,552 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:08:54,558 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 (22)] Forceful destruction successful, exit code 0 [2024-10-24 16:08:54,753 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-10-24 16:08:54,755 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-24 16:08:54,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:08:54,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1964279163, now seen corresponding path program 5 times [2024-10-24 16:08:54,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 16:08:54,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671291385] [2024-10-24 16:08:54,756 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-24 16:08:54,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 16:08:54,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 16:08:54,757 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-10-24 16:08:54,758 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-10-24 16:08:54,944 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-10-24 16:08:54,944 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:08:54,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 16:08:54,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:08:55,032 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 8 treesize of output 7 [2024-10-24 16:08:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 17 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:08:58,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:09:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:09:08,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 16:09:08,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671291385] [2024-10-24 16:09:08,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671291385] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:09:08,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:09:08,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2024-10-24 16:09:08,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675069174] [2024-10-24 16:09:08,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:09:08,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-24 16:09:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 16:09:08,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-24 16:09:08,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2024-10-24 16:09:08,952 INFO L87 Difference]: Start difference. First operand 323 states and 449 transitions. Second operand has 30 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 30 states have internal predecessors, (71), 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)