./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/busybox-1.22.0/basename-2.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6ae2ee47 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 ../../../trunk/examples/svcomp/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 551f956fc33a4b91d0a606a408c53a95b3cc64f8bde6794c363f5ce84e19f38f --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 17:11:31,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 17:11:31,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-22 17:11:31,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 17:11:31,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 17:11:31,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 17:11:31,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 17:11:31,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 17:11:31,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 17:11:31,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 17:11:31,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 17:11:31,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 17:11:31,905 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 17:11:31,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 17:11:31,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 17:11:31,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 17:11:31,908 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 17:11:31,909 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 17:11:31,910 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 17:11:31,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 17:11:31,910 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 17:11:31,914 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 17:11:31,914 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 17:11:31,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 17:11:31,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 17:11:31,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 17:11:31,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 17:11:31,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:11:31,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 17:11:31,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 17:11:31,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 17:11:31,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 17:11:31,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 17:11:31,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 17:11:31,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 17:11:31,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 17:11:31,918 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 551f956fc33a4b91d0a606a408c53a95b3cc64f8bde6794c363f5ce84e19f38f Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 17:11:32,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 17:11:32,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 17:11:32,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 17:11:32,196 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 17:11:32,197 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 17:11:32,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/busybox-1.22.0/basename-2.i [2023-11-22 17:11:33,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 17:11:33,775 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 17:11:33,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/busybox-1.22.0/basename-2.i [2023-11-22 17:11:33,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/006fa5c49/a87e46c964584f879756bf589516013f/FLAG987ce6c26 [2023-11-22 17:11:33,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/006fa5c49/a87e46c964584f879756bf589516013f [2023-11-22 17:11:33,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 17:11:33,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 17:11:33,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 17:11:33,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 17:11:33,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 17:11:33,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:11:33" (1/1) ... [2023-11-22 17:11:33,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a4788e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:33, skipping insertion in model container [2023-11-22 17:11:33,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:11:33" (1/1) ... [2023-11-22 17:11:33,899 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 17:11:34,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:11:34,470 ERROR L324 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) [2023-11-22 17:11:34,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@21bdeb19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:34, skipping insertion in model container [2023-11-22 17:11:34,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 17:11:34,472 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-22 17:11:34,474 INFO L158 Benchmark]: Toolchain (without parser) took 647.87ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 71.0MB in the beginning and 139.0MB in the end (delta: -68.0MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2023-11-22 17:11:34,474 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 130.0MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 17:11:34,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 645.84ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 70.7MB in the beginning and 139.0MB in the end (delta: -68.3MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2023-11-22 17:11:34,477 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 130.0MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 645.84ms. Allocated memory was 130.0MB in the beginning and 174.1MB in the end (delta: 44.0MB). Free memory was 70.7MB in the beginning and 139.0MB in the end (delta: -68.3MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1515]: 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 ../../../trunk/examples/svcomp/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 551f956fc33a4b91d0a606a408c53a95b3cc64f8bde6794c363f5ce84e19f38f --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 17:11:36,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 17:11:36,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-11-22 17:11:36,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 17:11:36,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 17:11:36,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 17:11:36,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 17:11:36,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 17:11:36,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 17:11:36,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 17:11:36,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 17:11:36,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 17:11:36,771 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 17:11:36,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 17:11:36,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 17:11:36,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 17:11:36,773 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 17:11:36,773 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 17:11:36,773 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 17:11:36,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 17:11:36,774 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 17:11:36,775 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 17:11:36,775 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 17:11:36,775 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 17:11:36,776 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 17:11:36,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 17:11:36,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 17:11:36,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 17:11:36,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 17:11:36,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:11:36,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 17:11:36,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 17:11:36,779 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 17:11:36,779 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 17:11:36,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 17:11:36,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 17:11:36,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 17:11:36,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 17:11:36,780 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 17:11:36,781 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 551f956fc33a4b91d0a606a408c53a95b3cc64f8bde6794c363f5ce84e19f38f Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 17:11:37,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 17:11:37,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 17:11:37,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 17:11:37,130 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 17:11:37,131 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 17:11:37,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/busybox-1.22.0/basename-2.i [2023-11-22 17:11:38,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 17:11:38,905 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 17:11:38,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/busybox-1.22.0/basename-2.i [2023-11-22 17:11:38,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83098b22/c96836098a4a492f82473c9a7b0405e5/FLAGc911f73a4 [2023-11-22 17:11:38,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83098b22/c96836098a4a492f82473c9a7b0405e5 [2023-11-22 17:11:38,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 17:11:38,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 17:11:38,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 17:11:38,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 17:11:38,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 17:11:38,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:11:38" (1/1) ... [2023-11-22 17:11:38,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ecc7a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:38, skipping insertion in model container [2023-11-22 17:11:38,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:11:38" (1/1) ... [2023-11-22 17:11:39,032 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 17:11:39,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:11:39,706 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-22 17:11:39,732 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 17:11:39,799 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:11:39,805 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 17:11:39,895 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 17:11:39,996 WARN L675 CHandler]: The function strrchr is called, but not defined or handled by StandardFunctionHandler. [2023-11-22 17:11:40,003 INFO L206 MainTranslator]: Completed translation [2023-11-22 17:11:40,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40 WrapperNode [2023-11-22 17:11:40,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 17:11:40,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 17:11:40,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 17:11:40,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 17:11:40,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40" (1/1) ... [2023-11-22 17:11:40,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40" (1/1) ... [2023-11-22 17:11:40,090 INFO L138 Inliner]: procedures = 358, calls = 122, calls flagged for inlining = 12, calls inlined = 10, statements flattened = 385 [2023-11-22 17:11:40,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 17:11:40,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 17:11:40,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 17:11:40,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 17:11:40,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40" (1/1) ... [2023-11-22 17:11:40,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40" (1/1) ... [2023-11-22 17:11:40,110 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40" (1/1) ... [2023-11-22 17:11:40,146 INFO L189 HeapSplitter]: Split 56 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 3, 0, 12, 2, 11, 2] [2023-11-22 17:11:40,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40" (1/1) ... [2023-11-22 17:11:40,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40" (1/1) ... [2023-11-22 17:11:40,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40" (1/1) ... [2023-11-22 17:11:40,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40" (1/1) ... [2023-11-22 17:11:40,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40" (1/1) ... [2023-11-22 17:11:40,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40" (1/1) ... [2023-11-22 17:11:40,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 17:11:40,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 17:11:40,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 17:11:40,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 17:11:40,293 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40" (1/1) ... [2023-11-22 17:11:40,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 17:11:40,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 17:11:40,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 17:11:40,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 17:11:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-22 17:11:40,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-22 17:11:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-22 17:11:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-22 17:11:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-22 17:11:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-11-22 17:11:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-11-22 17:11:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-11-22 17:11:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-11-22 17:11:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-11-22 17:11:40,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-11-22 17:11:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2023-11-22 17:11:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2023-11-22 17:11:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2023-11-22 17:11:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-22 17:11:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-22 17:11:40,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-22 17:11:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-22 17:11:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-22 17:11:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-11-22 17:11:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-11-22 17:11:40,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-11-22 17:11:40,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-11-22 17:11:40,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-11-22 17:11:40,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-11-22 17:11:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2023-11-22 17:11:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2023-11-22 17:11:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2023-11-22 17:11:40,402 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-22 17:11:40,403 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-22 17:11:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-22 17:11:40,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-22 17:11:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-22 17:11:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-22 17:11:40,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-22 17:11:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-22 17:11:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-22 17:11:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-22 17:11:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-22 17:11:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-11-22 17:11:40,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-11-22 17:11:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-11-22 17:11:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-11-22 17:11:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-11-22 17:11:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-11-22 17:11:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-11-22 17:11:40,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-11-22 17:11:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-11-22 17:11:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-11-22 17:11:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-11-22 17:11:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-11-22 17:11:40,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-11-22 17:11:40,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-11-22 17:11:40,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-11-22 17:11:40,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-11-22 17:11:40,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2023-11-22 17:11:40,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2023-11-22 17:11:40,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2023-11-22 17:11:40,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 17:11:40,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-22 17:11:40,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-22 17:11:40,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-22 17:11:40,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-22 17:11:40,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-22 17:11:40,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-11-22 17:11:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-11-22 17:11:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-11-22 17:11:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-11-22 17:11:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-11-22 17:11:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-11-22 17:11:40,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2023-11-22 17:11:40,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2023-11-22 17:11:40,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2023-11-22 17:11:40,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-22 17:11:40,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-22 17:11:40,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-22 17:11:40,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-22 17:11:40,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-22 17:11:40,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-11-22 17:11:40,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-11-22 17:11:40,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-11-22 17:11:40,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-11-22 17:11:40,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-11-22 17:11:40,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-11-22 17:11:40,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2023-11-22 17:11:40,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2023-11-22 17:11:40,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2023-11-22 17:11:40,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-11-22 17:11:40,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-11-22 17:11:40,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-11-22 17:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-11-22 17:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-11-22 17:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-11-22 17:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-11-22 17:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-11-22 17:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2023-11-22 17:11:40,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2023-11-22 17:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2023-11-22 17:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2023-11-22 17:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2023-11-22 17:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2023-11-22 17:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 17:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2023-11-22 17:11:40,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 17:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-22 17:11:40,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-22 17:11:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-22 17:11:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-22 17:11:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-22 17:11:40,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-22 17:11:40,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-22 17:11:40,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-22 17:11:40,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-22 17:11:40,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-11-22 17:11:40,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-11-22 17:11:40,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-11-22 17:11:40,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-11-22 17:11:40,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-11-22 17:11:40,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 17:11:40,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 17:11:40,929 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 17:11:40,930 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 17:11:42,114 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 17:11:42,169 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 17:11:42,169 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-22 17:11:42,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:11:42 BoogieIcfgContainer [2023-11-22 17:11:42,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 17:11:42,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 17:11:42,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 17:11:42,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 17:11:42,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:11:38" (1/3) ... [2023-11-22 17:11:42,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d306ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:11:42, skipping insertion in model container [2023-11-22 17:11:42,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:11:40" (2/3) ... [2023-11-22 17:11:42,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d306ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:11:42, skipping insertion in model container [2023-11-22 17:11:42,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:11:42" (3/3) ... [2023-11-22 17:11:42,177 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-2.i [2023-11-22 17:11:42,195 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 17:11:42,195 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 94 error locations. [2023-11-22 17:11:42,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 17:11:42,244 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6af63981, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 17:11:42,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2023-11-22 17:11:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 122 states have (on average 2.1147540983606556) internal successors, (258), 216 states have internal predecessors, (258), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:11:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-22 17:11:42,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:42,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-22 17:11:42,257 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:11:42,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:42,262 INFO L85 PathProgramCache]: Analyzing trace with hash 16132, now seen corresponding path program 1 times [2023-11-22 17:11:42,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:11:42,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334355507] [2023-11-22 17:11:42,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:42,297 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 [2023-11-22 17:11:42,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:11:42,300 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) [2023-11-22 17:11:42,335 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 [2023-11-22 17:11:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:42,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 17:11:42,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:11:42,589 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 [2023-11-22 17:11:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:42,601 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:11:42,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:11:42,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334355507] [2023-11-22 17:11:42,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [334355507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:42,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:42,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 17:11:42,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726866109] [2023-11-22 17:11:42,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:42,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:11:42,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:11:42,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:11:42,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:42,647 INFO L87 Difference]: Start difference. First operand has 220 states, 122 states have (on average 2.1147540983606556) internal successors, (258), 216 states have internal predecessors, (258), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-22 17:11:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:43,150 INFO L93 Difference]: Finished difference Result 230 states and 261 transitions. [2023-11-22 17:11:43,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:11:43,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-22 17:11:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:43,162 INFO L225 Difference]: With dead ends: 230 [2023-11-22 17:11:43,162 INFO L226 Difference]: Without dead ends: 229 [2023-11-22 17:11:43,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:43,167 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 217 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:43,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 172 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 17:11:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-22 17:11:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2023-11-22 17:11:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 119 states have (on average 2.0) internal successors, (238), 208 states have internal predecessors, (238), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:11:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 242 transitions. [2023-11-22 17:11:43,293 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 242 transitions. Word has length 2 [2023-11-22 17:11:43,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:43,294 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 242 transitions. [2023-11-22 17:11:43,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-22 17:11:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 242 transitions. [2023-11-22 17:11:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-22 17:11:43,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:43,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-22 17:11:43,308 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 [2023-11-22 17:11:43,500 WARN L477 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 [2023-11-22 17:11:43,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:11:43,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:43,501 INFO L85 PathProgramCache]: Analyzing trace with hash 16133, now seen corresponding path program 1 times [2023-11-22 17:11:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:11:43,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997681194] [2023-11-22 17:11:43,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:43,503 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 [2023-11-22 17:11:43,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:11:43,504 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) [2023-11-22 17:11:43,507 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 [2023-11-22 17:11:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:43,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 17:11:43,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:11:43,681 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 [2023-11-22 17:11:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:43,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:11:43,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:11:43,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997681194] [2023-11-22 17:11:43,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997681194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:43,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:43,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 17:11:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21334609] [2023-11-22 17:11:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:43,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:11:43,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:11:43,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:11:43,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:43,700 INFO L87 Difference]: Start difference. First operand 212 states and 242 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-22 17:11:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:44,478 INFO L93 Difference]: Finished difference Result 211 states and 241 transitions. [2023-11-22 17:11:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:11:44,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-22 17:11:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:44,481 INFO L225 Difference]: With dead ends: 211 [2023-11-22 17:11:44,482 INFO L226 Difference]: Without dead ends: 211 [2023-11-22 17:11:44,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:44,483 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 9 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:44,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 356 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-22 17:11:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-22 17:11:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2023-11-22 17:11:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 119 states have (on average 1.9915966386554622) internal successors, (237), 207 states have internal predecessors, (237), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:11:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 241 transitions. [2023-11-22 17:11:44,494 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 241 transitions. Word has length 2 [2023-11-22 17:11:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:44,494 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 241 transitions. [2023-11-22 17:11:44,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2023-11-22 17:11:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 241 transitions. [2023-11-22 17:11:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-22 17:11:44,495 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:44,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-22 17:11:44,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-22 17:11:44,707 WARN L477 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 [2023-11-22 17:11:44,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:11:44,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:44,708 INFO L85 PathProgramCache]: Analyzing trace with hash 15944658, now seen corresponding path program 1 times [2023-11-22 17:11:44,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:11:44,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212314618] [2023-11-22 17:11:44,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:44,709 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 [2023-11-22 17:11:44,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:11:44,711 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) [2023-11-22 17:11:44,742 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 [2023-11-22 17:11:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:44,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 17:11:44,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:11:44,943 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 [2023-11-22 17:11:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:45,008 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:11:45,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:11:45,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212314618] [2023-11-22 17:11:45,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212314618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:45,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:45,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:11:45,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407307789] [2023-11-22 17:11:45,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:45,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:11:45,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:11:45,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:11:45,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:11:45,015 INFO L87 Difference]: Start difference. First operand 211 states and 241 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:11:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:45,868 INFO L93 Difference]: Finished difference Result 213 states and 243 transitions. [2023-11-22 17:11:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:11:45,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-22 17:11:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:45,871 INFO L225 Difference]: With dead ends: 213 [2023-11-22 17:11:45,871 INFO L226 Difference]: Without dead ends: 213 [2023-11-22 17:11:45,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:11:45,872 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 9 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:45,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 499 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-22 17:11:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-11-22 17:11:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2023-11-22 17:11:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 121 states have (on average 1.975206611570248) internal successors, (239), 209 states have internal predecessors, (239), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:11:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 243 transitions. [2023-11-22 17:11:45,882 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 243 transitions. Word has length 4 [2023-11-22 17:11:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:45,883 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 243 transitions. [2023-11-22 17:11:45,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:11:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 243 transitions. [2023-11-22 17:11:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-22 17:11:45,884 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:45,884 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2023-11-22 17:11:45,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-22 17:11:46,088 WARN L477 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 [2023-11-22 17:11:46,089 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:11:46,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1856620650, now seen corresponding path program 1 times [2023-11-22 17:11:46,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:11:46,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687248552] [2023-11-22 17:11:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:46,091 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 [2023-11-22 17:11:46,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:11:46,093 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) [2023-11-22 17:11:46,098 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 [2023-11-22 17:11:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:46,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 17:11:46,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:11:46,289 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 [2023-11-22 17:11:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:46,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:11:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:46,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:11:46,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687248552] [2023-11-22 17:11:46,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687248552] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:11:46,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:11:46,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-11-22 17:11:46,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763819633] [2023-11-22 17:11:46,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:11:46,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 17:11:46,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:11:46,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 17:11:46,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:11:46,787 INFO L87 Difference]: Start difference. First operand 213 states and 243 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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) [2023-11-22 17:11:49,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:49,579 INFO L93 Difference]: Finished difference Result 215 states and 245 transitions. [2023-11-22 17:11:49,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 17:11:49,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 6 [2023-11-22 17:11:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:49,581 INFO L225 Difference]: With dead ends: 215 [2023-11-22 17:11:49,581 INFO L226 Difference]: Without dead ends: 215 [2023-11-22 17:11:49,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-22 17:11:49,582 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 19 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:49,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 786 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-22 17:11:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-11-22 17:11:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2023-11-22 17:11:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 124 states have (on average 1.9435483870967742) internal successors, (241), 211 states have internal predecessors, (241), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:11:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 245 transitions. [2023-11-22 17:11:49,604 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 245 transitions. Word has length 6 [2023-11-22 17:11:49,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:49,606 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 245 transitions. [2023-11-22 17:11:49,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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) [2023-11-22 17:11:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 245 transitions. [2023-11-22 17:11:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 17:11:49,607 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:49,607 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2023-11-22 17:11:49,613 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 [2023-11-22 17:11:49,812 WARN L477 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 [2023-11-22 17:11:49,813 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:11:49,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:49,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1356279525, now seen corresponding path program 1 times [2023-11-22 17:11:49,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:11:49,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796586152] [2023-11-22 17:11:49,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:49,815 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 [2023-11-22 17:11:49,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:11:49,816 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) [2023-11-22 17:11:49,847 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 [2023-11-22 17:11:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:50,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 17:11:50,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:11:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:50,082 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:11:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:50,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:11:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796586152] [2023-11-22 17:11:50,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796586152] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:11:50,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:11:50,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-22 17:11:50,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40077930] [2023-11-22 17:11:50,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:11:50,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 17:11:50,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:11:50,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 17:11:50,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 17:11:50,150 INFO L87 Difference]: Start difference. First operand 215 states and 245 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:11:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:50,750 INFO L93 Difference]: Finished difference Result 225 states and 255 transitions. [2023-11-22 17:11:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 17:11:50,751 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-22 17:11:50,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:50,752 INFO L225 Difference]: With dead ends: 225 [2023-11-22 17:11:50,752 INFO L226 Difference]: Without dead ends: 225 [2023-11-22 17:11:50,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-22 17:11:50,754 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 6 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:50,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1067 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 17:11:50,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-22 17:11:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2023-11-22 17:11:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 134 states have (on average 1.873134328358209) internal successors, (251), 221 states have internal predecessors, (251), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:11:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 255 transitions. [2023-11-22 17:11:50,760 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 255 transitions. Word has length 11 [2023-11-22 17:11:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:50,760 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 255 transitions. [2023-11-22 17:11:50,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 17:11:50,761 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 255 transitions. [2023-11-22 17:11:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-22 17:11:50,761 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:50,761 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-22 17:11:50,779 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 [2023-11-22 17:11:50,961 WARN L477 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 [2023-11-22 17:11:50,962 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:11:50,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1917474361, now seen corresponding path program 2 times [2023-11-22 17:11:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:11:50,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297982159] [2023-11-22 17:11:50,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 17:11:50,964 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 [2023-11-22 17:11:50,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:11:50,965 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) [2023-11-22 17:11:50,968 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 [2023-11-22 17:11:51,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-22 17:11:51,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 17:11:51,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 17:11:51,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:11:51,194 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-22 17:11:51,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-22 17:11:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-22 17:11:51,476 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:11:51,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:11:51,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297982159] [2023-11-22 17:11:51,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297982159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:51,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:51,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 17:11:51,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071296370] [2023-11-22 17:11:51,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:51,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:11:51,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:11:51,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:11:51,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:51,481 INFO L87 Difference]: Start difference. First operand 225 states and 255 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2023-11-22 17:11:51,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:51,984 INFO L93 Difference]: Finished difference Result 241 states and 272 transitions. [2023-11-22 17:11:51,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:11:51,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-22 17:11:51,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:51,986 INFO L225 Difference]: With dead ends: 241 [2023-11-22 17:11:51,986 INFO L226 Difference]: Without dead ends: 241 [2023-11-22 17:11:51,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:51,987 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 216 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:51,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 171 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 17:11:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-11-22 17:11:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 224. [2023-11-22 17:11:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 134 states have (on average 1.8656716417910448) internal successors, (250), 220 states have internal predecessors, (250), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:11:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 254 transitions. [2023-11-22 17:11:51,993 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 254 transitions. Word has length 21 [2023-11-22 17:11:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:51,994 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 254 transitions. [2023-11-22 17:11:51,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2023-11-22 17:11:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 254 transitions. [2023-11-22 17:11:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-22 17:11:51,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:51,995 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-22 17:11:52,002 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 [2023-11-22 17:11:52,199 WARN L477 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 [2023-11-22 17:11:52,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:11:52,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1917474360, now seen corresponding path program 1 times [2023-11-22 17:11:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:11:52,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1684563077] [2023-11-22 17:11:52,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:52,201 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 [2023-11-22 17:11:52,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:11:52,202 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) [2023-11-22 17:11:52,203 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 [2023-11-22 17:11:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:52,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-22 17:11:52,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:11:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:52,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:11:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 17:11:52,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:11:52,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1684563077] [2023-11-22 17:11:52,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1684563077] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:11:52,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:11:52,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-22 17:11:52,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420466142] [2023-11-22 17:11:52,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:11:52,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-22 17:11:52,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:11:52,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-22 17:11:52,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-22 17:11:52,780 INFO L87 Difference]: Start difference. First operand 224 states and 254 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 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) [2023-11-22 17:11:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:53,902 INFO L93 Difference]: Finished difference Result 228 states and 258 transitions. [2023-11-22 17:11:53,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 17:11:53,903 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 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) Word has length 21 [2023-11-22 17:11:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:53,904 INFO L225 Difference]: With dead ends: 228 [2023-11-22 17:11:53,904 INFO L226 Difference]: Without dead ends: 228 [2023-11-22 17:11:53,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-22 17:11:53,905 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 2 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:53,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2334 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 17:11:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-11-22 17:11:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2023-11-22 17:11:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 138 states have (on average 1.8405797101449275) internal successors, (254), 224 states have internal predecessors, (254), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:11:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 258 transitions. [2023-11-22 17:11:53,911 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 258 transitions. Word has length 21 [2023-11-22 17:11:53,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:53,912 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 258 transitions. [2023-11-22 17:11:53,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 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) [2023-11-22 17:11:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 258 transitions. [2023-11-22 17:11:53,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 17:11:53,913 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:53,913 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2023-11-22 17:11:53,920 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 [2023-11-22 17:11:54,116 WARN L477 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 [2023-11-22 17:11:54,117 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:11:54,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:54,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1608946752, now seen corresponding path program 2 times [2023-11-22 17:11:54,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:11:54,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513119610] [2023-11-22 17:11:54,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 17:11:54,118 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 [2023-11-22 17:11:54,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:11:54,119 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) [2023-11-22 17:11:54,121 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 [2023-11-22 17:11:54,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-22 17:11:54,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 17:11:54,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 17:11:54,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:11:54,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:11:54,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-22 17:11:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:11:54,586 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:11:54,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:11:54,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513119610] [2023-11-22 17:11:54,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513119610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:54,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:54,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-22 17:11:54,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946578968] [2023-11-22 17:11:54,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:54,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:11:54,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:11:54,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:11:54,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:54,592 INFO L87 Difference]: Start difference. First operand 228 states and 258 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2023-11-22 17:11:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:55,181 INFO L93 Difference]: Finished difference Result 231 states and 260 transitions. [2023-11-22 17:11:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:11:55,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 [2023-11-22 17:11:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:55,183 INFO L225 Difference]: With dead ends: 231 [2023-11-22 17:11:55,183 INFO L226 Difference]: Without dead ends: 231 [2023-11-22 17:11:55,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:55,184 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 6 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:55,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 362 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 17:11:55,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-11-22 17:11:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2023-11-22 17:11:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 141 states have (on average 1.8156028368794326) internal successors, (256), 226 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:11:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 260 transitions. [2023-11-22 17:11:55,190 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 260 transitions. Word has length 25 [2023-11-22 17:11:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:55,191 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 260 transitions. [2023-11-22 17:11:55,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2023-11-22 17:11:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 260 transitions. [2023-11-22 17:11:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-22 17:11:55,192 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:55,192 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:11:55,199 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 [2023-11-22 17:11:55,397 WARN L477 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 [2023-11-22 17:11:55,397 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:11:55,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1867572295, now seen corresponding path program 1 times [2023-11-22 17:11:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:11:55,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415311572] [2023-11-22 17:11:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:55,399 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 [2023-11-22 17:11:55,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:11:55,400 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) [2023-11-22 17:11:55,401 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 [2023-11-22 17:11:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:55,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 17:11:55,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:11:55,875 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-22 17:11:55,875 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-22 17:11:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:11:55,899 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:11:55,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:11:55,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415311572] [2023-11-22 17:11:55,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415311572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:55,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:55,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:11:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092145684] [2023-11-22 17:11:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:55,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:11:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:11:55,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:11:55,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:55,902 INFO L87 Difference]: Start difference. First operand 231 states and 260 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:11:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:56,565 INFO L93 Difference]: Finished difference Result 243 states and 273 transitions. [2023-11-22 17:11:56,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:11:56,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-11-22 17:11:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:56,568 INFO L225 Difference]: With dead ends: 243 [2023-11-22 17:11:56,568 INFO L226 Difference]: Without dead ends: 243 [2023-11-22 17:11:56,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:11:56,568 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 202 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:56,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 172 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 17:11:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-11-22 17:11:56,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 226. [2023-11-22 17:11:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 141 states have (on average 1.7801418439716312) internal successors, (251), 221 states have internal predecessors, (251), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:11:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 255 transitions. [2023-11-22 17:11:56,574 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 255 transitions. Word has length 32 [2023-11-22 17:11:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:56,574 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 255 transitions. [2023-11-22 17:11:56,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:11:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 255 transitions. [2023-11-22 17:11:56,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-22 17:11:56,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:56,575 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:11:56,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-22 17:11:56,780 WARN L477 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 [2023-11-22 17:11:56,780 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:11:56,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1867572296, now seen corresponding path program 1 times [2023-11-22 17:11:56,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:11:56,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20608242] [2023-11-22 17:11:56,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:56,782 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 [2023-11-22 17:11:56,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:11:56,783 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) [2023-11-22 17:11:56,783 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 [2023-11-22 17:11:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:11:57,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 17:11:57,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:11:57,350 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-22 17:11:57,351 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 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-22 17:11:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:11:57,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:11:57,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:11:57,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20608242] [2023-11-22 17:11:57,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20608242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:11:57,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:11:57,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 17:11:57,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925332981] [2023-11-22 17:11:57,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:11:57,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 17:11:57,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:11:57,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 17:11:57,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:11:57,460 INFO L87 Difference]: Start difference. First operand 226 states and 255 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:11:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:11:59,441 INFO L93 Difference]: Finished difference Result 394 states and 451 transitions. [2023-11-22 17:11:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:11:59,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-11-22 17:11:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:11:59,444 INFO L225 Difference]: With dead ends: 394 [2023-11-22 17:11:59,444 INFO L226 Difference]: Without dead ends: 394 [2023-11-22 17:11:59,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-22 17:11:59,445 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 609 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-22 17:11:59,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 566 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-22 17:11:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-11-22 17:11:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 317. [2023-11-22 17:11:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 232 states have (on average 1.8620689655172413) internal successors, (432), 311 states have internal predecessors, (432), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:11:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 438 transitions. [2023-11-22 17:11:59,458 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 438 transitions. Word has length 32 [2023-11-22 17:11:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:11:59,459 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 438 transitions. [2023-11-22 17:11:59,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:11:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 438 transitions. [2023-11-22 17:11:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-22 17:11:59,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:11:59,462 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:11:59,473 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 (11)] Forceful destruction successful, exit code 0 [2023-11-22 17:11:59,672 WARN L477 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 [2023-11-22 17:11:59,672 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:11:59,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:11:59,673 INFO L85 PathProgramCache]: Analyzing trace with hash -558930751, now seen corresponding path program 1 times [2023-11-22 17:11:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:11:59,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432184885] [2023-11-22 17:11:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:11:59,674 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 [2023-11-22 17:11:59,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:11:59,675 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) [2023-11-22 17:11:59,676 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 [2023-11-22 17:12:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:12:00,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 17:12:00,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:00,237 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-22 17:12:00,237 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 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-22 17:12:00,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:12:00,519 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-22 17:12:00,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2023-11-22 17:12:00,538 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 17:12:00,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-22 17:12:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:12:00,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:12:00,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:12:00,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432184885] [2023-11-22 17:12:00,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432184885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:12:00,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:12:00,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 17:12:00,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389599564] [2023-11-22 17:12:00,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:12:00,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 17:12:00,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:12:00,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 17:12:00,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:12:00,635 INFO L87 Difference]: Start difference. First operand 317 states and 438 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:03,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:12:03,496 INFO L93 Difference]: Finished difference Result 410 states and 468 transitions. [2023-11-22 17:12:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 17:12:03,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2023-11-22 17:12:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:12:03,499 INFO L225 Difference]: With dead ends: 410 [2023-11-22 17:12:03,499 INFO L226 Difference]: Without dead ends: 410 [2023-11-22 17:12:03,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-22 17:12:03,500 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 657 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-22 17:12:03,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 683 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-22 17:12:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-11-22 17:12:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 327. [2023-11-22 17:12:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 242 states have (on average 1.8553719008264462) internal successors, (449), 321 states have internal predecessors, (449), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:12:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 455 transitions. [2023-11-22 17:12:03,507 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 455 transitions. Word has length 34 [2023-11-22 17:12:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:12:03,507 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 455 transitions. [2023-11-22 17:12:03,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:03,508 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 455 transitions. [2023-11-22 17:12:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-22 17:12:03,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:12:03,508 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:12:03,520 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 [2023-11-22 17:12:03,718 WARN L477 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 [2023-11-22 17:12:03,719 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:12:03,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:12:03,719 INFO L85 PathProgramCache]: Analyzing trace with hash -261126639, now seen corresponding path program 1 times [2023-11-22 17:12:03,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:12:03,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135623403] [2023-11-22 17:12:03,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:12:03,720 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 [2023-11-22 17:12:03,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:12:03,721 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) [2023-11-22 17:12:03,722 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 [2023-11-22 17:12:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:12:04,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 17:12:04,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:04,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 17:12:04,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:12:04,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-22 17:12:04,296 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-22 17:12:04,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-22 17:12:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:12:04,320 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:12:04,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:12:04,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135623403] [2023-11-22 17:12:04,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135623403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:12:04,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:12:04,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:12:04,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145995728] [2023-11-22 17:12:04,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:12:04,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:12:04,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:12:04,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:12:04,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:12:04,322 INFO L87 Difference]: Start difference. First operand 327 states and 455 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:12:04,661 INFO L93 Difference]: Finished difference Result 341 states and 473 transitions. [2023-11-22 17:12:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:12:04,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2023-11-22 17:12:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:12:04,663 INFO L225 Difference]: With dead ends: 341 [2023-11-22 17:12:04,664 INFO L226 Difference]: Without dead ends: 341 [2023-11-22 17:12:04,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:12:04,664 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 195 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 17:12:04,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 170 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 17:12:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-11-22 17:12:04,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2023-11-22 17:12:04,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 254 states have (on average 1.8385826771653544) internal successors, (467), 332 states have internal predecessors, (467), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:12:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 473 transitions. [2023-11-22 17:12:04,672 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 473 transitions. Word has length 36 [2023-11-22 17:12:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:12:04,672 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 473 transitions. [2023-11-22 17:12:04,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 473 transitions. [2023-11-22 17:12:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-22 17:12:04,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:12:04,673 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:12:04,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-22 17:12:04,880 WARN L477 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 [2023-11-22 17:12:04,880 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:12:04,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:12:04,881 INFO L85 PathProgramCache]: Analyzing trace with hash -261126638, now seen corresponding path program 1 times [2023-11-22 17:12:04,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:12:04,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433952673] [2023-11-22 17:12:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:12:04,882 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 [2023-11-22 17:12:04,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:12:04,883 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) [2023-11-22 17:12:04,884 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 [2023-11-22 17:12:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:12:05,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 17:12:05,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:05,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-22 17:12:05,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 17:12:05,475 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 [2023-11-22 17:12:05,482 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 11 treesize of output 10 [2023-11-22 17:12:05,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:12:05,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-22 17:12:05,658 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 17:12:05,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-22 17:12:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:12:05,764 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:12:05,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:12:05,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433952673] [2023-11-22 17:12:05,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433952673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:12:05,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:12:05,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 17:12:05,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789689163] [2023-11-22 17:12:05,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:12:05,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 17:12:05,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:12:05,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 17:12:05,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-22 17:12:05,766 INFO L87 Difference]: Start difference. First operand 338 states and 473 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:12:09,244 INFO L93 Difference]: Finished difference Result 353 states and 482 transitions. [2023-11-22 17:12:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 17:12:09,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2023-11-22 17:12:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:12:09,246 INFO L225 Difference]: With dead ends: 353 [2023-11-22 17:12:09,246 INFO L226 Difference]: Without dead ends: 353 [2023-11-22 17:12:09,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-22 17:12:09,247 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 472 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-22 17:12:09,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 491 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-22 17:12:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-11-22 17:12:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 338. [2023-11-22 17:12:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 254 states have (on average 1.8267716535433072) internal successors, (464), 332 states have internal predecessors, (464), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:12:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 470 transitions. [2023-11-22 17:12:09,254 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 470 transitions. Word has length 36 [2023-11-22 17:12:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:12:09,255 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 470 transitions. [2023-11-22 17:12:09,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 470 transitions. [2023-11-22 17:12:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 17:12:09,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:12:09,256 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:12:09,269 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 [2023-11-22 17:12:09,464 WARN L477 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 [2023-11-22 17:12:09,464 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:12:09,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:12:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1834188420, now seen corresponding path program 1 times [2023-11-22 17:12:09,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:12:09,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540023076] [2023-11-22 17:12:09,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:12:09,465 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 [2023-11-22 17:12:09,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:12:09,467 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) [2023-11-22 17:12:09,468 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 [2023-11-22 17:12:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:12:09,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 17:12:09,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:09,803 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 [2023-11-22 17:12:09,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-22 17:12:09,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2023-11-22 17:12:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:12:09,853 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:12:09,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:12:09,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540023076] [2023-11-22 17:12:09,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540023076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:12:09,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:12:09,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:12:09,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531293455] [2023-11-22 17:12:09,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:12:09,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:12:09,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:12:09,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:12:09,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:12:09,855 INFO L87 Difference]: Start difference. First operand 338 states and 470 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:12:10,574 INFO L93 Difference]: Finished difference Result 337 states and 468 transitions. [2023-11-22 17:12:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:12:10,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2023-11-22 17:12:10,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:12:10,576 INFO L225 Difference]: With dead ends: 337 [2023-11-22 17:12:10,576 INFO L226 Difference]: Without dead ends: 337 [2023-11-22 17:12:10,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:12:10,577 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 15 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 17:12:10,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 607 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 17:12:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-11-22 17:12:10,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2023-11-22 17:12:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 254 states have (on average 1.8188976377952757) internal successors, (462), 331 states have internal predecessors, (462), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:12:10,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 468 transitions. [2023-11-22 17:12:10,584 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 468 transitions. Word has length 38 [2023-11-22 17:12:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:12:10,585 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 468 transitions. [2023-11-22 17:12:10,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 468 transitions. [2023-11-22 17:12:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 17:12:10,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:12:10,586 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:12:10,593 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 (15)] Forceful destruction successful, exit code 0 [2023-11-22 17:12:10,792 WARN L477 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 [2023-11-22 17:12:10,792 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:12:10,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:12:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1834188419, now seen corresponding path program 1 times [2023-11-22 17:12:10,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:12:10,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374368100] [2023-11-22 17:12:10,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:12:10,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:12:10,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:12:10,795 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) [2023-11-22 17:12:10,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-22 17:12:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:12:11,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-22 17:12:11,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:11,163 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 [2023-11-22 17:12:11,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-22 17:12:11,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-11-22 17:12:11,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2023-11-22 17:12:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:12:11,271 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:12:11,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:12:11,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374368100] [2023-11-22 17:12:11,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374368100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:12:11,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:12:11,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:12:11,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204906120] [2023-11-22 17:12:11,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:12:11,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:12:11,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:12:11,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:12:11,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:12:11,273 INFO L87 Difference]: Start difference. First operand 337 states and 468 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:12,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:12:12,186 INFO L93 Difference]: Finished difference Result 336 states and 466 transitions. [2023-11-22 17:12:12,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:12:12,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2023-11-22 17:12:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:12:12,188 INFO L225 Difference]: With dead ends: 336 [2023-11-22 17:12:12,188 INFO L226 Difference]: Without dead ends: 336 [2023-11-22 17:12:12,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:12:12,189 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 13 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-22 17:12:12,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 627 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-22 17:12:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-11-22 17:12:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2023-11-22 17:12:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 254 states have (on average 1.811023622047244) internal successors, (460), 330 states have internal predecessors, (460), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:12:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 466 transitions. [2023-11-22 17:12:12,196 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 466 transitions. Word has length 38 [2023-11-22 17:12:12,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:12:12,196 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 466 transitions. [2023-11-22 17:12:12,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 466 transitions. [2023-11-22 17:12:12,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-22 17:12:12,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:12:12,197 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:12:12,212 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 (16)] Forceful destruction successful, exit code 0 [2023-11-22 17:12:12,408 WARN L477 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 [2023-11-22 17:12:12,409 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:12:12,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:12:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1720769446, now seen corresponding path program 1 times [2023-11-22 17:12:12,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:12:12,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641650757] [2023-11-22 17:12:12,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:12:12,410 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 [2023-11-22 17:12:12,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:12:12,411 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) [2023-11-22 17:12:12,411 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 [2023-11-22 17:12:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:12:12,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 17:12:12,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:12,794 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 [2023-11-22 17:12:12,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-22 17:12:12,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2023-11-22 17:12:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:12:12,855 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:12:12,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:12:12,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641650757] [2023-11-22 17:12:12,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641650757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:12:12,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:12:12,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 17:12:12,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457318431] [2023-11-22 17:12:12,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:12:12,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 17:12:12,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:12:12,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 17:12:12,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:12:12,857 INFO L87 Difference]: Start difference. First operand 336 states and 466 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:13,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:12:13,632 INFO L93 Difference]: Finished difference Result 335 states and 464 transitions. [2023-11-22 17:12:13,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 17:12:13,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2023-11-22 17:12:13,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:12:13,634 INFO L225 Difference]: With dead ends: 335 [2023-11-22 17:12:13,634 INFO L226 Difference]: Without dead ends: 335 [2023-11-22 17:12:13,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:12:13,635 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 17:12:13,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 604 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 17:12:13,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-11-22 17:12:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2023-11-22 17:12:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 254 states have (on average 1.8031496062992125) internal successors, (458), 329 states have internal predecessors, (458), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:12:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 464 transitions. [2023-11-22 17:12:13,643 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 464 transitions. Word has length 41 [2023-11-22 17:12:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:12:13,643 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 464 transitions. [2023-11-22 17:12:13,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 464 transitions. [2023-11-22 17:12:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-22 17:12:13,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:12:13,644 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:12:13,656 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 [2023-11-22 17:12:13,852 WARN L477 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 [2023-11-22 17:12:13,853 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:12:13,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:12:13,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1720769445, now seen corresponding path program 1 times [2023-11-22 17:12:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:12:13,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308691088] [2023-11-22 17:12:13,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:12:13,855 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 [2023-11-22 17:12:13,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:12:13,856 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) [2023-11-22 17:12:13,889 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 [2023-11-22 17:12:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:12:14,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 17:12:14,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:14,288 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 [2023-11-22 17:12:14,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-11-22 17:12:14,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-22 17:12:14,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2023-11-22 17:12:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:12:14,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:12:14,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:12:14,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308691088] [2023-11-22 17:12:14,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308691088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:12:14,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:12:14,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 17:12:14,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286242321] [2023-11-22 17:12:14,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:12:14,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 17:12:14,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:12:14,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 17:12:14,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 17:12:14,453 INFO L87 Difference]: Start difference. First operand 335 states and 464 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:12:15,657 INFO L93 Difference]: Finished difference Result 342 states and 471 transitions. [2023-11-22 17:12:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 17:12:15,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2023-11-22 17:12:15,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:12:15,659 INFO L225 Difference]: With dead ends: 342 [2023-11-22 17:12:15,660 INFO L226 Difference]: Without dead ends: 342 [2023-11-22 17:12:15,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-22 17:12:15,660 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 13 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:12:15,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 756 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-22 17:12:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-22 17:12:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2023-11-22 17:12:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 260 states have (on average 1.7884615384615385) internal successors, (465), 335 states have internal predecessors, (465), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:12:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 471 transitions. [2023-11-22 17:12:15,667 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 471 transitions. Word has length 41 [2023-11-22 17:12:15,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:12:15,668 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 471 transitions. [2023-11-22 17:12:15,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 471 transitions. [2023-11-22 17:12:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-22 17:12:15,669 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:12:15,669 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:12:15,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-11-22 17:12:15,879 WARN L477 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 [2023-11-22 17:12:15,879 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:12:15,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:12:15,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1299262632, now seen corresponding path program 1 times [2023-11-22 17:12:15,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:12:15,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477829338] [2023-11-22 17:12:15,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:12:15,880 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 [2023-11-22 17:12:15,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:12:15,881 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) [2023-11-22 17:12:15,883 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 [2023-11-22 17:12:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:12:16,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-22 17:12:16,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:16,396 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 [2023-11-22 17:12:16,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-11-22 17:12:16,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-22 17:12:16,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2023-11-22 17:12:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:12:16,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:12:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:12:17,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:12:17,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477829338] [2023-11-22 17:12:17,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477829338] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:12:17,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:12:17,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-11-22 17:12:17,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130105856] [2023-11-22 17:12:17,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:12:17,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-22 17:12:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:12:17,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-22 17:12:17,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-22 17:12:17,674 INFO L87 Difference]: Start difference. First operand 341 states and 471 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:12:22,439 INFO L93 Difference]: Finished difference Result 350 states and 478 transitions. [2023-11-22 17:12:22,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 17:12:22,441 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2023-11-22 17:12:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:12:22,442 INFO L225 Difference]: With dead ends: 350 [2023-11-22 17:12:22,442 INFO L226 Difference]: Without dead ends: 350 [2023-11-22 17:12:22,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-11-22 17:12:22,442 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 31 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:12:22,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1170 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-22 17:12:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-11-22 17:12:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2023-11-22 17:12:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 268 states have (on average 1.7611940298507462) internal successors, (472), 342 states have internal predecessors, (472), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:12:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 478 transitions. [2023-11-22 17:12:22,450 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 478 transitions. Word has length 44 [2023-11-22 17:12:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:12:22,451 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 478 transitions. [2023-11-22 17:12:22,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 478 transitions. [2023-11-22 17:12:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-22 17:12:22,452 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:12:22,452 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:12:22,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-11-22 17:12:22,663 WARN L477 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 [2023-11-22 17:12:22,663 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:12:22,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:12:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash 646836841, now seen corresponding path program 1 times [2023-11-22 17:12:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:12:22,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104374882] [2023-11-22 17:12:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:12:22,665 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 [2023-11-22 17:12:22,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:12:22,665 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) [2023-11-22 17:12:22,668 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 [2023-11-22 17:12:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:12:23,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 17:12:23,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:12:23,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:12:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:12:23,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:12:23,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104374882] [2023-11-22 17:12:23,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104374882] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:12:23,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:12:23,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-22 17:12:23,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836924512] [2023-11-22 17:12:23,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:12:23,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 17:12:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:12:23,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 17:12:23,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-22 17:12:23,240 INFO L87 Difference]: Start difference. First operand 348 states and 478 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:12:23,816 INFO L93 Difference]: Finished difference Result 385 states and 513 transitions. [2023-11-22 17:12:23,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 17:12:23,817 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2023-11-22 17:12:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:12:23,818 INFO L225 Difference]: With dead ends: 385 [2023-11-22 17:12:23,818 INFO L226 Difference]: Without dead ends: 385 [2023-11-22 17:12:23,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-22 17:12:23,819 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 35 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 17:12:23,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1020 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 17:12:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-11-22 17:12:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 378. [2023-11-22 17:12:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 298 states have (on average 1.7013422818791946) internal successors, (507), 372 states have internal predecessors, (507), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:12:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 513 transitions. [2023-11-22 17:12:23,826 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 513 transitions. Word has length 51 [2023-11-22 17:12:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:12:23,826 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 513 transitions. [2023-11-22 17:12:23,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 513 transitions. [2023-11-22 17:12:23,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-22 17:12:23,827 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:12:23,827 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:12:23,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-22 17:12:24,037 WARN L477 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 [2023-11-22 17:12:24,037 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:12:24,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:12:24,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1695530166, now seen corresponding path program 2 times [2023-11-22 17:12:24,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:12:24,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736229464] [2023-11-22 17:12:24,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 17:12:24,038 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 [2023-11-22 17:12:24,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:12:24,039 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) [2023-11-22 17:12:24,045 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 [2023-11-22 17:12:24,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 17:12:24,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 17:12:24,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-22 17:12:24,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 2 proven. 92 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:12:25,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:12:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 2 proven. 92 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-22 17:12:25,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:12:25,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736229464] [2023-11-22 17:12:25,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736229464] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:12:25,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:12:25,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-22 17:12:25,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091232540] [2023-11-22 17:12:25,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:12:25,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-22 17:12:25,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:12:25,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-22 17:12:25,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-22 17:12:25,268 INFO L87 Difference]: Start difference. First operand 378 states and 513 transitions. Second operand has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:12:26,271 INFO L93 Difference]: Finished difference Result 399 states and 527 transitions. [2023-11-22 17:12:26,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 17:12:26,272 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2023-11-22 17:12:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:12:26,273 INFO L225 Difference]: With dead ends: 399 [2023-11-22 17:12:26,273 INFO L226 Difference]: Without dead ends: 399 [2023-11-22 17:12:26,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-22 17:12:26,274 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 44 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:12:26,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 2284 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-22 17:12:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-11-22 17:12:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 390. [2023-11-22 17:12:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 310 states have (on average 1.6806451612903226) internal successors, (521), 384 states have internal predecessors, (521), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:12:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 527 transitions. [2023-11-22 17:12:26,281 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 527 transitions. Word has length 66 [2023-11-22 17:12:26,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:12:26,282 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 527 transitions. [2023-11-22 17:12:26,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:26,282 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 527 transitions. [2023-11-22 17:12:26,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-22 17:12:26,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:12:26,283 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:12:26,301 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 [2023-11-22 17:12:26,501 WARN L477 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 [2023-11-22 17:12:26,502 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:12:26,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:12:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1720551466, now seen corresponding path program 3 times [2023-11-22 17:12:26,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:12:26,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213345259] [2023-11-22 17:12:26,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 17:12:26,503 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 [2023-11-22 17:12:26,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:12:26,505 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) [2023-11-22 17:12:26,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-22 17:12:27,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-22 17:12:27,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 17:12:27,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-22 17:12:27,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:27,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:12:27,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-22 17:12:27,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-22 17:12:27,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:12:27,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-22 17:12:27,383 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 17:12:27,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-22 17:12:28,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:12:28,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-22 17:12:28,295 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 17:12:28,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-22 17:12:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:12:28,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:12:30,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 17:12:30,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 82 [2023-11-22 17:12:31,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 17:12:31,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 76 [2023-11-22 17:12:31,478 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 17:12:31,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-22 17:12:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:12:31,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:12:31,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213345259] [2023-11-22 17:12:31,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213345259] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:12:31,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:12:31,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-22 17:12:31,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702466185] [2023-11-22 17:12:31,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:12:31,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-22 17:12:31,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:12:31,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-22 17:12:31,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-11-22 17:12:31,681 INFO L87 Difference]: Start difference. First operand 390 states and 527 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:12:38,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:12:38,140 INFO L93 Difference]: Finished difference Result 600 states and 760 transitions. [2023-11-22 17:12:38,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 17:12:38,142 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2023-11-22 17:12:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:12:38,145 INFO L225 Difference]: With dead ends: 600 [2023-11-22 17:12:38,145 INFO L226 Difference]: Without dead ends: 600 [2023-11-22 17:12:38,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2023-11-22 17:12:38,146 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 693 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:12:38,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1260 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2023-11-22 17:12:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2023-11-22 17:12:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 425. [2023-11-22 17:12:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 348 states have (on average 1.5804597701149425) internal successors, (550), 419 states have internal predecessors, (550), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:12:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 556 transitions. [2023-11-22 17:12:38,156 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 556 transitions. Word has length 72 [2023-11-22 17:12:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:12:38,157 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 556 transitions. [2023-11-22 17:12:38,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:12:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 556 transitions. [2023-11-22 17:12:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-22 17:12:38,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:12:38,158 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:12:38,171 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 [2023-11-22 17:12:38,368 WARN L477 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 [2023-11-22 17:12:38,369 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:12:38,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:12:38,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1797488385, now seen corresponding path program 1 times [2023-11-22 17:12:38,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:12:38,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391649575] [2023-11-22 17:12:38,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:12:38,370 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 [2023-11-22 17:12:38,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:12:38,371 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) [2023-11-22 17:12:38,372 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 [2023-11-22 17:12:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:12:39,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 17:12:39,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:12:39,295 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:12:39,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:12:39,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391649575] [2023-11-22 17:12:39,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391649575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:12:39,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:12:39,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 17:12:39,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579127042] [2023-11-22 17:12:39,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:12:39,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:12:39,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:12:39,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:12:39,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:12:39,297 INFO L87 Difference]: Start difference. First operand 425 states and 556 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:12:39,692 INFO L93 Difference]: Finished difference Result 429 states and 554 transitions. [2023-11-22 17:12:39,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:12:39,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2023-11-22 17:12:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:12:39,695 INFO L225 Difference]: With dead ends: 429 [2023-11-22 17:12:39,695 INFO L226 Difference]: Without dead ends: 429 [2023-11-22 17:12:39,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 17:12:39,696 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 324 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 17:12:39,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 194 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 17:12:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-11-22 17:12:39,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 418. [2023-11-22 17:12:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 348 states have (on average 1.5402298850574712) internal successors, (536), 412 states have internal predecessors, (536), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:12:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 542 transitions. [2023-11-22 17:12:39,703 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 542 transitions. Word has length 73 [2023-11-22 17:12:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:12:39,703 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 542 transitions. [2023-11-22 17:12:39,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:12:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 542 transitions. [2023-11-22 17:12:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-22 17:12:39,704 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:12:39,704 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:12:39,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-11-22 17:12:39,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:12:39,921 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:12:39,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:12:39,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1797488384, now seen corresponding path program 1 times [2023-11-22 17:12:39,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:12:39,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083422325] [2023-11-22 17:12:39,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:12:39,922 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 [2023-11-22 17:12:39,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:12:39,923 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:12:39,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-22 17:12:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:12:41,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-22 17:12:41,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:41,311 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-22 17:12:41,311 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 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-22 17:12:41,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:12:41,535 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-22 17:12:41,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2023-11-22 17:12:41,554 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 17:12:41,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-22 17:12:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:12:42,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:12:44,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 17:12:44,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 95 [2023-11-22 17:12:44,929 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 17:12:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:12:45,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:12:45,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083422325] [2023-11-22 17:12:45,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083422325] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:12:45,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:12:45,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-11-22 17:12:45,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368076678] [2023-11-22 17:12:45,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:12:45,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-22 17:12:45,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:12:45,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-22 17:12:45,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-11-22 17:12:45,208 INFO L87 Difference]: Start difference. First operand 418 states and 542 transitions. Second operand has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:12:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:12:57,900 INFO L93 Difference]: Finished difference Result 657 states and 756 transitions. [2023-11-22 17:12:57,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-22 17:12:57,902 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2023-11-22 17:12:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:12:57,904 INFO L225 Difference]: With dead ends: 657 [2023-11-22 17:12:57,904 INFO L226 Difference]: Without dead ends: 657 [2023-11-22 17:12:57,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2023-11-22 17:12:57,905 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 1549 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2023-11-22 17:12:57,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 1983 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2023-11-22 17:12:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2023-11-22 17:12:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 416. [2023-11-22 17:12:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 348 states have (on average 1.5258620689655173) internal successors, (531), 410 states have internal predecessors, (531), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:12:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 537 transitions. [2023-11-22 17:12:57,913 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 537 transitions. Word has length 73 [2023-11-22 17:12:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:12:57,913 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 537 transitions. [2023-11-22 17:12:57,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 18 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:12:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 537 transitions. [2023-11-22 17:12:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-22 17:12:57,914 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:12:57,914 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:12:57,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-11-22 17:12:58,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:12:58,129 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:12:58,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:12:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash 112863207, now seen corresponding path program 1 times [2023-11-22 17:12:58,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:12:58,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047090442] [2023-11-22 17:12:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:12:58,131 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 [2023-11-22 17:12:58,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:12:58,132 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:12:58,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-22 17:12:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:12:59,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-22 17:12:59,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:12:59,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-22 17:12:59,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 17:12:59,653 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 11 treesize of output 10 [2023-11-22 17:12:59,665 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 [2023-11-22 17:12:59,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:12:59,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-22 17:12:59,812 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 17:12:59,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-22 17:13:00,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:13:00,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-22 17:13:00,619 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 17:13:00,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-22 17:13:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:00,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:13:02,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 17:13:02,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 82 [2023-11-22 17:13:06,277 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 17:13:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:06,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:06,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047090442] [2023-11-22 17:13:06,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047090442] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:13:06,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:13:06,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-22 17:13:06,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946425508] [2023-11-22 17:13:06,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:13:06,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-22 17:13:06,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:06,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-22 17:13:06,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=221, Unknown=1, NotChecked=0, Total=272 [2023-11-22 17:13:06,571 INFO L87 Difference]: Start difference. First operand 416 states and 537 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:13:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:14,064 INFO L93 Difference]: Finished difference Result 428 states and 549 transitions. [2023-11-22 17:13:14,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 17:13:14,066 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2023-11-22 17:13:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:14,067 INFO L225 Difference]: With dead ends: 428 [2023-11-22 17:13:14,067 INFO L226 Difference]: Without dead ends: 428 [2023-11-22 17:13:14,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=96, Invalid=365, Unknown=1, NotChecked=0, Total=462 [2023-11-22 17:13:14,068 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 660 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:14,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1068 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-11-22 17:13:14,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-11-22 17:13:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 416. [2023-11-22 17:13:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 348 states have (on average 1.5229885057471264) internal successors, (530), 410 states have internal predecessors, (530), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:13:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 536 transitions. [2023-11-22 17:13:14,074 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 536 transitions. Word has length 74 [2023-11-22 17:13:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:14,074 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 536 transitions. [2023-11-22 17:13:14,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:13:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 536 transitions. [2023-11-22 17:13:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-22 17:13:14,075 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:14,075 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:14,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-11-22 17:13:14,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:14,292 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:14,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:14,293 INFO L85 PathProgramCache]: Analyzing trace with hash 675952892, now seen corresponding path program 1 times [2023-11-22 17:13:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:14,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208263268] [2023-11-22 17:13:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:14,294 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 [2023-11-22 17:13:14,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:14,295 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:13:14,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-22 17:13:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:15,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-22 17:13:15,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:15,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:13:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:15,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:15,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208263268] [2023-11-22 17:13:15,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208263268] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:13:15,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:13:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2023-11-22 17:13:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990371999] [2023-11-22 17:13:15,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:13:15,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-22 17:13:15,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:15,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-22 17:13:15,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-22 17:13:15,643 INFO L87 Difference]: Start difference. First operand 416 states and 536 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:13:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:16,463 INFO L93 Difference]: Finished difference Result 506 states and 637 transitions. [2023-11-22 17:13:16,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 17:13:16,464 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2023-11-22 17:13:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:16,466 INFO L225 Difference]: With dead ends: 506 [2023-11-22 17:13:16,466 INFO L226 Difference]: Without dead ends: 506 [2023-11-22 17:13:16,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2023-11-22 17:13:16,467 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 507 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:16,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1326 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-22 17:13:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2023-11-22 17:13:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 445. [2023-11-22 17:13:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 377 states have (on average 1.5490716180371353) internal successors, (584), 439 states have internal predecessors, (584), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:13:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 590 transitions. [2023-11-22 17:13:16,474 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 590 transitions. Word has length 76 [2023-11-22 17:13:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:16,474 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 590 transitions. [2023-11-22 17:13:16,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:13:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 590 transitions. [2023-11-22 17:13:16,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-22 17:13:16,475 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:16,475 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:16,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-11-22 17:13:16,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:16,689 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:16,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:16,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1050807010, now seen corresponding path program 1 times [2023-11-22 17:13:16,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:16,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721786418] [2023-11-22 17:13:16,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:16,691 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 [2023-11-22 17:13:16,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:16,692 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:13:16,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-22 17:13:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:17,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 17:13:17,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:17,746 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:13:18,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-11-22 17:13:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:18,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:18,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721786418] [2023-11-22 17:13:18,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721786418] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:13:18,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:13:18,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-11-22 17:13:18,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974271849] [2023-11-22 17:13:18,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:13:18,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 17:13:18,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:18,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 17:13:18,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-22 17:13:18,682 INFO L87 Difference]: Start difference. First operand 445 states and 590 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:19,896 INFO L93 Difference]: Finished difference Result 453 states and 598 transitions. [2023-11-22 17:13:19,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 17:13:19,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2023-11-22 17:13:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:19,898 INFO L225 Difference]: With dead ends: 453 [2023-11-22 17:13:19,898 INFO L226 Difference]: Without dead ends: 453 [2023-11-22 17:13:19,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-11-22 17:13:19,899 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 816 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:19,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 391 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 17:13:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2023-11-22 17:13:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 444. [2023-11-22 17:13:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 377 states have (on average 1.5384615384615385) internal successors, (580), 438 states have internal predecessors, (580), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 17:13:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 586 transitions. [2023-11-22 17:13:19,913 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 586 transitions. Word has length 78 [2023-11-22 17:13:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:19,914 INFO L495 AbstractCegarLoop]: Abstraction has 444 states and 586 transitions. [2023-11-22 17:13:19,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 586 transitions. [2023-11-22 17:13:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-22 17:13:19,915 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:19,915 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:19,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-11-22 17:13:20,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:20,129 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:20,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash -837479277, now seen corresponding path program 1 times [2023-11-22 17:13:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:20,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659703044] [2023-11-22 17:13:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:20,131 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 [2023-11-22 17:13:20,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:20,131 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:13:20,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-22 17:13:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:21,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-22 17:13:21,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:21,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-22 17:13:21,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-22 17:13:21,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:13:21,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-22 17:13:21,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:13:21,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-11-22 17:13:22,904 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 17:13:22,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-22 17:13:22,908 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 17:13:22,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 17:13:22,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2023-11-22 17:13:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2023-11-22 17:13:22,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:13:23,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-11-22 17:13:23,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2023-11-22 17:13:23,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-11-22 17:13:23,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 128 [2023-11-22 17:13:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:24,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:24,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659703044] [2023-11-22 17:13:24,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659703044] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:13:24,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:13:24,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 26 [2023-11-22 17:13:24,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865843912] [2023-11-22 17:13:24,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:13:24,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-22 17:13:24,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:24,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-22 17:13:24,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2023-11-22 17:13:24,133 INFO L87 Difference]: Start difference. First operand 444 states and 586 transitions. Second operand has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:13:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:26,600 INFO L93 Difference]: Finished difference Result 454 states and 573 transitions. [2023-11-22 17:13:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-22 17:13:26,601 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 79 [2023-11-22 17:13:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:26,602 INFO L225 Difference]: With dead ends: 454 [2023-11-22 17:13:26,602 INFO L226 Difference]: Without dead ends: 454 [2023-11-22 17:13:26,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2023-11-22 17:13:26,603 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 380 mSDsluCounter, 2523 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 2692 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:26,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 2692 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-22 17:13:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2023-11-22 17:13:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 323. [2023-11-22 17:13:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.372093023255814) internal successors, (354), 318 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:13:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 358 transitions. [2023-11-22 17:13:26,608 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 358 transitions. Word has length 79 [2023-11-22 17:13:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:26,608 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 358 transitions. [2023-11-22 17:13:26,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:13:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 358 transitions. [2023-11-22 17:13:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-22 17:13:26,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:26,610 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:26,632 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 (28)] Ended with exit code 0 [2023-11-22 17:13:26,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:26,826 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:26,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:26,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1784720691, now seen corresponding path program 1 times [2023-11-22 17:13:26,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:26,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66474063] [2023-11-22 17:13:26,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:26,828 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 [2023-11-22 17:13:26,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:26,829 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:13:26,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-11-22 17:13:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:27,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-22 17:13:27,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:27,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-22 17:13:27,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-22 17:13:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:28,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:13:28,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-22 17:13:28,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2023-11-22 17:13:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:28,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:28,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66474063] [2023-11-22 17:13:28,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66474063] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:13:28,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:13:28,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2023-11-22 17:13:28,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410262385] [2023-11-22 17:13:28,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:13:28,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-22 17:13:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:28,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-22 17:13:28,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-11-22 17:13:28,347 INFO L87 Difference]: Start difference. First operand 323 states and 358 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:29,292 INFO L93 Difference]: Finished difference Result 364 states and 401 transitions. [2023-11-22 17:13:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 17:13:29,293 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2023-11-22 17:13:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:29,294 INFO L225 Difference]: With dead ends: 364 [2023-11-22 17:13:29,294 INFO L226 Difference]: Without dead ends: 364 [2023-11-22 17:13:29,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2023-11-22 17:13:29,294 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 353 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:29,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1369 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-22 17:13:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-11-22 17:13:29,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 327. [2023-11-22 17:13:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 322 states have internal predecessors, (359), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:13:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 363 transitions. [2023-11-22 17:13:29,298 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 363 transitions. Word has length 79 [2023-11-22 17:13:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:29,299 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 363 transitions. [2023-11-22 17:13:29,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 363 transitions. [2023-11-22 17:13:29,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-22 17:13:29,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:29,300 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:29,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-11-22 17:13:29,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:29,512 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:29,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:29,512 INFO L85 PathProgramCache]: Analyzing trace with hash 508188145, now seen corresponding path program 1 times [2023-11-22 17:13:29,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:29,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841531140] [2023-11-22 17:13:29,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:29,513 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 [2023-11-22 17:13:29,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:29,514 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 17:13:29,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-22 17:13:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:30,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 17:13:30,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-11-22 17:13:30,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:13:30,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:30,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841531140] [2023-11-22 17:13:30,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841531140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:13:30,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:13:30,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:13:30,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359783218] [2023-11-22 17:13:30,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:13:30,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:13:30,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:30,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:13:30,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:13:30,390 INFO L87 Difference]: Start difference. First operand 327 states and 363 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:30,614 INFO L93 Difference]: Finished difference Result 326 states and 361 transitions. [2023-11-22 17:13:30,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:13:30,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2023-11-22 17:13:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:30,616 INFO L225 Difference]: With dead ends: 326 [2023-11-22 17:13:30,616 INFO L226 Difference]: Without dead ends: 326 [2023-11-22 17:13:30,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:13:30,617 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 176 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:30,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 182 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 17:13:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-11-22 17:13:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2023-11-22 17:13:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 262 states have (on average 1.3625954198473282) internal successors, (357), 321 states have internal predecessors, (357), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:13:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 361 transitions. [2023-11-22 17:13:30,621 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 361 transitions. Word has length 80 [2023-11-22 17:13:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:30,621 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 361 transitions. [2023-11-22 17:13:30,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:30,621 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 361 transitions. [2023-11-22 17:13:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-22 17:13:30,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:30,622 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:30,634 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 (30)] Forceful destruction successful, exit code 0 [2023-11-22 17:13:30,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:30,833 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:30,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:30,834 INFO L85 PathProgramCache]: Analyzing trace with hash 508233889, now seen corresponding path program 1 times [2023-11-22 17:13:30,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:30,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629049720] [2023-11-22 17:13:30,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:30,835 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 [2023-11-22 17:13:30,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:30,835 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2023-11-22 17:13:30,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-11-22 17:13:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:31,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-22 17:13:31,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:31,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-22 17:13:31,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2023-11-22 17:13:31,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-22 17:13:32,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2023-11-22 17:13:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:32,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:13:32,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-11-22 17:13:32,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2023-11-22 17:13:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:32,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:32,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629049720] [2023-11-22 17:13:32,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629049720] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:13:32,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:13:32,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2023-11-22 17:13:32,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771602764] [2023-11-22 17:13:32,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:13:32,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-22 17:13:32,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:32,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-22 17:13:32,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-11-22 17:13:32,561 INFO L87 Difference]: Start difference. First operand 326 states and 361 transitions. Second operand has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:33,900 INFO L93 Difference]: Finished difference Result 361 states and 396 transitions. [2023-11-22 17:13:33,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 17:13:33,901 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2023-11-22 17:13:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:33,902 INFO L225 Difference]: With dead ends: 361 [2023-11-22 17:13:33,902 INFO L226 Difference]: Without dead ends: 361 [2023-11-22 17:13:33,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2023-11-22 17:13:33,903 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 357 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:33,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1308 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 17:13:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-11-22 17:13:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 327. [2023-11-22 17:13:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 263 states have (on average 1.361216730038023) internal successors, (358), 322 states have internal predecessors, (358), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:13:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 362 transitions. [2023-11-22 17:13:33,907 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 362 transitions. Word has length 80 [2023-11-22 17:13:33,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:33,908 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 362 transitions. [2023-11-22 17:13:33,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 362 transitions. [2023-11-22 17:13:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-22 17:13:33,909 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:33,909 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:33,925 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 (31)] Forceful destruction successful, exit code 0 [2023-11-22 17:13:34,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:34,123 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:34,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:34,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1424618161, now seen corresponding path program 1 times [2023-11-22 17:13:34,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:34,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588652219] [2023-11-22 17:13:34,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:34,124 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 [2023-11-22 17:13:34,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:34,125 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2023-11-22 17:13:34,128 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 (32)] Waiting until timeout for monitored process [2023-11-22 17:13:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:35,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-22 17:13:35,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:35,072 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 [2023-11-22 17:13:35,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-22 17:13:35,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-11-22 17:13:35,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2023-11-22 17:13:35,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2023-11-22 17:13:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:35,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:13:35,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-11-22 17:13:35,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2023-11-22 17:13:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:35,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:35,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588652219] [2023-11-22 17:13:35,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588652219] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:13:35,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:13:35,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-11-22 17:13:35,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034846645] [2023-11-22 17:13:35,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:13:35,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-22 17:13:35,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:35,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-22 17:13:35,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2023-11-22 17:13:35,859 INFO L87 Difference]: Start difference. First operand 327 states and 362 transitions. Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:37,346 INFO L93 Difference]: Finished difference Result 332 states and 367 transitions. [2023-11-22 17:13:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 17:13:37,347 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2023-11-22 17:13:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:37,348 INFO L225 Difference]: With dead ends: 332 [2023-11-22 17:13:37,348 INFO L226 Difference]: Without dead ends: 332 [2023-11-22 17:13:37,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-11-22 17:13:37,349 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 258 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:37,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1226 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-22 17:13:37,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-11-22 17:13:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2023-11-22 17:13:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 264 states have (on average 1.3598484848484849) internal successors, (359), 323 states have internal predecessors, (359), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:13:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 363 transitions. [2023-11-22 17:13:37,353 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 363 transitions. Word has length 81 [2023-11-22 17:13:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:37,353 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 363 transitions. [2023-11-22 17:13:37,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 363 transitions. [2023-11-22 17:13:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-22 17:13:37,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:37,354 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:37,368 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 (32)] Forceful destruction successful, exit code 0 [2023-11-22 17:13:37,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:37,568 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:37,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash -326217971, now seen corresponding path program 1 times [2023-11-22 17:13:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:37,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295576311] [2023-11-22 17:13:37,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:37,570 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 [2023-11-22 17:13:37,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:37,571 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2023-11-22 17:13:37,571 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 (33)] Waiting until timeout for monitored process [2023-11-22 17:13:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:38,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 17:13:38,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-11-22 17:13:38,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:13:38,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:38,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295576311] [2023-11-22 17:13:38,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295576311] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:13:38,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:13:38,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:13:38,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237269271] [2023-11-22 17:13:38,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:13:38,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:13:38,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:38,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:13:38,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:13:38,534 INFO L87 Difference]: Start difference. First operand 328 states and 363 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:38,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:38,760 INFO L93 Difference]: Finished difference Result 327 states and 362 transitions. [2023-11-22 17:13:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:13:38,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2023-11-22 17:13:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:38,762 INFO L225 Difference]: With dead ends: 327 [2023-11-22 17:13:38,762 INFO L226 Difference]: Without dead ends: 327 [2023-11-22 17:13:38,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:13:38,762 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 172 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:38,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 182 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 17:13:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-11-22 17:13:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2023-11-22 17:13:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 264 states have (on average 1.356060606060606) internal successors, (358), 322 states have internal predecessors, (358), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:13:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 362 transitions. [2023-11-22 17:13:38,767 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 362 transitions. Word has length 83 [2023-11-22 17:13:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:38,767 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 362 transitions. [2023-11-22 17:13:38,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 362 transitions. [2023-11-22 17:13:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-22 17:13:38,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:38,767 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:38,778 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 (33)] Forceful destruction successful, exit code 0 [2023-11-22 17:13:38,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:38,968 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:38,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1036583082, now seen corresponding path program 1 times [2023-11-22 17:13:38,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:38,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633960471] [2023-11-22 17:13:38,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:38,970 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 [2023-11-22 17:13:38,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:38,971 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2023-11-22 17:13:38,971 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 (34)] Waiting until timeout for monitored process [2023-11-22 17:13:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:39,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-22 17:13:39,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:40,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:13:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:40,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:40,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633960471] [2023-11-22 17:13:40,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633960471] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:13:40,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:13:40,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-11-22 17:13:40,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429181556] [2023-11-22 17:13:40,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:13:40,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-22 17:13:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:40,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-22 17:13:40,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-11-22 17:13:40,419 INFO L87 Difference]: Start difference. First operand 327 states and 362 transitions. Second operand has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:13:41,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:41,285 INFO L93 Difference]: Finished difference Result 345 states and 378 transitions. [2023-11-22 17:13:41,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 17:13:41,291 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2023-11-22 17:13:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:41,292 INFO L225 Difference]: With dead ends: 345 [2023-11-22 17:13:41,292 INFO L226 Difference]: Without dead ends: 345 [2023-11-22 17:13:41,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-11-22 17:13:41,293 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 277 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:41,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1431 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-22 17:13:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-11-22 17:13:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 328. [2023-11-22 17:13:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 265 states have (on average 1.350943396226415) internal successors, (358), 323 states have internal predecessors, (358), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:13:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 362 transitions. [2023-11-22 17:13:41,297 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 362 transitions. Word has length 83 [2023-11-22 17:13:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:41,297 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 362 transitions. [2023-11-22 17:13:41,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.266666666666667) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:13:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 362 transitions. [2023-11-22 17:13:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-22 17:13:41,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:41,298 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:41,316 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 (34)] Forceful destruction successful, exit code 0 [2023-11-22 17:13:41,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:41,509 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:41,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:41,510 INFO L85 PathProgramCache]: Analyzing trace with hash 30716834, now seen corresponding path program 1 times [2023-11-22 17:13:41,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:41,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750969782] [2023-11-22 17:13:41,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:41,510 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 [2023-11-22 17:13:41,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:41,511 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2023-11-22 17:13:41,512 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 (35)] Waiting until timeout for monitored process [2023-11-22 17:13:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:42,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-22 17:13:42,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:42,874 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 [2023-11-22 17:13:42,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 17:13:42,925 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-22 17:13:42,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-22 17:13:42,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-22 17:13:42,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 8 [2023-11-22 17:13:43,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-22 17:13:43,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 8 [2023-11-22 17:13:43,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-22 17:13:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:43,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:13:43,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-22 17:13:43,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2023-11-22 17:13:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:46,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:46,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750969782] [2023-11-22 17:13:46,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750969782] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:13:46,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:13:46,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-11-22 17:13:46,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839693914] [2023-11-22 17:13:46,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:13:46,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-22 17:13:46,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:46,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-22 17:13:46,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=267, Unknown=1, NotChecked=0, Total=342 [2023-11-22 17:13:46,550 INFO L87 Difference]: Start difference. First operand 328 states and 362 transitions. Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:49,481 INFO L93 Difference]: Finished difference Result 338 states and 372 transitions. [2023-11-22 17:13:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-22 17:13:49,482 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2023-11-22 17:13:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:49,483 INFO L225 Difference]: With dead ends: 338 [2023-11-22 17:13:49,483 INFO L226 Difference]: Without dead ends: 338 [2023-11-22 17:13:49,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=140, Invalid=509, Unknown=1, NotChecked=0, Total=650 [2023-11-22 17:13:49,484 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 461 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:49,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1181 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-22 17:13:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2023-11-22 17:13:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 328. [2023-11-22 17:13:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 265 states have (on average 1.350943396226415) internal successors, (358), 323 states have internal predecessors, (358), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:13:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 362 transitions. [2023-11-22 17:13:49,489 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 362 transitions. Word has length 86 [2023-11-22 17:13:49,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:49,489 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 362 transitions. [2023-11-22 17:13:49,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 362 transitions. [2023-11-22 17:13:49,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-22 17:13:49,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:49,490 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:49,511 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 (35)] Forceful destruction successful, exit code 0 [2023-11-22 17:13:49,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:49,700 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:49,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash 257642366, now seen corresponding path program 1 times [2023-11-22 17:13:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:49,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179212344] [2023-11-22 17:13:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:49,702 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 [2023-11-22 17:13:49,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:49,703 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2023-11-22 17:13:49,704 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 (36)] Waiting until timeout for monitored process [2023-11-22 17:13:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:51,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-22 17:13:51,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:51,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-22 17:13:51,215 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-22 17:13:51,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-22 17:13:51,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-22 17:13:51,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 8 [2023-11-22 17:13:51,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-22 17:13:51,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 8 [2023-11-22 17:13:51,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-22 17:13:51,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-22 17:13:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:51,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:13:52,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-22 17:13:52,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2023-11-22 17:13:52,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-11-22 17:13:52,721 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-22 17:13:52,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2023-11-22 17:13:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:52,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:52,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179212344] [2023-11-22 17:13:52,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179212344] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:13:52,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:13:52,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2023-11-22 17:13:52,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178950035] [2023-11-22 17:13:52,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:13:52,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-22 17:13:52,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:52,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-22 17:13:52,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2023-11-22 17:13:52,749 INFO L87 Difference]: Start difference. First operand 328 states and 362 transitions. Second operand has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:54,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:54,375 INFO L93 Difference]: Finished difference Result 344 states and 378 transitions. [2023-11-22 17:13:54,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 17:13:54,376 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2023-11-22 17:13:54,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:54,377 INFO L225 Difference]: With dead ends: 344 [2023-11-22 17:13:54,377 INFO L226 Difference]: Without dead ends: 344 [2023-11-22 17:13:54,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2023-11-22 17:13:54,378 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 1026 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:54,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1090 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-22 17:13:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-11-22 17:13:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 331. [2023-11-22 17:13:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 268 states have (on average 1.3470149253731343) internal successors, (361), 326 states have internal predecessors, (361), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:13:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 365 transitions. [2023-11-22 17:13:54,382 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 365 transitions. Word has length 89 [2023-11-22 17:13:54,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:54,383 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 365 transitions. [2023-11-22 17:13:54,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 365 transitions. [2023-11-22 17:13:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-22 17:13:54,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:54,384 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:54,402 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 (36)] Forceful destruction successful, exit code 0 [2023-11-22 17:13:54,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:54,592 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr90ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:54,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:54,593 INFO L85 PathProgramCache]: Analyzing trace with hash -603020762, now seen corresponding path program 1 times [2023-11-22 17:13:54,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:54,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335706245] [2023-11-22 17:13:54,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:54,593 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 [2023-11-22 17:13:54,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:54,595 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2023-11-22 17:13:54,596 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 (37)] Waiting until timeout for monitored process [2023-11-22 17:13:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:55,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 17:13:55,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2023-11-22 17:13:55,562 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:13:55,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:55,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335706245] [2023-11-22 17:13:55,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335706245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:13:55,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:13:55,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:13:55,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881369177] [2023-11-22 17:13:55,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:13:55,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 17:13:55,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:55,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 17:13:55,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:13:55,563 INFO L87 Difference]: Start difference. First operand 331 states and 365 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:55,689 INFO L93 Difference]: Finished difference Result 330 states and 364 transitions. [2023-11-22 17:13:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 17:13:55,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2023-11-22 17:13:55,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:55,690 INFO L225 Difference]: With dead ends: 330 [2023-11-22 17:13:55,690 INFO L226 Difference]: Without dead ends: 330 [2023-11-22 17:13:55,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 17:13:55,691 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 164 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 189 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.1s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:55,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 189 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 17:13:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-11-22 17:13:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2023-11-22 17:13:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 268 states have (on average 1.3432835820895523) internal successors, (360), 325 states have internal predecessors, (360), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:13:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 364 transitions. [2023-11-22 17:13:55,696 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 364 transitions. Word has length 90 [2023-11-22 17:13:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:55,696 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 364 transitions. [2023-11-22 17:13:55,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 364 transitions. [2023-11-22 17:13:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-22 17:13:55,697 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:55,697 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:55,716 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 (37)] Forceful destruction successful, exit code 0 [2023-11-22 17:13:55,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:55,911 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr91ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:55,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:55,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1513773952, now seen corresponding path program 1 times [2023-11-22 17:13:55,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:55,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926217044] [2023-11-22 17:13:55,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:55,913 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 [2023-11-22 17:13:55,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:55,914 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2023-11-22 17:13:55,914 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 (38)] Waiting until timeout for monitored process [2023-11-22 17:13:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:56,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 17:13:56,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2023-11-22 17:13:57,021 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 17:13:57,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:13:57,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926217044] [2023-11-22 17:13:57,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926217044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 17:13:57,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 17:13:57,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 17:13:57,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179092131] [2023-11-22 17:13:57,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 17:13:57,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 17:13:57,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:13:57,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 17:13:57,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:13:57,023 INFO L87 Difference]: Start difference. First operand 330 states and 364 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:57,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:13:57,184 INFO L93 Difference]: Finished difference Result 329 states and 363 transitions. [2023-11-22 17:13:57,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 17:13:57,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2023-11-22 17:13:57,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:13:57,186 INFO L225 Difference]: With dead ends: 329 [2023-11-22 17:13:57,186 INFO L226 Difference]: Without dead ends: 329 [2023-11-22 17:13:57,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 17:13:57,187 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 162 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 17:13:57,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 176 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 17:13:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-11-22 17:13:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2023-11-22 17:13:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 268 states have (on average 1.3395522388059702) internal successors, (359), 324 states have internal predecessors, (359), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:13:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 363 transitions. [2023-11-22 17:13:57,190 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 363 transitions. Word has length 91 [2023-11-22 17:13:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:13:57,190 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 363 transitions. [2023-11-22 17:13:57,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 17:13:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 363 transitions. [2023-11-22 17:13:57,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-22 17:13:57,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:13:57,191 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:13:57,203 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 (38)] Forceful destruction successful, exit code 0 [2023-11-22 17:13:57,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:13:57,396 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:13:57,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:13:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash 317648232, now seen corresponding path program 1 times [2023-11-22 17:13:57,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:13:57,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024895424] [2023-11-22 17:13:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:13:57,397 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 [2023-11-22 17:13:57,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:13:57,398 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2023-11-22 17:13:57,399 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 (39)] Waiting until timeout for monitored process [2023-11-22 17:13:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:13:58,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-22 17:13:58,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:13:58,898 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 [2023-11-22 17:13:58,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 17:13:59,000 INFO L349 Elim1Store]: treesize reduction 50, result has 24.2 percent of original size [2023-11-22 17:13:59,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 27 [2023-11-22 17:13:59,014 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 17:13:59,018 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-22 17:13:59,035 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-22 17:13:59,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 23 [2023-11-22 17:13:59,119 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-22 17:13:59,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-22 17:13:59,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-22 17:13:59,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 8 [2023-11-22 17:13:59,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-22 17:13:59,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 8 [2023-11-22 17:13:59,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-22 17:13:59,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-22 17:13:59,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2023-11-22 17:13:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:13:59,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:14:00,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-22 17:14:00,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2023-11-22 17:14:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:14:01,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:14:01,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024895424] [2023-11-22 17:14:01,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024895424] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 17:14:01,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 17:14:01,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2023-11-22 17:14:01,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067956710] [2023-11-22 17:14:01,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 17:14:01,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-22 17:14:01,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 17:14:01,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-22 17:14:01,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2023-11-22 17:14:01,429 INFO L87 Difference]: Start difference. First operand 329 states and 363 transitions. Second operand has 22 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 22 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:14:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 17:14:03,579 INFO L93 Difference]: Finished difference Result 348 states and 382 transitions. [2023-11-22 17:14:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 17:14:03,580 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 22 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2023-11-22 17:14:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 17:14:03,581 INFO L225 Difference]: With dead ends: 348 [2023-11-22 17:14:03,581 INFO L226 Difference]: Without dead ends: 348 [2023-11-22 17:14:03,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 157 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=537, Unknown=0, NotChecked=0, Total=756 [2023-11-22 17:14:03,582 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 255 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-22 17:14:03,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1219 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-22 17:14:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-11-22 17:14:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 332. [2023-11-22 17:14:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 271 states have (on average 1.3357933579335792) internal successors, (362), 327 states have internal predecessors, (362), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 17:14:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 366 transitions. [2023-11-22 17:14:03,587 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 366 transitions. Word has length 92 [2023-11-22 17:14:03,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 17:14:03,587 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 366 transitions. [2023-11-22 17:14:03,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 22 states have internal predecessors, (75), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 17:14:03,587 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 366 transitions. [2023-11-22 17:14:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-22 17:14:03,588 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 17:14:03,588 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 17:14:03,602 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 (39)] Ended with exit code 0 [2023-11-22 17:14:03,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 17:14:03,789 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr93ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2023-11-22 17:14:03,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 17:14:03,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1257161091, now seen corresponding path program 1 times [2023-11-22 17:14:03,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 17:14:03,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948107769] [2023-11-22 17:14:03,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:14:03,790 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 [2023-11-22 17:14:03,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 17:14:03,791 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2023-11-22 17:14:03,792 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 (40)] Waiting until timeout for monitored process [2023-11-22 17:14:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 17:14:06,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-22 17:14:06,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 17:14:06,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-11-22 17:14:06,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-22 17:14:07,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 274 [2023-11-22 17:14:08,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-22 17:14:15,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 274 [2023-11-22 17:14:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-11-22 17:14:48,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 17:14:51,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2023-11-22 17:14:51,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 118 [2023-11-22 17:15:52,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 17:15:52,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948107769] [2023-11-22 17:15:52,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948107769] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 17:15:52,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [82891292] [2023-11-22 17:15:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 17:15:52,236 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-22 17:15:52,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-11-22 17:15:52,238 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-22 17:15:52,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process Killed by 15