./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:00:15,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:00:15,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:00:15,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:00:15,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:00:15,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:00:15,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:00:15,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:00:15,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:00:15,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:00:15,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:00:15,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:00:15,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:00:15,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:00:15,837 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:00:15,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:00:15,837 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:00:15,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:00:15,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:00:15,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:00:15,838 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:00:15,839 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:00:15,839 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:00:15,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:00:15,840 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:00:15,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:00:15,840 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:00:15,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:00:15,841 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:00:15,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:00:15,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:00:15,842 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:00:15,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:00:15,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:00:15,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:00:15,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:00:15,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:00:15,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:00:15,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:00:15,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:00:15,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:00:15,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:00:15,846 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-clean/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-clean/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 -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2024-10-11 18:00:16,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:00:16,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:00:16,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:00:16,164 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:00:16,165 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:00:16,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-10-11 18:00:17,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:00:17,984 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:00:17,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-10-11 18:00:17,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/21c66e722/c41a61c2d7174385be7d1e5ed35a48a6/FLAG89e4539a1 [2024-10-11 18:00:18,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/21c66e722/c41a61c2d7174385be7d1e5ed35a48a6 [2024-10-11 18:00:18,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:00:18,040 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:00:18,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:00:18,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:00:18,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:00:18,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:00:18" (1/1) ... [2024-10-11 18:00:18,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2e1f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:18, skipping insertion in model container [2024-10-11 18:00:18,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:00:18" (1/1) ... [2024-10-11 18:00:18,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:00:18,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:00:18,494 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-11 18:00:18,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@254dfbd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:18, skipping insertion in model container [2024-10-11 18:00:18,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:00:18,496 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 18:00:18,498 INFO L158 Benchmark]: Toolchain (without parser) took 457.39ms. Allocated memory is still 140.5MB. Free memory was 112.2MB in the beginning and 98.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 18:00:18,498 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 140.5MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:00:18,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.29ms. Allocated memory is still 140.5MB. Free memory was 112.2MB in the beginning and 98.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 18:00:18,500 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.35ms. Allocated memory is still 140.5MB. Free memory is still 113.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.29ms. Allocated memory is still 140.5MB. Free memory was 112.2MB in the beginning and 98.8MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 555]: 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:00:20,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:00:20,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 18:00:20,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:00:20,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:00:20,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:00:20,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:00:20,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:00:20,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:00:20,942 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:00:20,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:00:20,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:00:20,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:00:20,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:00:20,944 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:00:20,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:00:20,945 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:00:20,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:00:20,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:00:20,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:00:20,946 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:00:20,949 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:00:20,950 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:00:20,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:00:20,950 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:00:20,951 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 18:00:20,951 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:00:20,951 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 18:00:20,951 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:00:20,952 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:00:20,952 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:00:20,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:00:20,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:00:20,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:00:20,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:00:20,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:00:20,954 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:00:20,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:00:20,955 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 18:00:20,955 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 18:00:20,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:00:20,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:00:20,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:00:20,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:00:20,956 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 18:00:20,956 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-clean/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-clean/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 -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2024-10-11 18:00:21,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:00:21,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:00:21,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:00:21,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:00:21,355 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:00:21,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-10-11 18:00:23,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:00:23,376 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:00:23,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-10-11 18:00:23,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bc5297f09/bd58562de7dd481f8ea9a243357237d9/FLAG0f0f65d0c [2024-10-11 18:00:23,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bc5297f09/bd58562de7dd481f8ea9a243357237d9 [2024-10-11 18:00:23,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:00:23,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:00:23,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:00:23,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:00:23,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:00:23,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:23,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669ea519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23, skipping insertion in model container [2024-10-11 18:00:23,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:23,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:00:23,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:00:23,829 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 18:00:23,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:00:23,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:00:23,877 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:00:23,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:00:23,967 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:00:23,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23 WrapperNode [2024-10-11 18:00:23,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:00:23,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:00:23,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:00:23,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:00:23,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:23,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:24,018 INFO L138 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2024-10-11 18:00:24,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:00:24,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:00:24,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:00:24,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:00:24,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:24,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:24,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:24,072 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 6, 2]. [2024-10-11 18:00:24,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:24,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:24,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:24,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:24,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:24,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:24,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:00:24,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:00:24,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:00:24,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:00:24,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23" (1/1) ... [2024-10-11 18:00:24,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:00:24,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:00:24,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:00:24,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:00:24,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:00:24,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:00:24,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:00:24,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:00:24,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 18:00:24,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 18:00:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:00:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:00:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:00:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:00:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 18:00:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 18:00:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 18:00:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:00:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:00:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:00:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 18:00:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 18:00:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 18:00:24,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:00:24,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:00:24,323 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:00:24,326 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:00:24,917 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-11 18:00:24,918 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:00:24,969 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:00:24,970 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 18:00:24,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:00:24 BoogieIcfgContainer [2024-10-11 18:00:24,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:00:24,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:00:24,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:00:24,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:00:24,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:00:23" (1/3) ... [2024-10-11 18:00:24,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24839ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:00:24, skipping insertion in model container [2024-10-11 18:00:24,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:00:23" (2/3) ... [2024-10-11 18:00:24,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24839ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:00:24, skipping insertion in model container [2024-10-11 18:00:24,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:00:24" (3/3) ... [2024-10-11 18:00:24,983 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2024-10-11 18:00:25,000 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:00:25,000 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-10-11 18:00:25,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:00:25,062 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;@1fdf1968, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:00:25,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-10-11 18:00:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 42 states have (on average 2.3333333333333335) internal successors, (98), 88 states have internal predecessors, (98), 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-11 18:00:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 18:00:25,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:25,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 18:00:25,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:25,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:25,079 INFO L85 PathProgramCache]: Analyzing trace with hash 187589, now seen corresponding path program 1 times [2024-10-11 18:00:25,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:25,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597475411] [2024-10-11 18:00:25,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:25,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:00:25,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:25,094 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:25,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:25,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:00:25,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:25,281 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-11 18:00:25,330 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:00:25,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-11 18:00:25,360 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-11 18:00:25,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:25,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:25,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597475411] [2024-10-11 18:00:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597475411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:25,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:25,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:00:25,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794643317] [2024-10-11 18:00:25,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:25,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:00:25,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:25,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:00:25,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:00:25,402 INFO L87 Difference]: Start difference. First operand has 89 states, 42 states have (on average 2.3333333333333335) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:25,722 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2024-10-11 18:00:25,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:00:25,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 18:00:25,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:25,733 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:00:25,734 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 18:00:25,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11 18:00:25,739 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 101 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:25,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 74 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:00:25,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 18:00:25,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2024-10-11 18:00:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 44 states have (on average 2.090909090909091) internal successors, (92), 84 states have internal predecessors, (92), 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-11 18:00:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2024-10-11 18:00:25,770 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 3 [2024-10-11 18:00:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:25,770 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2024-10-11 18:00:25,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2024-10-11 18:00:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 18:00:25,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:25,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 18:00:25,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:25,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:25,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:25,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:25,977 INFO L85 PathProgramCache]: Analyzing trace with hash 187590, now seen corresponding path program 1 times [2024-10-11 18:00:25,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:25,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295900287] [2024-10-11 18:00:25,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:25,977 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-11 18:00:25,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:25,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:25,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:26,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 18:00:26,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:26,078 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-11 18:00:26,089 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-11 18:00:26,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:00:26,151 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-11 18:00:26,164 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:00:26,165 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-11 18:00:26,192 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-11 18:00:26,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:26,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:26,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295900287] [2024-10-11 18:00:26,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295900287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:26,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:26,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:00:26,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151570675] [2024-10-11 18:00:26,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:26,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:00:26,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:26,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:00:26,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:00:26,197 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:26,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:26,583 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2024-10-11 18:00:26,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:00:26,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 18:00:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:26,585 INFO L225 Difference]: With dead ends: 128 [2024-10-11 18:00:26,585 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 18:00:26,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11 18:00:26,588 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 85 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:26,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 85 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:00:26,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 18:00:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 96. [2024-10-11 18:00:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 95 states have internal predecessors, (111), 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-11 18:00:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2024-10-11 18:00:26,608 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 3 [2024-10-11 18:00:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:26,608 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2024-10-11 18:00:26,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:26,609 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2024-10-11 18:00:26,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:00:26,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:26,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:00:26,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 18:00:26,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:26,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:26,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:26,811 INFO L85 PathProgramCache]: Analyzing trace with hash 5815239, now seen corresponding path program 1 times [2024-10-11 18:00:26,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:26,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97863016] [2024-10-11 18:00:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:26,812 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-11 18:00:26,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:26,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:26,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:26,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:00:26,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:26,884 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-11 18:00:26,893 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-11 18:00:26,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:26,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:26,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97863016] [2024-10-11 18:00:26,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97863016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:26,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:26,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:00:26,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813664984] [2024-10-11 18:00:26,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:26,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:00:26,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:26,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:00:26,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:00:26,896 INFO L87 Difference]: Start difference. First operand 96 states and 111 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-11 18:00:27,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:27,071 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2024-10-11 18:00:27,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:00:27,071 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-11 18:00:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:27,072 INFO L225 Difference]: With dead ends: 94 [2024-10-11 18:00:27,072 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 18:00:27,073 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-11 18:00:27,074 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 25 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:27,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 94 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:00:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 18:00:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 18:00:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 93 states have internal predecessors, (108), 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-11 18:00:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2024-10-11 18:00:27,085 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 4 [2024-10-11 18:00:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:27,085 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2024-10-11 18:00:27,086 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-11 18:00:27,086 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2024-10-11 18:00:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:00:27,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:27,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:00:27,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:27,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:27,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:27,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash 5815240, now seen corresponding path program 1 times [2024-10-11 18:00:27,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:27,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976252839] [2024-10-11 18:00:27,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:27,288 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-11 18:00:27,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:27,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:27,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:27,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:00:27,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:27,374 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-11 18:00:27,389 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-11 18:00:27,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:27,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:27,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976252839] [2024-10-11 18:00:27,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976252839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:27,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:27,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:00:27,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913967104] [2024-10-11 18:00:27,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:27,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:00:27,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:27,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:00:27,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:00:27,392 INFO L87 Difference]: Start difference. First operand 94 states and 108 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-11 18:00:27,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:27,560 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2024-10-11 18:00:27,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:00:27,561 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-11 18:00:27,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:27,562 INFO L225 Difference]: With dead ends: 101 [2024-10-11 18:00:27,562 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:00:27,563 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-11 18:00:27,563 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 13 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:27,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 111 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:00:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:00:27,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-10-11 18:00:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 96 states have internal predecessors, (112), 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-11 18:00:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2024-10-11 18:00:27,570 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 4 [2024-10-11 18:00:27,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:27,571 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-10-11 18:00:27,571 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-11 18:00:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2024-10-11 18:00:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:00:27,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:27,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:27,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:27,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:27,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:27,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:27,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1447699891, now seen corresponding path program 1 times [2024-10-11 18:00:27,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:27,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587289239] [2024-10-11 18:00:27,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:27,774 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-11 18:00:27,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:27,775 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:27,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:27,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:00:27,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:27,840 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-11 18:00:27,847 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-11 18:00:27,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:27,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:27,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587289239] [2024-10-11 18:00:27,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587289239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:27,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:27,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:00:27,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539815120] [2024-10-11 18:00:27,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:27,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:00:27,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:27,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:00:27,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:00:27,850 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:27,969 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2024-10-11 18:00:27,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:00:27,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 18:00:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:27,970 INFO L225 Difference]: With dead ends: 93 [2024-10-11 18:00:27,970 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:00:27,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11 18:00:27,971 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:27,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 96 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:00:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:00:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 18:00:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.7833333333333334) internal successors, (107), 92 states have internal predecessors, (107), 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-11 18:00:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-10-11 18:00:27,977 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 7 [2024-10-11 18:00:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:27,982 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-10-11 18:00:27,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-10-11 18:00:27,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:00:27,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:27,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:27,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:28,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:28,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:28,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:28,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1447699892, now seen corresponding path program 1 times [2024-10-11 18:00:28,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:28,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583695506] [2024-10-11 18:00:28,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:28,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:00:28,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:28,191 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:28,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:28,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:00:28,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:28,264 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-11 18:00:28,286 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-11 18:00:28,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:28,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:28,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583695506] [2024-10-11 18:00:28,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583695506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:28,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:28,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:00:28,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722771541] [2024-10-11 18:00:28,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:28,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:00:28,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:28,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:00:28,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:00:28,288 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:28,420 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2024-10-11 18:00:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:00:28,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 18:00:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:28,422 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:00:28,422 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:00:28,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11 18:00:28,424 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:28,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 108 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:00:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:00:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 18:00:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 60 states have (on average 1.75) internal successors, (105), 91 states have internal predecessors, (105), 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-11 18:00:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2024-10-11 18:00:28,433 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 7 [2024-10-11 18:00:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:28,433 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2024-10-11 18:00:28,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2024-10-11 18:00:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:00:28,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:28,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:28,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:28,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:28,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:28,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:28,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1447698996, now seen corresponding path program 1 times [2024-10-11 18:00:28,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:28,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695414447] [2024-10-11 18:00:28,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:28,636 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-11 18:00:28,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:28,637 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:28,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:28,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:00:28,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:28,713 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-11 18:00:28,725 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-11 18:00:28,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:00:28,768 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-11 18:00:28,785 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:00:28,785 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-11 18:00:28,798 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-11 18:00:28,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:28,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:28,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695414447] [2024-10-11 18:00:28,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695414447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:28,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:28,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:00:28,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105817859] [2024-10-11 18:00:28,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:28,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:00:28,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:28,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:00:28,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:00:28,800 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:28,964 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2024-10-11 18:00:28,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:00:28,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 18:00:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:28,969 INFO L225 Difference]: With dead ends: 89 [2024-10-11 18:00:28,969 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 18:00:28,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-11 18:00:28,970 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 22 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:28,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 98 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:00:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 18:00:28,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 18:00:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.7) internal successors, (102), 88 states have internal predecessors, (102), 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-11 18:00:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2024-10-11 18:00:28,974 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 7 [2024-10-11 18:00:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:28,975 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2024-10-11 18:00:28,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2024-10-11 18:00:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:00:28,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:28,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:28,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:29,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:29,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:29,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:29,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1656440158, now seen corresponding path program 1 times [2024-10-11 18:00:29,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:29,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834495673] [2024-10-11 18:00:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:29,178 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-11 18:00:29,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:29,179 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:29,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:29,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:00:29,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:29,267 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-11 18:00:29,291 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-11 18:00:29,309 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-11 18:00:29,318 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-11 18:00:29,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:29,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:29,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834495673] [2024-10-11 18:00:29,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834495673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:29,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:29,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:00:29,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249893045] [2024-10-11 18:00:29,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:29,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:00:29,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:29,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:00:29,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:00:29,320 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:29,574 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-10-11 18:00:29,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:00:29,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 18:00:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:29,575 INFO L225 Difference]: With dead ends: 96 [2024-10-11 18:00:29,575 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 18:00:29,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-11 18:00:29,576 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:29,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 183 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:00:29,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 18:00:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-10-11 18:00:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.6984126984126984) internal successors, (107), 91 states have internal predecessors, (107), 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-11 18:00:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2024-10-11 18:00:29,586 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 10 [2024-10-11 18:00:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:29,586 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2024-10-11 18:00:29,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2024-10-11 18:00:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:00:29,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:29,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:29,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:29,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:29,788 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:29,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:29,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1656440157, now seen corresponding path program 1 times [2024-10-11 18:00:29,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:29,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098482845] [2024-10-11 18:00:29,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:29,789 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-11 18:00:29,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:29,793 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:29,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:29,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 18:00:29,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:29,881 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-11 18:00:29,910 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-11 18:00:29,919 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-11 18:00:29,956 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-11 18:00:29,979 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-11 18:00:29,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:29,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098482845] [2024-10-11 18:00:29,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098482845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:29,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:29,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:00:29,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761525752] [2024-10-11 18:00:29,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:29,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:00:29,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:29,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:00:29,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:00:29,981 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:30,250 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2024-10-11 18:00:30,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:00:30,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 18:00:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:30,251 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:00:30,251 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:00:30,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-11 18:00:30,252 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:30,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:00:30,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:00:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 18:00:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.6666666666666667) internal successors, (105), 91 states have internal predecessors, (105), 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-11 18:00:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2024-10-11 18:00:30,256 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 10 [2024-10-11 18:00:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:30,256 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2024-10-11 18:00:30,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2024-10-11 18:00:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 18:00:30,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:30,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:30,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:30,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:30,457 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:30,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1581900469, now seen corresponding path program 1 times [2024-10-11 18:00:30,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:30,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315199802] [2024-10-11 18:00:30,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:30,458 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-11 18:00:30,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:30,461 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:30,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:30,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:00:30,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:30,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:00:30,638 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-11 18:00:30,657 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:00:30,658 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-11 18:00:30,703 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-11 18:00:30,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:30,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:30,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315199802] [2024-10-11 18:00:30,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315199802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:30,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:30,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:00:30,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697628434] [2024-10-11 18:00:30,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:30,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:00:30,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:30,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:00:30,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:00:30,704 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-11 18:00:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:30,808 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2024-10-11 18:00:30,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:00:30,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-11 18:00:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:30,809 INFO L225 Difference]: With dead ends: 91 [2024-10-11 18:00:30,809 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 18:00:30,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:00:30,810 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:30,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 90 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:00:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 18:00:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2024-10-11 18:00:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 87 states have internal predecessors, (101), 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-11 18:00:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2024-10-11 18:00:30,813 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 12 [2024-10-11 18:00:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:30,813 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2024-10-11 18:00:30,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-11 18:00:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2024-10-11 18:00:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:00:30,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:30,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:30,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:31,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:31,015 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:31,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:31,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1830401123, now seen corresponding path program 1 times [2024-10-11 18:00:31,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:31,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457075987] [2024-10-11 18:00:31,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:31,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:00:31,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:31,017 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:31,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:31,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:00:31,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:31,168 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 15 treesize of output 1 [2024-10-11 18:00:31,186 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 16 treesize of output 8 [2024-10-11 18:00:31,196 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-11 18:00:31,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:31,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:31,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457075987] [2024-10-11 18:00:31,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457075987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:31,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:31,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:00:31,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351921856] [2024-10-11 18:00:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:31,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:00:31,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:31,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:00:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:00:31,198 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:31,460 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2024-10-11 18:00:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:00:31,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 18:00:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:31,461 INFO L225 Difference]: With dead ends: 146 [2024-10-11 18:00:31,462 INFO L226 Difference]: Without dead ends: 146 [2024-10-11 18:00:31,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:00:31,463 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 76 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:31,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 216 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:00:31,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-11 18:00:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 88. [2024-10-11 18:00:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 87 states have internal predecessors, (100), 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-11 18:00:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2024-10-11 18:00:31,466 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 13 [2024-10-11 18:00:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:31,467 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2024-10-11 18:00:31,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:31,467 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2024-10-11 18:00:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:00:31,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:31,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:31,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:31,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:31,669 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:31,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:31,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1830401096, now seen corresponding path program 1 times [2024-10-11 18:00:31,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:31,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543812500] [2024-10-11 18:00:31,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:31,670 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-11 18:00:31,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:31,673 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:31,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:31,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:00:31,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:31,775 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-11 18:00:31,885 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 15 treesize of output 1 [2024-10-11 18:00:31,893 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 11 treesize of output 7 [2024-10-11 18:00:31,933 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 17 treesize of output 9 [2024-10-11 18:00:31,950 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-11 18:00:31,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:31,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:31,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543812500] [2024-10-11 18:00:31,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543812500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:31,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:31,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:00:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247876715] [2024-10-11 18:00:31,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:31,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:00:31,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:31,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:00:31,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:00:31,952 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:32,301 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2024-10-11 18:00:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:00:32,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 18:00:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:32,303 INFO L225 Difference]: With dead ends: 141 [2024-10-11 18:00:32,303 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 18:00:32,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:00:32,304 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 51 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:32,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 172 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:00:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 18:00:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 94. [2024-10-11 18:00:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 93 states have internal predecessors, (108), 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-11 18:00:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2024-10-11 18:00:32,308 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 13 [2024-10-11 18:00:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:32,309 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2024-10-11 18:00:32,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2024-10-11 18:00:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:00:32,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:32,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:32,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:32,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:32,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:32,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1830401095, now seen corresponding path program 1 times [2024-10-11 18:00:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:32,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994250735] [2024-10-11 18:00:32,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:32,512 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-11 18:00:32,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:32,514 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:32,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:32,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:00:32,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:32,618 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-11 18:00:32,712 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 15 treesize of output 1 [2024-10-11 18:00:32,734 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 19 treesize of output 11 [2024-10-11 18:00:32,745 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-11 18:00:32,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:32,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:32,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994250735] [2024-10-11 18:00:32,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994250735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:32,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:32,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:00:32,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675227588] [2024-10-11 18:00:32,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:32,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:00:32,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:32,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:00:32,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:00:32,747 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:33,136 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2024-10-11 18:00:33,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:00:33,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 18:00:33,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:33,137 INFO L225 Difference]: With dead ends: 149 [2024-10-11 18:00:33,137 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 18:00:33,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:00:33,137 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 65 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:33,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 151 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:00:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 18:00:33,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 94. [2024-10-11 18:00:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.606060606060606) internal successors, (106), 93 states have internal predecessors, (106), 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-11 18:00:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2024-10-11 18:00:33,141 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 13 [2024-10-11 18:00:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:33,141 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2024-10-11 18:00:33,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2024-10-11 18:00:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:00:33,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:33,142 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:33,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 18:00:33,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:33,346 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:33,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2125782198, now seen corresponding path program 1 times [2024-10-11 18:00:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:33,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309886623] [2024-10-11 18:00:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:33,347 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-11 18:00:33,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:33,348 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:33,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:33,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 18:00:33,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:33,474 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-11 18:00:33,505 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 18:00:33,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-11 18:00:33,543 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-11 18:00:33,633 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:00:33,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-11 18:00:33,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-10-11 18:00:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:00:33,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:00:33,750 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_267) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|)))))) is different from false [2024-10-11 18:00:33,763 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_267 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_267) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))))) is different from false [2024-10-11 18:00:33,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:33,802 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-10-11 18:00:33,810 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 44 treesize of output 32 [2024-10-11 18:00:33,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:00:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-11 18:00:37,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:37,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309886623] [2024-10-11 18:00:37,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309886623] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:00:37,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:00:37,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-10-11 18:00:37,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833858221] [2024-10-11 18:00:37,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:00:37,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:00:37,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:37,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:00:37,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=78, Unknown=3, NotChecked=38, Total=156 [2024-10-11 18:00:37,889 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:38,323 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2024-10-11 18:00:38,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:00:38,324 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 18:00:38,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:38,325 INFO L225 Difference]: With dead ends: 93 [2024-10-11 18:00:38,325 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:00:38,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=37, Invalid=78, Unknown=3, NotChecked=38, Total=156 [2024-10-11 18:00:38,326 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 7 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:38,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 340 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 87 Unchecked, 0.4s Time] [2024-10-11 18:00:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:00:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 18:00:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 92 states have internal predecessors, (105), 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-11 18:00:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2024-10-11 18:00:38,329 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 13 [2024-10-11 18:00:38,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:38,329 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2024-10-11 18:00:38,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2024-10-11 18:00:38,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:00:38,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:38,330 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:38,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:38,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:38,531 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:38,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2125782197, now seen corresponding path program 1 times [2024-10-11 18:00:38,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:38,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355949165] [2024-10-11 18:00:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:38,532 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-11 18:00:38,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:38,533 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:38,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:38,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 18:00:38,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:38,659 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-11 18:00:38,672 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-11 18:00:38,685 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:00:38,685 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-11 18:00:38,733 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-11 18:00:38,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 18:00:38,841 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:00:38,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:00:38,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:00:38,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-11 18:00:38,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:00:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:38,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:00:39,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_309 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_309) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_309 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_309) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_310) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2024-10-11 18:00:39,115 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_309 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_309) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_309 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_309) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_310) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2024-10-11 18:00:39,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:39,160 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-10-11 18:00:39,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:39,169 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-10-11 18:00:39,176 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 62 treesize of output 50 [2024-10-11 18:00:39,180 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 96 treesize of output 78 [2024-10-11 18:00:39,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 18:00:39,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:00:39,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:39,212 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2024-10-11 18:00:39,220 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 54 treesize of output 36 [2024-10-11 18:00:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-11 18:00:39,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:39,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355949165] [2024-10-11 18:00:39,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355949165] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:00:39,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:00:39,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-11 18:00:39,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759459515] [2024-10-11 18:00:39,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:00:39,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:00:39,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:39,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:00:39,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=87, Unknown=2, NotChecked=38, Total=156 [2024-10-11 18:00:39,287 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:40,450 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2024-10-11 18:00:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:00:40,452 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 18:00:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:40,453 INFO L225 Difference]: With dead ends: 96 [2024-10-11 18:00:40,453 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 18:00:40,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=186, Unknown=2, NotChecked=58, Total=306 [2024-10-11 18:00:40,453 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 17 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:40,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 395 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 275 Invalid, 0 Unknown, 87 Unchecked, 0.9s Time] [2024-10-11 18:00:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 18:00:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 18:00:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.565217391304348) internal successors, (108), 95 states have internal predecessors, (108), 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-11 18:00:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2024-10-11 18:00:40,459 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 13 [2024-10-11 18:00:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:40,461 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2024-10-11 18:00:40,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2024-10-11 18:00:40,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:00:40,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:40,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:40,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:40,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:40,667 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:40,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1921063850, now seen corresponding path program 1 times [2024-10-11 18:00:40,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:40,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553602793] [2024-10-11 18:00:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:40,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:00:40,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:40,671 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:40,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:40,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:00:40,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:40,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 18:00:40,870 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 15 treesize of output 1 [2024-10-11 18:00:40,903 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 19 treesize of output 11 [2024-10-11 18:00:40,914 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-11 18:00:40,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:40,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:40,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553602793] [2024-10-11 18:00:40,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553602793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:40,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:40,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:00:40,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409278971] [2024-10-11 18:00:40,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:40,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:00:40,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:40,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:00:40,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:00:40,916 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-11 18:00:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:41,331 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2024-10-11 18:00:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:00:41,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 18:00:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:41,333 INFO L225 Difference]: With dead ends: 152 [2024-10-11 18:00:41,333 INFO L226 Difference]: Without dead ends: 152 [2024-10-11 18:00:41,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:00:41,334 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 60 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:41,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 151 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:00:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-11 18:00:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 96. [2024-10-11 18:00:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 95 states have internal predecessors, (107), 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-11 18:00:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2024-10-11 18:00:41,339 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 15 [2024-10-11 18:00:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:41,339 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2024-10-11 18:00:41,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-11 18:00:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2024-10-11 18:00:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:00:41,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:41,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:41,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 18:00:41,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:41,543 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:41,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:41,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1921063849, now seen corresponding path program 1 times [2024-10-11 18:00:41,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:41,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300546139] [2024-10-11 18:00:41,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:41,544 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-11 18:00:41,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:41,545 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:41,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:41,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:00:41,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:41,647 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-11 18:00:41,759 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 15 treesize of output 1 [2024-10-11 18:00:41,764 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 11 treesize of output 7 [2024-10-11 18:00:41,820 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 17 treesize of output 9 [2024-10-11 18:00:41,837 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-11 18:00:41,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:41,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:41,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300546139] [2024-10-11 18:00:41,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300546139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:41,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:41,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:00:41,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839513334] [2024-10-11 18:00:41,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:41,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:00:41,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:41,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:00:41,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:00:41,839 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-11 18:00:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:42,358 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2024-10-11 18:00:42,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:00:42,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 18:00:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:42,360 INFO L225 Difference]: With dead ends: 140 [2024-10-11 18:00:42,360 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 18:00:42,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:00:42,361 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 46 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:42,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 170 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:00:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 18:00:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 98. [2024-10-11 18:00:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 97 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:42,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2024-10-11 18:00:42,365 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 15 [2024-10-11 18:00:42,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:42,365 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2024-10-11 18:00:42,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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-11 18:00:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2024-10-11 18:00:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:00:42,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:42,367 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:42,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-11 18:00:42,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:42,568 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:42,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:42,568 INFO L85 PathProgramCache]: Analyzing trace with hash 119019939, now seen corresponding path program 2 times [2024-10-11 18:00:42,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:42,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546740716] [2024-10-11 18:00:42,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:00:42,569 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-11 18:00:42,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:42,572 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:42,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:42,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:00:42,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:00:42,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 18:00:42,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:42,804 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-11 18:00:42,825 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:00:42,826 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-11 18:00:42,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:00:42,870 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-11 18:00:42,883 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-11 18:00:43,003 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:00:43,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:00:43,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:00:43,145 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:00:43,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:00:43,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:00:43,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-11 18:00:43,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:00:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:43,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:00:43,405 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_419) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_418) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_419) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32) .cse2) (bvadd .cse0 (_ bv8 32) .cse2)))))) is different from false [2024-10-11 18:00:43,435 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_419) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_418) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_419) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse3) (bvadd .cse0 (_ bv8 32) .cse3))))))) is different from false [2024-10-11 18:00:43,558 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_416))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_417) .cse1 v_ArrVal_419) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_418) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_417) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_416) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_419) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32) .cse4) (bvadd .cse0 (_ bv12 32) .cse4)))))) is different from false [2024-10-11 18:00:43,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_418 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_416))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_417) .cse2 v_ArrVal_419) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_418) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (forall ((v_ArrVal_417 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_416 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_417) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_416) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_419) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse5 (_ bv8 32)) (bvadd .cse0 .cse5 (_ bv12 32)))))))) is different from false [2024-10-11 18:00:43,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:43,684 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2024-10-11 18:00:43,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:43,695 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2024-10-11 18:00:43,701 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 102 treesize of output 84 [2024-10-11 18:00:43,706 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 174 treesize of output 144 [2024-10-11 18:00:43,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2024-10-11 18:00:43,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-10-11 18:00:43,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 18:00:43,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:43,760 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2024-10-11 18:00:43,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:43,777 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2024-10-11 18:00:43,782 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:00:43,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2024-10-11 18:00:43,788 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:00:43,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-11 18:00:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-10-11 18:00:43,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:43,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546740716] [2024-10-11 18:00:43,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546740716] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:00:43,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:00:43,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-11 18:00:43,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407404769] [2024-10-11 18:00:43,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:00:43,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 18:00:43,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:43,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 18:00:43,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=128, Unknown=4, NotChecked=100, Total=272 [2024-10-11 18:00:43,840 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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-11 18:00:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:44,956 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2024-10-11 18:00:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:00:44,957 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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 16 [2024-10-11 18:00:44,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:44,958 INFO L225 Difference]: With dead ends: 101 [2024-10-11 18:00:44,958 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 18:00:44,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=84, Invalid=308, Unknown=4, NotChecked=156, Total=552 [2024-10-11 18:00:44,959 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 20 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:44,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 505 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 334 Invalid, 0 Unknown, 186 Unchecked, 0.8s Time] [2024-10-11 18:00:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 18:00:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 18:00:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 100 states have internal predecessors, (112), 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-11 18:00:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2024-10-11 18:00:44,963 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 16 [2024-10-11 18:00:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:44,963 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2024-10-11 18:00:44,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 states have internal predecessors, (27), 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-11 18:00:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2024-10-11 18:00:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:00:44,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:44,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:44,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-11 18:00:45,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:45,167 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:45,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:45,167 INFO L85 PathProgramCache]: Analyzing trace with hash 693633776, now seen corresponding path program 1 times [2024-10-11 18:00:45,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:45,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797275063] [2024-10-11 18:00:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:45,168 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-11 18:00:45,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:45,169 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:45,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-11 18:00:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:45,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 18:00:45,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:45,340 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 11 treesize of output 7 [2024-10-11 18:00:45,355 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 11 treesize of output 7 [2024-10-11 18:00:45,392 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 15 treesize of output 1 [2024-10-11 18:00:45,400 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 15 treesize of output 1 [2024-10-11 18:00:45,461 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 38 treesize of output 26 [2024-10-11 18:00:45,466 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 30 treesize of output 18 [2024-10-11 18:00:45,522 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-11 18:00:45,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:45,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:45,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797275063] [2024-10-11 18:00:45,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797275063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:45,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:45,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:00:45,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831373986] [2024-10-11 18:00:45,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:45,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:00:45,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:45,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:00:45,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:00:45,525 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:45,962 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2024-10-11 18:00:45,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:00:45,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 18:00:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:45,963 INFO L225 Difference]: With dead ends: 124 [2024-10-11 18:00:45,963 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 18:00:45,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:00:45,964 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 30 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:45,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 332 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:00:45,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 18:00:45,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2024-10-11 18:00:45,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 111 states have internal predecessors, (124), 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-11 18:00:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-10-11 18:00:45,968 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 17 [2024-10-11 18:00:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:45,970 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-10-11 18:00:45,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-10-11 18:00:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:00:45,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:45,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:45,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-11 18:00:46,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:46,173 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:46,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:46,173 INFO L85 PathProgramCache]: Analyzing trace with hash 862094732, now seen corresponding path program 1 times [2024-10-11 18:00:46,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:46,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997623550] [2024-10-11 18:00:46,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:00:46,174 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-11 18:00:46,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:46,175 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:46,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-11 18:00:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:00:46,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:00:46,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:46,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 18:00:46,342 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-11 18:00:46,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:00:46,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:46,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997623550] [2024-10-11 18:00:46,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997623550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:00:46,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:00:46,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:00:46,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692884500] [2024-10-11 18:00:46,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:00:46,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:00:46,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:46,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:00:46,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:00:46,344 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:00:46,480 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2024-10-11 18:00:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:00:46,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 18:00:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:00:46,483 INFO L225 Difference]: With dead ends: 141 [2024-10-11 18:00:46,483 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 18:00:46,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:00:46,483 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 63 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:00:46,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 181 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:00:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 18:00:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 124. [2024-10-11 18:00:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 97 states have (on average 1.5360824742268042) internal successors, (149), 123 states have internal predecessors, (149), 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-11 18:00:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 149 transitions. [2024-10-11 18:00:46,488 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 149 transitions. Word has length 19 [2024-10-11 18:00:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:00:46,488 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 149 transitions. [2024-10-11 18:00:46,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:00:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 149 transitions. [2024-10-11 18:00:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:00:46,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:00:46,489 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:00:46,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-11 18:00:46,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:46,690 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:00:46,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:00:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1916312501, now seen corresponding path program 3 times [2024-10-11 18:00:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:00:46,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098332481] [2024-10-11 18:00:46,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 18:00:46,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 18:00:46,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:00:46,692 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:00:46,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-11 18:00:47,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-11 18:00:47,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:00:47,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 18:00:47,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:00:47,051 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-11 18:00:47,063 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-11 18:00:47,073 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:00:47,074 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-11 18:00:47,107 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-11 18:00:47,122 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-11 18:00:47,216 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:00:47,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:00:47,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:00:47,327 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:00:47,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:00:47,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:00:47,475 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:00:47,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:00:47,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:00:47,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-11 18:00:47,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:00:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:00:47,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:00:47,686 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_545) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (bvule (bvadd .cse2 .cse1 (_ bv4 32)) (bvadd .cse2 .cse1 (_ bv8 32))))))) is different from false [2024-10-11 18:00:47,716 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_545) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse3) (bvadd .cse0 (_ bv8 32) .cse3))))))) is different from false [2024-10-11 18:00:47,841 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_543))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_542) .cse0 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_545) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_542) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse4 .cse2 (_ bv8 32)) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2024-10-11 18:00:47,914 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_542) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1 (_ bv8 32)) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_543))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_542) .cse4 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_545) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))) is different from false [2024-10-11 18:00:50,045 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_540 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_540))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_541) .cse2 v_ArrVal_542) (select (select (store .cse3 .cse2 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_544))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv12 32) .cse1) (bvadd .cse0 (_ bv16 32) .cse1)))) (forall ((v_ArrVal_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_540))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_543))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_541) .cse5 v_ArrVal_542) .cse6 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_545) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))))) is different from false [2024-10-11 18:00:51,546 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_540))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_543))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_541) .cse2 v_ArrVal_542) .cse3 v_ArrVal_544) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_545) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))) (forall ((v_ArrVal_541 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_540 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_540))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_541) .cse8 v_ArrVal_542) (select (select (store .cse9 .cse8 v_ArrVal_543) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_544))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv12 32) .cse7) (bvadd .cse0 (_ bv16 32) .cse7))))))) is different from false [2024-10-11 18:00:51,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:51,688 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2024-10-11 18:00:51,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:51,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2024-10-11 18:00:51,762 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 16980 treesize of output 14442 [2024-10-11 18:00:51,903 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 4039 treesize of output 3919 [2024-10-11 18:00:51,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 184 [2024-10-11 18:00:51,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 168 [2024-10-11 18:00:52,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 138 [2024-10-11 18:00:52,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 136 [2024-10-11 18:00:52,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2024-10-11 18:00:52,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 124 [2024-10-11 18:00:53,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:53,062 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2024-10-11 18:00:53,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:00:53,124 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 108 [2024-10-11 18:00:53,176 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 588 treesize of output 498 [2024-10-11 18:00:53,235 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 2174 treesize of output 2036 [2024-10-11 18:00:53,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2024-10-11 18:00:53,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2024-10-11 18:00:53,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2024-10-11 18:00:53,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2024-10-11 18:00:53,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-10-11 18:00:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2024-10-11 18:00:53,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:00:53,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098332481] [2024-10-11 18:00:53,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098332481] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:00:53,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:00:53,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-10-11 18:00:53,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315285748] [2024-10-11 18:00:53,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:00:53,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 18:00:53,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:00:53,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 18:00:53,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=177, Unknown=6, NotChecked=186, Total=420 [2024-10-11 18:00:53,857 INFO L87 Difference]: Start difference. First operand 124 states and 149 transitions. Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:01,419 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2024-10-11 18:01:01,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:01:01,421 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 18:01:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:01,421 INFO L225 Difference]: With dead ends: 127 [2024-10-11 18:01:01,421 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 18:01:01,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=108, Invalid=462, Unknown=6, NotChecked=294, Total=870 [2024-10-11 18:01:01,422 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 23 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:01,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 655 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 461 Invalid, 0 Unknown, 297 Unchecked, 5.2s Time] [2024-10-11 18:01:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 18:01:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-11 18:01:01,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.52) internal successors, (152), 126 states have internal predecessors, (152), 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-11 18:01:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2024-10-11 18:01:01,427 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 19 [2024-10-11 18:01:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:01,427 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2024-10-11 18:01:01,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2024-10-11 18:01:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:01:01,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:01,428 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] [2024-10-11 18:01:01,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:01,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:01,629 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:01:01,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:01,630 INFO L85 PathProgramCache]: Analyzing trace with hash 955133088, now seen corresponding path program 1 times [2024-10-11 18:01:01,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:01:01,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345172354] [2024-10-11 18:01:01,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:01,631 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-11 18:01:01,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:01:01,632 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:01,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-11 18:01:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:01,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 18:01:01,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:02,460 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 15 treesize of output 1 [2024-10-11 18:01:02,949 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-11 18:01:03,135 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-11 18:01:03,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:03,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:01:03,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345172354] [2024-10-11 18:01:03,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345172354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:03,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:03,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:01:03,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057006075] [2024-10-11 18:01:03,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:03,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:01:03,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:01:03,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:01:03,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:01:03,137 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-11 18:01:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:05,107 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2024-10-11 18:01:05,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:01:05,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2024-10-11 18:01:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:05,109 INFO L225 Difference]: With dead ends: 181 [2024-10-11 18:01:05,109 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 18:01:05,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:01:05,110 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 158 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:05,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 179 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 18:01:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 18:01:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 128. [2024-10-11 18:01:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 101 states have (on average 1.5148514851485149) internal successors, (153), 127 states have internal predecessors, (153), 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-11 18:01:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 153 transitions. [2024-10-11 18:01:05,115 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 153 transitions. Word has length 20 [2024-10-11 18:01:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:05,116 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 153 transitions. [2024-10-11 18:01:05,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-11 18:01:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2024-10-11 18:01:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:01:05,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:05,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:05,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:05,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:05,317 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:01:05,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash -455645170, now seen corresponding path program 1 times [2024-10-11 18:01:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:01:05,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933764228] [2024-10-11 18:01:05,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:05,318 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-11 18:01:05,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:01:05,319 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:05,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-11 18:01:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:05,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:01:05,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:05,461 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-11 18:01:05,885 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 15 treesize of output 1 [2024-10-11 18:01:06,126 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 19 treesize of output 11 [2024-10-11 18:01:06,257 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-11 18:01:06,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:06,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:01:06,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933764228] [2024-10-11 18:01:06,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933764228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:06,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:06,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:01:06,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171149757] [2024-10-11 18:01:06,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:06,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:06,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:01:06,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:06,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:06,259 INFO L87 Difference]: Start difference. First operand 128 states and 153 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:08,364 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2024-10-11 18:01:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:01:08,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 18:01:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:08,365 INFO L225 Difference]: With dead ends: 184 [2024-10-11 18:01:08,365 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 18:01:08,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:01:08,366 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 53 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:08,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 158 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 18:01:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 18:01:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 131. [2024-10-11 18:01:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 104 states have (on average 1.5) internal successors, (156), 130 states have internal predecessors, (156), 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-11 18:01:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2024-10-11 18:01:08,371 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 21 [2024-10-11 18:01:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:08,372 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2024-10-11 18:01:08,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2024-10-11 18:01:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:01:08,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:08,373 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:08,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:08,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:08,574 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:01:08,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:08,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1709147141, now seen corresponding path program 1 times [2024-10-11 18:01:08,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:01:08,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266262524] [2024-10-11 18:01:08,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:08,575 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-11 18:01:08,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:01:08,576 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:08,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-11 18:01:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:08,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 18:01:08,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:09,047 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-11 18:01:10,008 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 15 treesize of output 1 [2024-10-11 18:01:10,069 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 11 treesize of output 7 [2024-10-11 18:01:10,286 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 15 treesize of output 1 [2024-10-11 18:01:10,331 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 15 treesize of output 1 [2024-10-11 18:01:10,670 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 40 treesize of output 28 [2024-10-11 18:01:10,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-10-11 18:01:10,865 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 17 treesize of output 9 [2024-10-11 18:01:11,073 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-11 18:01:11,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:11,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:01:11,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266262524] [2024-10-11 18:01:11,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266262524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:11,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:11,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:01:11,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077312653] [2024-10-11 18:01:11,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:11,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:01:11,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:01:11,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:01:11,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:01:11,075 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:14,147 INFO L93 Difference]: Finished difference Result 163 states and 194 transitions. [2024-10-11 18:01:14,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:01:14,147 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 18:01:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:14,148 INFO L225 Difference]: With dead ends: 163 [2024-10-11 18:01:14,148 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 18:01:14,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:14,149 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 53 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:14,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 238 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 18:01:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 18:01:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2024-10-11 18:01:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 138 states have internal predecessors, (171), 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-11 18:01:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 171 transitions. [2024-10-11 18:01:14,152 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 171 transitions. Word has length 21 [2024-10-11 18:01:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:14,153 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 171 transitions. [2024-10-11 18:01:14,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 171 transitions. [2024-10-11 18:01:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:01:14,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:14,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:14,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:14,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:14,354 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:01:14,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1709147140, now seen corresponding path program 1 times [2024-10-11 18:01:14,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:01:14,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247239008] [2024-10-11 18:01:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:14,356 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-11 18:01:14,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:01:14,357 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:14,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-11 18:01:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:14,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:01:14,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:14,630 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-11 18:01:15,306 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 15 treesize of output 1 [2024-10-11 18:01:15,506 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 15 treesize of output 1 [2024-10-11 18:01:15,544 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 15 treesize of output 1 [2024-10-11 18:01:15,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-10-11 18:01:15,781 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 15 [2024-10-11 18:01:15,928 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 19 treesize of output 11 [2024-10-11 18:01:16,092 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-11 18:01:16,092 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:16,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:01:16,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247239008] [2024-10-11 18:01:16,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247239008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:16,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:16,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:01:16,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217313518] [2024-10-11 18:01:16,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:16,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:01:16,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:01:16,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:01:16,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:01:16,094 INFO L87 Difference]: Start difference. First operand 139 states and 171 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:20,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:20,160 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2024-10-11 18:01:20,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:01:20,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 18:01:20,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:20,162 INFO L225 Difference]: With dead ends: 163 [2024-10-11 18:01:20,162 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 18:01:20,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:20,162 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 69 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:20,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 254 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 18:01:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 18:01:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 145. [2024-10-11 18:01:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 144 states have internal predecessors, (177), 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-11 18:01:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2024-10-11 18:01:20,166 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 21 [2024-10-11 18:01:20,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:20,166 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2024-10-11 18:01:20,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:20,166 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2024-10-11 18:01:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:01:20,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:20,166 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] [2024-10-11 18:01:20,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2024-10-11 18:01:20,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:20,367 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:01:20,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:20,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1240098205, now seen corresponding path program 1 times [2024-10-11 18:01:20,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:01:20,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935717083] [2024-10-11 18:01:20,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:20,368 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-11 18:01:20,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:01:20,371 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:20,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-11 18:01:20,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:20,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:01:20,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:20,494 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-11 18:01:20,768 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-11 18:01:20,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:01:21,411 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 15 treesize of output 1 [2024-10-11 18:01:21,936 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 16 treesize of output 8 [2024-10-11 18:01:22,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-11 18:01:22,181 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-11 18:01:22,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:22,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:01:22,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935717083] [2024-10-11 18:01:22,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935717083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:22,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:22,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:01:22,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280780721] [2024-10-11 18:01:22,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:22,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:01:22,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:01:22,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:01:22,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:01:22,183 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11 18:01:24,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:24,187 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2024-10-11 18:01:24,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:01:24,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2024-10-11 18:01:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:24,188 INFO L225 Difference]: With dead ends: 157 [2024-10-11 18:01:24,188 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 18:01:24,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:01:24,189 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 86 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:24,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 139 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 18:01:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 18:01:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2024-10-11 18:01:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 120 states have (on average 1.4916666666666667) internal successors, (179), 145 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:24,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2024-10-11 18:01:24,193 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 22 [2024-10-11 18:01:24,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:24,194 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2024-10-11 18:01:24,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11 18:01:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2024-10-11 18:01:24,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:01:24,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:24,194 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] [2024-10-11 18:01:24,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:24,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:24,395 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:01:24,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:24,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1240098204, now seen corresponding path program 1 times [2024-10-11 18:01:24,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:01:24,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935626291] [2024-10-11 18:01:24,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:24,396 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-11 18:01:24,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:01:24,398 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:24,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-10-11 18:01:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:24,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:01:24,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:25,144 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-11 18:01:25,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:25,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:01:25,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935626291] [2024-10-11 18:01:25,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935626291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:25,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:25,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:01:25,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446741839] [2024-10-11 18:01:25,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:25,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:01:25,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:01:25,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:01:25,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:01:25,146 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-11 18:01:25,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:25,612 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2024-10-11 18:01:25,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:25,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-10-11 18:01:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:25,614 INFO L225 Difference]: With dead ends: 141 [2024-10-11 18:01:25,615 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 18:01:25,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:01:25,615 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 97 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:25,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 39 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:01:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 18:01:25,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-10-11 18:01:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 120 states have (on average 1.425) internal successors, (171), 140 states have internal predecessors, (171), 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-11 18:01:25,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 171 transitions. [2024-10-11 18:01:25,620 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 171 transitions. Word has length 22 [2024-10-11 18:01:25,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:25,620 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 171 transitions. [2024-10-11 18:01:25,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-11 18:01:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 171 transitions. [2024-10-11 18:01:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:01:25,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:25,621 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:25,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:25,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:25,822 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-10-11 18:01:25,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:25,822 INFO L85 PathProgramCache]: Analyzing trace with hash -156747613, now seen corresponding path program 4 times [2024-10-11 18:01:25,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:01:25,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873538051] [2024-10-11 18:01:25,823 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 18:01:25,823 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-11 18:01:25,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:01:25,824 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 18:01:25,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-10-11 18:01:26,250 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 18:01:26,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:01:26,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 18:01:26,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:26,287 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-11 18:01:26,434 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 18:01:26,435 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-11 18:01:26,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:01:26,640 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-11 18:01:26,719 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-11 18:01:27,383 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:01:27,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:01:27,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:01:28,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:01:28,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:01:28,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:01:29,194 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:01:29,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:01:29,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:01:30,082 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:01:30,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:01:30,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:01:30,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-11 18:01:30,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:01:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:30,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:31,633 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_834 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32))))) (forall ((v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_834 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse1 (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2024-10-11 18:01:31,714 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_834 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32))))) (forall ((v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_834 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2024-10-11 18:01:32,018 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_834 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_833) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_832) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 (_ bv12 32) .cse1)))) (forall ((v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_834 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_832))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_833) .cse3 v_ArrVal_834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) is different from false [2024-10-11 18:01:33,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_834 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_830))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_831) .cse2 v_ArrVal_833) (select (select (store .cse3 .cse2 v_ArrVal_832) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_834))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 .cse1 (_ bv16 32))))) (forall ((v_ArrVal_830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_834 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_830))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_832))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_831) .cse5 v_ArrVal_833) .cse6 v_ArrVal_834) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse1 (_ bv16 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_835) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))))) is different from false