./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfb70cce6cd508003f6161c30aa2ac99ac8ddeb6209ddd86b65ca0c623c2fb1c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:11:03,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:11:03,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:11:03,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:11:03,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:11:03,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:11:03,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:11:03,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:11:03,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:11:03,858 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:11:03,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:11:03,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:11:03,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:11:03,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:11:03,862 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:11:03,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:11:03,863 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:11:03,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:11:03,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:11:03,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:11:03,864 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:11:03,865 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:11:03,865 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:11:03,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:11:03,869 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:11:03,870 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:11:03,870 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:11:03,870 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:11:03,870 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:11:03,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:11:03,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:11:03,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:11:03,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:11:03,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:11:03,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:11:03,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:11:03,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:11:03,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:11:03,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:11:03,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:11:03,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:11:03,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:11:03,875 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfb70cce6cd508003f6161c30aa2ac99ac8ddeb6209ddd86b65ca0c623c2fb1c [2024-10-14 19:11:04,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:11:04,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:11:04,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:11:04,196 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:11:04,197 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:11:04,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i [2024-10-14 19:11:05,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:11:05,978 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:11:05,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i [2024-10-14 19:11:05,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a751bc522/71ef68bc330043d2a45d2a08add16183/FLAG133b3d89f [2024-10-14 19:11:06,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a751bc522/71ef68bc330043d2a45d2a08add16183 [2024-10-14 19:11:06,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:11:06,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:11:06,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:11:06,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:11:06,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:11:06,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:11:06" (1/1) ... [2024-10-14 19:11:06,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e2be654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:06, skipping insertion in model container [2024-10-14 19:11:06,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:11:06" (1/1) ... [2024-10-14 19:11:06,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:11:06,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:11:06,790 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 19:11:06,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25d40ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:06, skipping insertion in model container [2024-10-14 19:11:06,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:11:06,792 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 19:11:06,794 INFO L158 Benchmark]: Toolchain (without parser) took 579.38ms. Allocated memory is still 148.9MB. Free memory was 117.3MB in the beginning and 98.3MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 19:11:06,794 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 148.9MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:11:06,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.24ms. Allocated memory is still 148.9MB. Free memory was 117.3MB in the beginning and 98.3MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 19:11:06,797 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 148.9MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.24ms. Allocated memory is still 148.9MB. Free memory was 117.3MB in the beginning and 98.3MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfb70cce6cd508003f6161c30aa2ac99ac8ddeb6209ddd86b65ca0c623c2fb1c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:11:08,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:11:08,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:11:08,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:11:08,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:11:08,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:11:08,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:11:08,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:11:08,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:11:08,991 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:11:08,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:11:08,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:11:08,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:11:08,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:11:08,995 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:11:08,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:11:08,996 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:11:08,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:11:08,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:11:08,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:11:09,001 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:11:09,001 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:11:09,002 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:11:09,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:11:09,002 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:11:09,002 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:11:09,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:11:09,003 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:11:09,003 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:11:09,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:11:09,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:11:09,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:11:09,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:11:09,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:11:09,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:11:09,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:11:09,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:11:09,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:11:09,008 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:11:09,008 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:11:09,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:11:09,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:11:09,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:11:09,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:11:09,009 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:11:09,010 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfb70cce6cd508003f6161c30aa2ac99ac8ddeb6209ddd86b65ca0c623c2fb1c [2024-10-14 19:11:09,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:11:09,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:11:09,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:11:09,403 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:11:09,403 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:11:09,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i [2024-10-14 19:11:11,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:11:11,338 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:11:11,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i [2024-10-14 19:11:11,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca021bac/d84ec9382162427aaca42b48cb8ecfc9/FLAGe7f662ad4 [2024-10-14 19:11:11,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca021bac/d84ec9382162427aaca42b48cb8ecfc9 [2024-10-14 19:11:11,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:11:11,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:11:11,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:11:11,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:11:11,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:11:11,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:11:11" (1/1) ... [2024-10-14 19:11:11,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a3c923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:11, skipping insertion in model container [2024-10-14 19:11:11,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:11:11" (1/1) ... [2024-10-14 19:11:11,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:11:11,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:11:12,000 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 19:11:12,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:11:12,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:11:12,114 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:11:12,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:11:12,271 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:11:12,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12 WrapperNode [2024-10-14 19:11:12,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:11:12,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:11:12,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:11:12,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:11:12,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12" (1/1) ... [2024-10-14 19:11:12,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12" (1/1) ... [2024-10-14 19:11:12,385 INFO L138 Inliner]: procedures = 179, calls = 231, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 807 [2024-10-14 19:11:12,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:11:12,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:11:12,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:11:12,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:11:12,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12" (1/1) ... [2024-10-14 19:11:12,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12" (1/1) ... [2024-10-14 19:11:12,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12" (1/1) ... [2024-10-14 19:11:12,504 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-10-14 19:11:12,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12" (1/1) ... [2024-10-14 19:11:12,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12" (1/1) ... [2024-10-14 19:11:12,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12" (1/1) ... [2024-10-14 19:11:12,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12" (1/1) ... [2024-10-14 19:11:12,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12" (1/1) ... [2024-10-14 19:11:12,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12" (1/1) ... [2024-10-14 19:11:12,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:11:12,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:11:12,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:11:12,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:11:12,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12" (1/1) ... [2024-10-14 19:11:12,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:11:12,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:11:12,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:11:12,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:11:12,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 19:11:12,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 19:11:12,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:11:12,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:11:12,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 19:11:12,663 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 19:11:12,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 19:11:12,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 19:11:12,664 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 19:11:12,664 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 19:11:12,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:11:12,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:11:12,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:11:12,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:11:12,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:11:12,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:11:12,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:11:12,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:11:12,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:11:12,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:11:12,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:11:12,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:11:12,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:11:12,871 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:11:12,873 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:11:12,878 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:11:12,924 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:11:15,940 INFO L? ?]: Removed 907 outVars from TransFormulas that were not future-live. [2024-10-14 19:11:15,941 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:11:16,120 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:11:16,124 INFO L314 CfgBuilder]: Removed 40 assume(true) statements. [2024-10-14 19:11:16,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:11:16 BoogieIcfgContainer [2024-10-14 19:11:16,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:11:16,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:11:16,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:11:16,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:11:16,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:11:11" (1/3) ... [2024-10-14 19:11:16,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf8fc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:11:16, skipping insertion in model container [2024-10-14 19:11:16,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:11:12" (2/3) ... [2024-10-14 19:11:16,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf8fc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:11:16, skipping insertion in model container [2024-10-14 19:11:16,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:11:16" (3/3) ... [2024-10-14 19:11:16,134 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test1-2.i [2024-10-14 19:11:16,152 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:11:16,153 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 425 error locations. [2024-10-14 19:11:16,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:11:16,237 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6ae9a5a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:11:16,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 425 error locations. [2024-10-14 19:11:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 776 states, 338 states have (on average 2.5236686390532546) internal successors, (853), 770 states have internal predecessors, (853), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:11:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 19:11:16,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:16,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 19:11:16,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:16,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash 42539724, now seen corresponding path program 1 times [2024-10-14 19:11:16,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:16,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607964514] [2024-10-14 19:11:16,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:16,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:16,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:16,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:16,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 19:11:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:16,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:11:16,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:16,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:11:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:16,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:11:16,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:16,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607964514] [2024-10-14 19:11:16,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607964514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:11:16,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:11:16,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:11:16,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514756424] [2024-10-14 19:11:16,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:11:16,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:11:16,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:16,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:11:16,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:11:16,515 INFO L87 Difference]: Start difference. First operand has 776 states, 338 states have (on average 2.5236686390532546) internal successors, (853), 770 states have internal predecessors, (853), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:18,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:18,232 INFO L93 Difference]: Finished difference Result 719 states and 777 transitions. [2024-10-14 19:11:18,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:11:18,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 19:11:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:18,259 INFO L225 Difference]: With dead ends: 719 [2024-10-14 19:11:18,260 INFO L226 Difference]: Without dead ends: 718 [2024-10-14 19:11:18,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:11:18,264 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 476 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:18,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 539 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 19:11:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-10-14 19:11:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 716. [2024-10-14 19:11:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 333 states have (on average 2.2432432432432434) internal successors, (747), 710 states have internal predecessors, (747), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:11:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 773 transitions. [2024-10-14 19:11:18,345 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 773 transitions. Word has length 4 [2024-10-14 19:11:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:18,345 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 773 transitions. [2024-10-14 19:11:18,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 773 transitions. [2024-10-14 19:11:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 19:11:18,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:18,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 19:11:18,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 19:11:18,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:18,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:18,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:18,551 INFO L85 PathProgramCache]: Analyzing trace with hash 42539725, now seen corresponding path program 1 times [2024-10-14 19:11:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:18,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796514508] [2024-10-14 19:11:18,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:18,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:18,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:18,555 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:18,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 19:11:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:18,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:11:18,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:18,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:11:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:18,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:11:18,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:18,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796514508] [2024-10-14 19:11:18,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796514508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:11:18,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:11:18,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:11:18,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4054760] [2024-10-14 19:11:18,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:11:18,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:11:18,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:18,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:11:18,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:11:18,677 INFO L87 Difference]: Start difference. First operand 716 states and 773 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:20,217 INFO L93 Difference]: Finished difference Result 780 states and 841 transitions. [2024-10-14 19:11:20,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:11:20,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 19:11:20,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:20,222 INFO L225 Difference]: With dead ends: 780 [2024-10-14 19:11:20,223 INFO L226 Difference]: Without dead ends: 780 [2024-10-14 19:11:20,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:11:20,224 INFO L432 NwaCegarLoop]: 594 mSDtfsCounter, 234 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:20,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 858 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:11:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-10-14 19:11:20,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 733. [2024-10-14 19:11:20,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 360 states have (on average 2.225) internal successors, (801), 727 states have internal predecessors, (801), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:11:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 827 transitions. [2024-10-14 19:11:20,249 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 827 transitions. Word has length 4 [2024-10-14 19:11:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:20,250 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 827 transitions. [2024-10-14 19:11:20,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 827 transitions. [2024-10-14 19:11:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 19:11:20,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:20,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 19:11:20,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 19:11:20,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:20,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:20,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:20,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1319537956, now seen corresponding path program 1 times [2024-10-14 19:11:20,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:20,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911984309] [2024-10-14 19:11:20,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:20,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:20,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:20,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:20,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 19:11:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:20,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:11:20,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:20,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:11:20,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911984309] [2024-10-14 19:11:20,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911984309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:11:20,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:11:20,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:11:20,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727937472] [2024-10-14 19:11:20,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:11:20,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:11:20,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:20,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:11:20,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:11:20,593 INFO L87 Difference]: Start difference. First operand 733 states and 827 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:21,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:21,301 INFO L93 Difference]: Finished difference Result 1239 states and 1396 transitions. [2024-10-14 19:11:21,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:11:21,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 19:11:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:21,307 INFO L225 Difference]: With dead ends: 1239 [2024-10-14 19:11:21,307 INFO L226 Difference]: Without dead ends: 1239 [2024-10-14 19:11:21,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:11:21,309 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 498 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:21,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1530 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 19:11:21,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2024-10-14 19:11:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 734. [2024-10-14 19:11:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 361 states have (on average 2.221606648199446) internal successors, (802), 728 states have internal predecessors, (802), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:11:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 828 transitions. [2024-10-14 19:11:21,336 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 828 transitions. Word has length 5 [2024-10-14 19:11:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:21,336 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 828 transitions. [2024-10-14 19:11:21,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 828 transitions. [2024-10-14 19:11:21,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 19:11:21,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:21,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:21,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 19:11:21,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:21,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:21,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash -809934570, now seen corresponding path program 1 times [2024-10-14 19:11:21,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:21,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902089809] [2024-10-14 19:11:21,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:21,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:21,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:21,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:21,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 (5)] Waiting until timeout for monitored process [2024-10-14 19:11:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:21,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:11:21,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:21,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:11:21,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:21,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902089809] [2024-10-14 19:11:21,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902089809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:11:21,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:11:21,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:11:21,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145582148] [2024-10-14 19:11:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:11:21,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:11:21,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:21,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:11:21,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:11:21,685 INFO L87 Difference]: Start difference. First operand 734 states and 828 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:22,207 INFO L93 Difference]: Finished difference Result 695 states and 788 transitions. [2024-10-14 19:11:22,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:11:22,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 19:11:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:22,211 INFO L225 Difference]: With dead ends: 695 [2024-10-14 19:11:22,212 INFO L226 Difference]: Without dead ends: 695 [2024-10-14 19:11:22,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:11:22,213 INFO L432 NwaCegarLoop]: 633 mSDtfsCounter, 61 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:22,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1224 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:11:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-10-14 19:11:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2024-10-14 19:11:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 346 states have (on average 2.2023121387283235) internal successors, (762), 689 states have internal predecessors, (762), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:11:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 788 transitions. [2024-10-14 19:11:22,235 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 788 transitions. Word has length 10 [2024-10-14 19:11:22,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:22,236 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 788 transitions. [2024-10-14 19:11:22,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 788 transitions. [2024-10-14 19:11:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 19:11:22,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:22,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:22,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 19:11:22,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:22,437 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:22,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:22,438 INFO L85 PathProgramCache]: Analyzing trace with hash -958045072, now seen corresponding path program 1 times [2024-10-14 19:11:22,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:22,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438752220] [2024-10-14 19:11:22,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:22,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:22,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:22,442 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:22,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 19:11:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:22,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:11:22,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:22,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:11:22,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:22,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438752220] [2024-10-14 19:11:22,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438752220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:11:22,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:11:22,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:11:22,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002542174] [2024-10-14 19:11:22,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:11:22,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:11:22,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:22,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:11:22,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:11:22,587 INFO L87 Difference]: Start difference. First operand 695 states and 788 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:23,340 INFO L93 Difference]: Finished difference Result 680 states and 766 transitions. [2024-10-14 19:11:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:11:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-10-14 19:11:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:23,345 INFO L225 Difference]: With dead ends: 680 [2024-10-14 19:11:23,345 INFO L226 Difference]: Without dead ends: 680 [2024-10-14 19:11:23,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:11:23,346 INFO L432 NwaCegarLoop]: 602 mSDtfsCounter, 45 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:23,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1788 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 19:11:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-10-14 19:11:23,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2024-10-14 19:11:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 345 states have (on average 2.1449275362318843) internal successors, (740), 674 states have internal predecessors, (740), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:11:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 766 transitions. [2024-10-14 19:11:23,360 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 766 transitions. Word has length 12 [2024-10-14 19:11:23,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:23,361 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 766 transitions. [2024-10-14 19:11:23,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 766 transitions. [2024-10-14 19:11:23,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 19:11:23,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:23,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:23,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 19:11:23,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:23,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:23,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:23,564 INFO L85 PathProgramCache]: Analyzing trace with hash -136881698, now seen corresponding path program 1 times [2024-10-14 19:11:23,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:23,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116065694] [2024-10-14 19:11:23,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:23,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:23,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:23,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:23,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 19:11:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:23,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:11:23,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:23,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:11:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:23,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:11:23,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:23,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116065694] [2024-10-14 19:11:23,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116065694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:11:23,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:11:23,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:11:23,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607609426] [2024-10-14 19:11:23,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:11:23,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:11:23,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:23,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:11:23,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:11:23,801 INFO L87 Difference]: Start difference. First operand 680 states and 766 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:25,208 INFO L93 Difference]: Finished difference Result 680 states and 766 transitions. [2024-10-14 19:11:25,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:11:25,208 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), 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 26 [2024-10-14 19:11:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:25,211 INFO L225 Difference]: With dead ends: 680 [2024-10-14 19:11:25,211 INFO L226 Difference]: Without dead ends: 680 [2024-10-14 19:11:25,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:11:25,212 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 420 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:25,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 766 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:11:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-10-14 19:11:25,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 676. [2024-10-14 19:11:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 345 states have (on average 2.1333333333333333) internal successors, (736), 670 states have internal predecessors, (736), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:11:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 762 transitions. [2024-10-14 19:11:25,225 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 762 transitions. Word has length 26 [2024-10-14 19:11:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:25,225 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 762 transitions. [2024-10-14 19:11:25,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:25,225 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 762 transitions. [2024-10-14 19:11:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 19:11:25,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:25,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:25,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 19:11:25,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:25,427 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:25,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash -136881697, now seen corresponding path program 1 times [2024-10-14 19:11:25,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:25,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303370972] [2024-10-14 19:11:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:25,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:25,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:25,432 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:25,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 19:11:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:25,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:11:25,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:25,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:11:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:25,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:11:25,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:25,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303370972] [2024-10-14 19:11:25,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303370972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:11:25,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:11:25,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:11:25,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87854637] [2024-10-14 19:11:25,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:11:25,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:11:25,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:25,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:11:25,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:11:25,818 INFO L87 Difference]: Start difference. First operand 676 states and 762 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:27,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:27,800 INFO L93 Difference]: Finished difference Result 723 states and 776 transitions. [2024-10-14 19:11:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:11:27,802 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), 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 26 [2024-10-14 19:11:27,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:27,804 INFO L225 Difference]: With dead ends: 723 [2024-10-14 19:11:27,805 INFO L226 Difference]: Without dead ends: 723 [2024-10-14 19:11:27,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:11:27,806 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 174 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:27,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1121 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 19:11:27,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-10-14 19:11:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 672. [2024-10-14 19:11:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 345 states have (on average 2.121739130434783) internal successors, (732), 666 states have internal predecessors, (732), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:11:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 758 transitions. [2024-10-14 19:11:27,822 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 758 transitions. Word has length 26 [2024-10-14 19:11:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:27,822 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 758 transitions. [2024-10-14 19:11:27,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 758 transitions. [2024-10-14 19:11:27,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 19:11:27,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:27,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:27,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 19:11:28,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:28,026 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:28,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:28,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1015162024, now seen corresponding path program 1 times [2024-10-14 19:11:28,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:28,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136248261] [2024-10-14 19:11:28,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:28,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:28,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:28,028 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:28,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 19:11:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:28,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:11:28,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:28,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:11:28,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136248261] [2024-10-14 19:11:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136248261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:11:28,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:11:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:11:28,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456699082] [2024-10-14 19:11:28,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:11:28,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:11:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:28,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:11:28,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:11:28,270 INFO L87 Difference]: Start difference. First operand 672 states and 758 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:28,797 INFO L93 Difference]: Finished difference Result 666 states and 748 transitions. [2024-10-14 19:11:28,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:11:28,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-14 19:11:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:28,802 INFO L225 Difference]: With dead ends: 666 [2024-10-14 19:11:28,802 INFO L226 Difference]: Without dead ends: 666 [2024-10-14 19:11:28,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:11:28,803 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 15 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:28,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1771 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:11:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-14 19:11:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2024-10-14 19:11:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 339 states have (on average 2.129793510324484) internal successors, (722), 660 states have internal predecessors, (722), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:11:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 748 transitions. [2024-10-14 19:11:28,815 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 748 transitions. Word has length 42 [2024-10-14 19:11:28,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:28,815 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 748 transitions. [2024-10-14 19:11:28,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 748 transitions. [2024-10-14 19:11:28,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 19:11:28,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:28,817 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:28,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 19:11:29,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:29,018 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:29,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1813375687, now seen corresponding path program 1 times [2024-10-14 19:11:29,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:29,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77826485] [2024-10-14 19:11:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:29,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:29,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:29,020 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:29,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 19:11:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:29,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:11:29,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:29,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:11:29,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:29,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77826485] [2024-10-14 19:11:29,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77826485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:11:29,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:11:29,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:11:29,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153834301] [2024-10-14 19:11:29,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:11:29,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:11:29,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:29,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:11:29,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:11:29,448 INFO L87 Difference]: Start difference. First operand 666 states and 748 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:30,214 INFO L93 Difference]: Finished difference Result 863 states and 974 transitions. [2024-10-14 19:11:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:11:30,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2024-10-14 19:11:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:30,221 INFO L225 Difference]: With dead ends: 863 [2024-10-14 19:11:30,221 INFO L226 Difference]: Without dead ends: 863 [2024-10-14 19:11:30,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:11:30,223 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 161 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:30,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1211 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 19:11:30,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-10-14 19:11:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 709. [2024-10-14 19:11:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 382 states have (on average 2.0026178010471205) internal successors, (765), 703 states have internal predecessors, (765), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:11:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 791 transitions. [2024-10-14 19:11:30,241 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 791 transitions. Word has length 46 [2024-10-14 19:11:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:30,241 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 791 transitions. [2024-10-14 19:11:30,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 791 transitions. [2024-10-14 19:11:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 19:11:30,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:30,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:30,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 19:11:30,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:30,446 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:30,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash -283915162, now seen corresponding path program 1 times [2024-10-14 19:11:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:30,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387207745] [2024-10-14 19:11:30,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:30,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:30,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:30,452 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:30,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 19:11:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:30,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 19:11:30,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:30,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:11:30,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:11:31,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:11:31,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:11:31,306 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:11:31,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 19:11:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:31,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:11:31,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:31,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387207745] [2024-10-14 19:11:31,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387207745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:11:31,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:11:31,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:11:31,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947006423] [2024-10-14 19:11:31,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:11:31,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:11:31,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:31,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:11:31,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:11:31,333 INFO L87 Difference]: Start difference. First operand 709 states and 791 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:32,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:32,928 INFO L93 Difference]: Finished difference Result 671 states and 753 transitions. [2024-10-14 19:11:32,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:11:32,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-14 19:11:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:32,932 INFO L225 Difference]: With dead ends: 671 [2024-10-14 19:11:32,932 INFO L226 Difference]: Without dead ends: 671 [2024-10-14 19:11:32,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:11:32,933 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 331 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:32,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 543 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 19:11:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-10-14 19:11:32,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 644. [2024-10-14 19:11:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 355 states have (on average 1.8676056338028169) internal successors, (663), 638 states have internal predecessors, (663), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:11:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 689 transitions. [2024-10-14 19:11:32,947 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 689 transitions. Word has length 49 [2024-10-14 19:11:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:32,948 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 689 transitions. [2024-10-14 19:11:32,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 689 transitions. [2024-10-14 19:11:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 19:11:32,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:32,949 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:32,959 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 [2024-10-14 19:11:33,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:33,149 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:33,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:33,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1406514670, now seen corresponding path program 1 times [2024-10-14 19:11:33,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:33,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715988488] [2024-10-14 19:11:33,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:33,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:33,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:33,154 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:33,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 19:11:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:33,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:11:33,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:33,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:11:33,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:11:33,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 19:11:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:33,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:11:33,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:33,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715988488] [2024-10-14 19:11:33,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715988488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:11:33,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:11:33,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:11:33,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520878974] [2024-10-14 19:11:33,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:11:33,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:11:33,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:33,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:11:33,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:11:33,419 INFO L87 Difference]: Start difference. First operand 644 states and 689 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:34,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:34,895 INFO L93 Difference]: Finished difference Result 643 states and 688 transitions. [2024-10-14 19:11:34,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:11:34,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 19:11:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:34,899 INFO L225 Difference]: With dead ends: 643 [2024-10-14 19:11:34,899 INFO L226 Difference]: Without dead ends: 643 [2024-10-14 19:11:34,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:11:34,900 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 2 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:34,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1495 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:11:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-10-14 19:11:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2024-10-14 19:11:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 355 states have (on average 1.8647887323943662) internal successors, (662), 637 states have internal predecessors, (662), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:11:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 688 transitions. [2024-10-14 19:11:34,913 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 688 transitions. Word has length 53 [2024-10-14 19:11:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:34,913 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 688 transitions. [2024-10-14 19:11:34,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 688 transitions. [2024-10-14 19:11:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 19:11:34,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:34,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:34,923 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 (12)] Ended with exit code 0 [2024-10-14 19:11:35,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:35,116 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:35,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:35,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1406514669, now seen corresponding path program 1 times [2024-10-14 19:11:35,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:35,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225899078] [2024-10-14 19:11:35,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:35,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:35,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:35,118 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:35,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 19:11:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:35,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 19:11:35,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:35,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:11:35,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:11:35,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 19:11:35,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 19:11:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:35,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:11:35,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:35,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225899078] [2024-10-14 19:11:35,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225899078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:11:35,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:11:35,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:11:35,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457942762] [2024-10-14 19:11:35,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:11:35,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:11:35,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:35,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:11:35,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:11:35,410 INFO L87 Difference]: Start difference. First operand 643 states and 688 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:37,215 INFO L93 Difference]: Finished difference Result 642 states and 687 transitions. [2024-10-14 19:11:37,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:11:37,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 19:11:37,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:37,220 INFO L225 Difference]: With dead ends: 642 [2024-10-14 19:11:37,220 INFO L226 Difference]: Without dead ends: 642 [2024-10-14 19:11:37,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:11:37,221 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 1 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:37,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1516 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:11:37,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-14 19:11:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2024-10-14 19:11:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 354 states have (on average 1.8672316384180792) internal successors, (661), 636 states have internal predecessors, (661), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 19:11:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 687 transitions. [2024-10-14 19:11:37,232 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 687 transitions. Word has length 53 [2024-10-14 19:11:37,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:37,232 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 687 transitions. [2024-10-14 19:11:37,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:11:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 687 transitions. [2024-10-14 19:11:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 19:11:37,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:37,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:37,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 19:11:37,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:37,434 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:37,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:37,435 INFO L85 PathProgramCache]: Analyzing trace with hash 821326710, now seen corresponding path program 1 times [2024-10-14 19:11:37,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:37,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050601576] [2024-10-14 19:11:37,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:37,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:37,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:37,437 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:37,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 19:11:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:37,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:11:37,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:37,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:11:37,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:37,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050601576] [2024-10-14 19:11:37,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050601576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:11:37,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:11:37,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:11:37,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607011052] [2024-10-14 19:11:37,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:11:37,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:11:37,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:37,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:11:37,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:11:37,677 INFO L87 Difference]: Start difference. First operand 642 states and 687 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 19:11:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:38,244 INFO L93 Difference]: Finished difference Result 644 states and 690 transitions. [2024-10-14 19:11:38,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:11:38,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 59 [2024-10-14 19:11:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:38,248 INFO L225 Difference]: With dead ends: 644 [2024-10-14 19:11:38,248 INFO L226 Difference]: Without dead ends: 644 [2024-10-14 19:11:38,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:11:38,249 INFO L432 NwaCegarLoop]: 570 mSDtfsCounter, 0 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:38,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1707 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:11:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-10-14 19:11:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2024-10-14 19:11:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 355 states have (on average 1.8676056338028169) internal successors, (663), 638 states have internal predecessors, (663), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:11:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 690 transitions. [2024-10-14 19:11:38,263 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 690 transitions. Word has length 59 [2024-10-14 19:11:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:38,263 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 690 transitions. [2024-10-14 19:11:38,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 19:11:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 690 transitions. [2024-10-14 19:11:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 19:11:38,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:38,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:38,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-14 19:11:38,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:38,465 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:38,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash 179200103, now seen corresponding path program 1 times [2024-10-14 19:11:38,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:38,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293744751] [2024-10-14 19:11:38,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:11:38,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:38,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:38,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) [2024-10-14 19:11:38,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 [2024-10-14 19:11:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:11:38,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:11:38,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:38,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:11:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:38,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:38,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293744751] [2024-10-14 19:11:38,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293744751] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:11:38,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:11:38,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 19:11:38,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195251772] [2024-10-14 19:11:38,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:11:38,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:11:38,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:38,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:11:38,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:11:38,821 INFO L87 Difference]: Start difference. First operand 644 states and 690 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:11:39,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:39,616 INFO L93 Difference]: Finished difference Result 653 states and 704 transitions. [2024-10-14 19:11:39,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:11:39,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2024-10-14 19:11:39,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:39,620 INFO L225 Difference]: With dead ends: 653 [2024-10-14 19:11:39,620 INFO L226 Difference]: Without dead ends: 653 [2024-10-14 19:11:39,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 19:11:39,621 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 5 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:39,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2271 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 19:11:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-10-14 19:11:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 652. [2024-10-14 19:11:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 362 states have (on average 1.867403314917127) internal successors, (676), 645 states have internal predecessors, (676), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:11:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 703 transitions. [2024-10-14 19:11:39,632 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 703 transitions. Word has length 60 [2024-10-14 19:11:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:39,633 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 703 transitions. [2024-10-14 19:11:39,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:11:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 703 transitions. [2024-10-14 19:11:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 19:11:39,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:39,638 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:39,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-14 19:11:39,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:39,843 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:39,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash -964646986, now seen corresponding path program 2 times [2024-10-14 19:11:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:39,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937658563] [2024-10-14 19:11:39,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:11:39,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:39,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:39,847 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:39,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 19:11:40,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:11:40,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:11:40,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:11:40,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:40,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:11:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:40,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:40,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937658563] [2024-10-14 19:11:40,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937658563] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:11:40,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:11:40,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 19:11:40,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437413115] [2024-10-14 19:11:40,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:11:40,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 19:11:40,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:40,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 19:11:40,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 19:11:40,407 INFO L87 Difference]: Start difference. First operand 652 states and 703 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:11:41,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:41,600 INFO L93 Difference]: Finished difference Result 664 states and 722 transitions. [2024-10-14 19:11:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 19:11:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2024-10-14 19:11:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:41,605 INFO L225 Difference]: With dead ends: 664 [2024-10-14 19:11:41,605 INFO L226 Difference]: Without dead ends: 662 [2024-10-14 19:11:41,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 19:11:41,608 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 8 mSDsluCounter, 3407 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3976 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:41,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3976 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 19:11:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-10-14 19:11:41,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 661. [2024-10-14 19:11:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 371 states have (on average 1.8544474393530996) internal successors, (688), 654 states have internal predecessors, (688), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:11:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 715 transitions. [2024-10-14 19:11:41,622 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 715 transitions. Word has length 63 [2024-10-14 19:11:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:41,623 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 715 transitions. [2024-10-14 19:11:41,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:11:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 715 transitions. [2024-10-14 19:11:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 19:11:41,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:41,623 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:41,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-14 19:11:41,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:41,825 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:41,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:41,825 INFO L85 PathProgramCache]: Analyzing trace with hash 94779926, now seen corresponding path program 3 times [2024-10-14 19:11:41,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:41,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72764317] [2024-10-14 19:11:41,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:11:41,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:41,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:41,827 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:41,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 19:11:42,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 19:11:42,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:11:42,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 19:11:42,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:42,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:11:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:43,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:43,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72764317] [2024-10-14 19:11:43,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72764317] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:11:43,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:11:43,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 19:11:43,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887574616] [2024-10-14 19:11:43,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:11:43,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 19:11:43,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:43,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 19:11:43,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 19:11:43,006 INFO L87 Difference]: Start difference. First operand 661 states and 715 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:11:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:46,020 INFO L93 Difference]: Finished difference Result 682 states and 751 transitions. [2024-10-14 19:11:46,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 19:11:46,021 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-10-14 19:11:46,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:46,023 INFO L225 Difference]: With dead ends: 682 [2024-10-14 19:11:46,023 INFO L226 Difference]: Without dead ends: 679 [2024-10-14 19:11:46,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 19:11:46,024 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 14 mSDsluCounter, 6246 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6815 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:46,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6815 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 19:11:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-10-14 19:11:46,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2024-10-14 19:11:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 389 states have (on average 1.8277634961439588) internal successors, (711), 672 states have internal predecessors, (711), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:11:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 738 transitions. [2024-10-14 19:11:46,036 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 738 transitions. Word has length 69 [2024-10-14 19:11:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:46,037 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 738 transitions. [2024-10-14 19:11:46,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:11:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 738 transitions. [2024-10-14 19:11:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 19:11:46,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:46,038 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:46,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-14 19:11:46,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:46,239 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:46,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1817606442, now seen corresponding path program 4 times [2024-10-14 19:11:46,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:46,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474328647] [2024-10-14 19:11:46,240 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:11:46,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:46,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:46,241 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:46,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-14 19:11:46,614 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:11:46,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:11:46,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 19:11:46,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:46,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:11:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:11:48,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:11:48,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474328647] [2024-10-14 19:11:48,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474328647] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:11:48,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:11:48,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 19:11:48,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911404654] [2024-10-14 19:11:48,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:11:48,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 19:11:48,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:11:48,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 19:11:48,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 19:11:48,156 INFO L87 Difference]: Start difference. First operand 679 states and 738 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:11:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:11:55,666 INFO L93 Difference]: Finished difference Result 716 states and 807 transitions. [2024-10-14 19:11:55,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 19:11:55,668 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-10-14 19:11:55,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:11:55,670 INFO L225 Difference]: With dead ends: 716 [2024-10-14 19:11:55,670 INFO L226 Difference]: Without dead ends: 714 [2024-10-14 19:11:55,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 19:11:55,674 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 25 mSDsluCounter, 13064 mSDsCounter, 0 mSdLazyCounter, 3559 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 13633 SdHoareTripleChecker+Invalid, 3603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:11:55,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 13633 Invalid, 3603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3559 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-14 19:11:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-10-14 19:11:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 713. [2024-10-14 19:11:55,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 423 states have (on average 1.789598108747045) internal successors, (757), 706 states have internal predecessors, (757), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:11:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 784 transitions. [2024-10-14 19:11:55,685 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 784 transitions. Word has length 81 [2024-10-14 19:11:55,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:11:55,686 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 784 transitions. [2024-10-14 19:11:55,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:11:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 784 transitions. [2024-10-14 19:11:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 19:11:55,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:11:55,687 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:11:55,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-14 19:11:55,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:55,888 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 422 more)] === [2024-10-14 19:11:55,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:11:55,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1368904246, now seen corresponding path program 5 times [2024-10-14 19:11:55,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:11:55,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431790854] [2024-10-14 19:11:55,889 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:11:55,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:11:55,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:11:55,891 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:11:55,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-14 19:11:56,954 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:11:56,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:11:56,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-14 19:11:56,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:11:57,006 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-14 19:11:57,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-10-14 19:11:57,416 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-10-14 19:11:57,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-10-14 19:11:57,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:11:57,612 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 42 treesize of output 24 [2024-10-14 19:12:00,067 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 19:12:00,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-10-14 19:12:00,145 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 51 treesize of output 27 [2024-10-14 19:12:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-14 19:12:00,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:12:00,499 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1649 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1649) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-10-14 19:12:00,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:12:00,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431790854] [2024-10-14 19:12:00,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431790854] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:12:00,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1776543619] [2024-10-14 19:12:00,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:12:00,501 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 19:12:00,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 19:12:00,504 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 19:12:00,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-10-14 19:12:01,039 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:12:01,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:12:01,088 WARN L253 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 596 conjuncts are in the unsatisfiable core [2024-10-14 19:12:01,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:12:01,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:12:01,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:12:01,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2024-10-14 19:12:01,222 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 8 treesize of output 1 [2024-10-14 19:12:01,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 69 [2024-10-14 19:12:01,356 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 8 treesize of output 1 [2024-10-14 19:12:17,677 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 8 treesize of output 1 [2024-10-14 19:12:17,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 82341 treesize of output 82373