./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:59:24,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:59:24,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 18:59:24,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:59:24,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:59:24,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:59:24,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:59:24,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:59:24,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:59:24,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:59:24,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:59:24,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:59:24,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:59:24,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:59:24,818 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:59:24,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:59:24,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:59:24,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:59:24,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:59:24,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:59:24,820 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:59:24,821 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:59:24,821 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:59:24,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:59:24,821 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:59:24,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:59:24,822 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:59:24,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:59:24,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:59:24,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:59:24,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:59:24,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:59:24,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:59:24,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:59:24,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:59:24,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:59:24,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:59:24,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:59:24,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:59:24,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:59:24,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:59:24,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:59:24,833 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 [2024-10-14 18:59:25,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:59:25,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:59:25,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:59:25,174 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:59:25,175 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:59:25,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2024-10-14 18:59:26,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:59:26,907 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:59:26,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2024-10-14 18:59:26,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c5ac3728/7ae0843500184ea2af756343a5115687/FLAG20a1d4b9f [2024-10-14 18:59:27,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c5ac3728/7ae0843500184ea2af756343a5115687 [2024-10-14 18:59:27,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:59:27,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:59:27,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:59:27,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:59:27,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:59:27,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:59:27" (1/1) ... [2024-10-14 18:59:27,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ee742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:27, skipping insertion in model container [2024-10-14 18:59:27,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:59:27" (1/1) ... [2024-10-14 18:59:27,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:59:27,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:59:27,743 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 18:59:27,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@60d0db56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:27, skipping insertion in model container [2024-10-14 18:59:27,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:59:27,745 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 18:59:27,746 INFO L158 Benchmark]: Toolchain (without parser) took 561.89ms. Allocated memory is still 178.3MB. Free memory was 145.2MB in the beginning and 125.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 18:59:27,747 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory was 77.3MB in the beginning and 77.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 18:59:27,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.72ms. Allocated memory is still 178.3MB. Free memory was 144.2MB in the beginning and 125.9MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 18:59:27,750 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.14ms. Allocated memory is still 104.9MB. Free memory was 77.3MB in the beginning and 77.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.72ms. Allocated memory is still 178.3MB. Free memory was 144.2MB in the beginning and 125.9MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:59:29,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:59:29,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 18:59:29,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:59:29,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:59:29,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:59:29,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:59:29,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:59:29,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:59:29,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:59:29,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:59:29,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:59:29,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:59:29,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:59:29,975 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:59:29,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:59:29,976 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:59:29,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:59:29,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:59:29,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:59:29,977 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:59:29,981 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:59:29,981 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:59:29,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:59:29,982 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:59:29,982 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 18:59:29,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:59:29,983 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 18:59:29,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:59:29,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:59:29,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:59:29,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:59:29,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:59:29,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:59:29,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:59:29,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:59:29,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:59:29,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:59:29,985 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 18:59:29,985 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 18:59:29,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:59:29,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:59:29,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:59:29,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:59:29,987 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 18:59:29,988 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2f43006c9a8080eee594d7c3e874c7ea5bb3a923f26b30531e1d07ef5cff7d9 [2024-10-14 18:59:30,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:59:30,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:59:30,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:59:30,355 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:59:30,356 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:59:30,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2024-10-14 18:59:32,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:59:32,365 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:59:32,365 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test1-1.i [2024-10-14 18:59:32,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e6d16ad0/ad05a406fe444eb4bfe0850154cc874c/FLAGa8ec325df [2024-10-14 18:59:32,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e6d16ad0/ad05a406fe444eb4bfe0850154cc874c [2024-10-14 18:59:32,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:59:32,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:59:32,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:59:32,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:59:32,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:59:32,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:59:32" (1/1) ... [2024-10-14 18:59:32,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b690e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:32, skipping insertion in model container [2024-10-14 18:59:32,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:59:32" (1/1) ... [2024-10-14 18:59:32,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:59:33,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:59:33,246 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 18:59:33,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:59:33,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:59:33,364 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:59:33,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:59:33,475 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:59:33,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33 WrapperNode [2024-10-14 18:59:33,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:59:33,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:59:33,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:59:33,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:59:33,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33" (1/1) ... [2024-10-14 18:59:33,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33" (1/1) ... [2024-10-14 18:59:33,575 INFO L138 Inliner]: procedures = 179, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 640 [2024-10-14 18:59:33,579 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:59:33,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:59:33,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:59:33,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:59:33,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33" (1/1) ... [2024-10-14 18:59:33,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33" (1/1) ... [2024-10-14 18:59:33,614 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33" (1/1) ... [2024-10-14 18:59:33,690 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-10-14 18:59:33,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33" (1/1) ... [2024-10-14 18:59:33,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33" (1/1) ... [2024-10-14 18:59:33,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33" (1/1) ... [2024-10-14 18:59:33,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33" (1/1) ... [2024-10-14 18:59:33,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33" (1/1) ... [2024-10-14 18:59:33,756 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33" (1/1) ... [2024-10-14 18:59:33,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:59:33,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:59:33,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:59:33,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:59:33,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33" (1/1) ... [2024-10-14 18:59:33,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:59:33,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:59:33,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 18:59:33,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 18:59:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 18:59:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 18:59:33,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 18:59:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 18:59:33,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 18:59:33,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 18:59:33,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 18:59:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 18:59:33,863 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 18:59:33,863 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 18:59:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:59:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 18:59:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:59:33,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 18:59:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:59:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 18:59:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:59:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 18:59:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 18:59:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 18:59:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 18:59:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:59:33,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:59:34,111 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:59:34,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:59:34,118 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 18:59:34,181 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 18:59:36,920 INFO L? ?]: Removed 686 outVars from TransFormulas that were not future-live. [2024-10-14 18:59:36,921 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:59:37,072 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:59:37,073 INFO L314 CfgBuilder]: Removed 31 assume(true) statements. [2024-10-14 18:59:37,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:59:37 BoogieIcfgContainer [2024-10-14 18:59:37,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:59:37,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:59:37,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:59:37,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:59:37,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:59:32" (1/3) ... [2024-10-14 18:59:37,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6da420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:59:37, skipping insertion in model container [2024-10-14 18:59:37,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:59:33" (2/3) ... [2024-10-14 18:59:37,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6da420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:59:37, skipping insertion in model container [2024-10-14 18:59:37,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:59:37" (3/3) ... [2024-10-14 18:59:37,087 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test1-1.i [2024-10-14 18:59:37,104 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:59:37,104 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 320 error locations. [2024-10-14 18:59:37,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:59:37,168 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;@2ac8bdbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:59:37,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2024-10-14 18:59:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 593 states, 260 states have (on average 2.5) internal successors, (650), 587 states have internal predecessors, (650), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 18:59:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 18:59:37,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:37,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 18:59:37,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:37,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash 33095977, now seen corresponding path program 1 times [2024-10-14 18:59:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:37,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374546169] [2024-10-14 18:59:37,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:37,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:37,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:37,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:37,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 18:59:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:37,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 18:59:37,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:37,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 18:59:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:37,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:59:37,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:37,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374546169] [2024-10-14 18:59:37,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374546169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:59:37,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:59:37,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:59:37,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582377693] [2024-10-14 18:59:37,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:59:37,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:59:37,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:37,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:59:37,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:59:37,437 INFO L87 Difference]: Start difference. First operand has 593 states, 260 states have (on average 2.5) internal successors, (650), 587 states have internal predecessors, (650), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:38,758 INFO L93 Difference]: Finished difference Result 536 states and 583 transitions. [2024-10-14 18:59:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:59:38,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 18:59:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:38,773 INFO L225 Difference]: With dead ends: 536 [2024-10-14 18:59:38,773 INFO L226 Difference]: Without dead ends: 535 [2024-10-14 18:59:38,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:59:38,777 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 476 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:38,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 277 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 18:59:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-14 18:59:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 533. [2024-10-14 18:59:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 255 states have (on average 2.168627450980392) internal successors, (553), 527 states have internal predecessors, (553), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 18:59:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 579 transitions. [2024-10-14 18:59:38,839 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 579 transitions. Word has length 4 [2024-10-14 18:59:38,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:38,840 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 579 transitions. [2024-10-14 18:59:38,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:38,840 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 579 transitions. [2024-10-14 18:59:38,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 18:59:38,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:38,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 18:59:38,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 18:59:39,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:39,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:39,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash 33095978, now seen corresponding path program 1 times [2024-10-14 18:59:39,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:39,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287162170] [2024-10-14 18:59:39,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:39,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:39,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:39,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:39,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 18:59:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:39,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:59:39,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:39,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:59:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:39,153 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:59:39,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:39,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287162170] [2024-10-14 18:59:39,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287162170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:59:39,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:59:39,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:59:39,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478459339] [2024-10-14 18:59:39,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:59:39,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:59:39,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:39,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:59:39,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:59:39,157 INFO L87 Difference]: Start difference. First operand 533 states and 579 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:40,310 INFO L93 Difference]: Finished difference Result 597 states and 647 transitions. [2024-10-14 18:59:40,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:59:40,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 18:59:40,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:40,315 INFO L225 Difference]: With dead ends: 597 [2024-10-14 18:59:40,316 INFO L226 Difference]: Without dead ends: 597 [2024-10-14 18:59:40,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:59:40,317 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 234 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:40,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 594 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 18:59:40,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-10-14 18:59:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 550. [2024-10-14 18:59:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 282 states have (on average 2.152482269503546) internal successors, (607), 544 states have internal predecessors, (607), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 18:59:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 633 transitions. [2024-10-14 18:59:40,337 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 633 transitions. Word has length 4 [2024-10-14 18:59:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:40,338 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 633 transitions. [2024-10-14 18:59:40,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 633 transitions. [2024-10-14 18:59:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 18:59:40,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:40,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 18:59:40,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 18:59:40,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:40,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:40,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1026781799, now seen corresponding path program 1 times [2024-10-14 18:59:40,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:40,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523446668] [2024-10-14 18:59:40,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:40,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:40,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:40,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:40,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 18:59:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:40,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 18:59:40,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:40,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:59:40,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:40,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523446668] [2024-10-14 18:59:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523446668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:59:40,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:59:40,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:59:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507506801] [2024-10-14 18:59:40,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:59:40,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:59:40,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:40,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:59:40,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:59:40,646 INFO L87 Difference]: Start difference. First operand 550 states and 633 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:41,271 INFO L93 Difference]: Finished difference Result 1056 states and 1202 transitions. [2024-10-14 18:59:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:59:41,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 18:59:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:41,277 INFO L225 Difference]: With dead ends: 1056 [2024-10-14 18:59:41,277 INFO L226 Difference]: Without dead ends: 1056 [2024-10-14 18:59:41,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:59:41,278 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 498 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:41,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1178 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 18:59:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2024-10-14 18:59:41,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 551. [2024-10-14 18:59:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 283 states have (on average 2.148409893992933) internal successors, (608), 545 states have internal predecessors, (608), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 18:59:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 634 transitions. [2024-10-14 18:59:41,301 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 634 transitions. Word has length 5 [2024-10-14 18:59:41,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:41,301 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 634 transitions. [2024-10-14 18:59:41,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 634 transitions. [2024-10-14 18:59:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 18:59:41,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:41,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:59:41,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 18:59:41,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:41,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:41,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:41,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1355304371, now seen corresponding path program 1 times [2024-10-14 18:59:41,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:41,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140358006] [2024-10-14 18:59:41,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:41,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:41,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:41,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:41,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 18:59:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:41,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 18:59:41,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:41,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:59:41,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:41,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140358006] [2024-10-14 18:59:41,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140358006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:59:41,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:59:41,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:59:41,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147687194] [2024-10-14 18:59:41,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:59:41,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:59:41,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:41,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:59:41,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:59:41,616 INFO L87 Difference]: Start difference. First operand 551 states and 634 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:42,022 INFO L93 Difference]: Finished difference Result 512 states and 594 transitions. [2024-10-14 18:59:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:59:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 18:59:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:42,028 INFO L225 Difference]: With dead ends: 512 [2024-10-14 18:59:42,028 INFO L226 Difference]: Without dead ends: 512 [2024-10-14 18:59:42,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:59:42,032 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 61 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:42,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 872 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:59:42,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-10-14 18:59:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2024-10-14 18:59:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 268 states have (on average 2.1194029850746268) internal successors, (568), 506 states have internal predecessors, (568), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 18:59:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 594 transitions. [2024-10-14 18:59:42,050 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 594 transitions. Word has length 10 [2024-10-14 18:59:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:42,051 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 594 transitions. [2024-10-14 18:59:42,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 594 transitions. [2024-10-14 18:59:42,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 18:59:42,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:42,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:59:42,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 18:59:42,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:42,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:42,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1072405965, now seen corresponding path program 1 times [2024-10-14 18:59:42,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:42,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299731178] [2024-10-14 18:59:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:42,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:42,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:42,259 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:42,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 18:59:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:42,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 18:59:42,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:42,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:59:42,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299731178] [2024-10-14 18:59:42,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299731178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:59:42,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:59:42,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:59:42,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102935623] [2024-10-14 18:59:42,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:59:42,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:59:42,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:42,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:59:42,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:59:42,408 INFO L87 Difference]: Start difference. First operand 512 states and 594 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:42,853 INFO L93 Difference]: Finished difference Result 497 states and 572 transitions. [2024-10-14 18:59:42,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:59:42,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 18:59:42,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:42,856 INFO L225 Difference]: With dead ends: 497 [2024-10-14 18:59:42,856 INFO L226 Difference]: Without dead ends: 497 [2024-10-14 18:59:42,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:59:42,857 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 45 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:42,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1260 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:59:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-14 18:59:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2024-10-14 18:59:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 267 states have (on average 2.044943820224719) internal successors, (546), 491 states have internal predecessors, (546), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 18:59:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 572 transitions. [2024-10-14 18:59:42,871 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 572 transitions. Word has length 12 [2024-10-14 18:59:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:42,872 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 572 transitions. [2024-10-14 18:59:42,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 572 transitions. [2024-10-14 18:59:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 18:59:42,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:42,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:59:42,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-14 18:59:43,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:43,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:43,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:43,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1380225925, now seen corresponding path program 1 times [2024-10-14 18:59:43,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:43,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375683526] [2024-10-14 18:59:43,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:43,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:43,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:43,078 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:43,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 18:59:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:43,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:59:43,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:43,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 18:59:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:43,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:59:43,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:43,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375683526] [2024-10-14 18:59:43,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375683526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:59:43,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:59:43,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:59:43,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109109634] [2024-10-14 18:59:43,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:59:43,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:59:43,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:43,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:59:43,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:59:43,261 INFO L87 Difference]: Start difference. First operand 497 states and 572 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:44,299 INFO L93 Difference]: Finished difference Result 497 states and 572 transitions. [2024-10-14 18:59:44,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:59:44,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-14 18:59:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:44,301 INFO L225 Difference]: With dead ends: 497 [2024-10-14 18:59:44,302 INFO L226 Difference]: Without dead ends: 497 [2024-10-14 18:59:44,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:59:44,303 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 420 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:44,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 412 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 18:59:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-14 18:59:44,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 493. [2024-10-14 18:59:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 267 states have (on average 2.0299625468164795) internal successors, (542), 487 states have internal predecessors, (542), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 18:59:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 568 transitions. [2024-10-14 18:59:44,313 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 568 transitions. Word has length 26 [2024-10-14 18:59:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:44,314 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 568 transitions. [2024-10-14 18:59:44,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 568 transitions. [2024-10-14 18:59:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 18:59:44,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:44,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:59:44,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 18:59:44,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:44,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:44,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:44,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1380225924, now seen corresponding path program 1 times [2024-10-14 18:59:44,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:44,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461627105] [2024-10-14 18:59:44,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:44,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:44,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:44,519 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:44,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 18:59:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:44,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 18:59:44,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:44,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:59:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:44,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:59:44,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:44,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461627105] [2024-10-14 18:59:44,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461627105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:59:44,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:59:44,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:59:44,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094445919] [2024-10-14 18:59:44,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:59:44,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:59:44,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:44,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:59:44,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:59:44,860 INFO L87 Difference]: Start difference. First operand 493 states and 568 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:46,033 INFO L93 Difference]: Finished difference Result 540 states and 582 transitions. [2024-10-14 18:59:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:59:46,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-14 18:59:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:46,037 INFO L225 Difference]: With dead ends: 540 [2024-10-14 18:59:46,037 INFO L226 Difference]: Without dead ends: 540 [2024-10-14 18:59:46,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:59:46,038 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 174 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:46,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 760 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 18:59:46,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-10-14 18:59:46,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 489. [2024-10-14 18:59:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 267 states have (on average 2.0149812734082397) internal successors, (538), 483 states have internal predecessors, (538), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 18:59:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 564 transitions. [2024-10-14 18:59:46,048 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 564 transitions. Word has length 26 [2024-10-14 18:59:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:46,049 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 564 transitions. [2024-10-14 18:59:46,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 564 transitions. [2024-10-14 18:59:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 18:59:46,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:46,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:59:46,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 18:59:46,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:46,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:46,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:46,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1691675659, now seen corresponding path program 1 times [2024-10-14 18:59:46,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:46,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037771314] [2024-10-14 18:59:46,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:46,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:46,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:46,256 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:46,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 18:59:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:46,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 18:59:46,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:46,486 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:59:46,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:46,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037771314] [2024-10-14 18:59:46,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037771314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:59:46,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:59:46,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:59:46,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457621807] [2024-10-14 18:59:46,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:59:46,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:59:46,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:46,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:59:46,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:59:46,489 INFO L87 Difference]: Start difference. First operand 489 states and 564 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:47,006 INFO L93 Difference]: Finished difference Result 483 states and 554 transitions. [2024-10-14 18:59:47,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:59:47,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-14 18:59:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:47,010 INFO L225 Difference]: With dead ends: 483 [2024-10-14 18:59:47,010 INFO L226 Difference]: Without dead ends: 483 [2024-10-14 18:59:47,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:59:47,011 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 15 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:47,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1243 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 18:59:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-14 18:59:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2024-10-14 18:59:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 261 states have (on average 2.0229885057471266) internal successors, (528), 477 states have internal predecessors, (528), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 18:59:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 554 transitions. [2024-10-14 18:59:47,036 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 554 transitions. Word has length 42 [2024-10-14 18:59:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:47,036 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 554 transitions. [2024-10-14 18:59:47,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 554 transitions. [2024-10-14 18:59:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 18:59:47,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:47,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:59:47,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 18:59:47,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:47,241 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:47,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:47,241 INFO L85 PathProgramCache]: Analyzing trace with hash 489053462, now seen corresponding path program 1 times [2024-10-14 18:59:47,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:47,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67050985] [2024-10-14 18:59:47,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:47,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:47,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:47,247 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:47,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 18:59:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:47,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 18:59:47,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:47,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:59:47,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:47,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67050985] [2024-10-14 18:59:47,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67050985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:59:47,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:59:47,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:59:47,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622699736] [2024-10-14 18:59:47,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:59:47,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:59:47,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:47,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:59:47,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:59:47,692 INFO L87 Difference]: Start difference. First operand 483 states and 554 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:48,203 INFO L93 Difference]: Finished difference Result 526 states and 597 transitions. [2024-10-14 18:59:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:59:48,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-14 18:59:48,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:48,207 INFO L225 Difference]: With dead ends: 526 [2024-10-14 18:59:48,208 INFO L226 Difference]: Without dead ends: 526 [2024-10-14 18:59:48,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:59:48,209 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 0 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:48,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 843 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 18:59:48,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-14 18:59:48,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-14 18:59:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 304 states have (on average 1.8782894736842106) internal successors, (571), 520 states have internal predecessors, (571), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 18:59:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 597 transitions. [2024-10-14 18:59:48,221 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 597 transitions. Word has length 46 [2024-10-14 18:59:48,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:48,221 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 597 transitions. [2024-10-14 18:59:48,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 597 transitions. [2024-10-14 18:59:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 18:59:48,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:48,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:59:48,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 18:59:48,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:48,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:48,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash 755145577, now seen corresponding path program 1 times [2024-10-14 18:59:48,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:48,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242667720] [2024-10-14 18:59:48,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:48,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:48,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:48,430 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:48,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 18:59:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:48,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 18:59:48,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:48,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:59:48,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 18:59:49,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:59:49,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 18:59:49,269 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 18:59:49,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 18:59:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:49,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:59:49,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:49,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242667720] [2024-10-14 18:59:49,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242667720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:59:49,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:59:49,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 18:59:49,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172553979] [2024-10-14 18:59:49,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:59:49,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:59:49,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:49,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:59:49,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:59:49,291 INFO L87 Difference]: Start difference. First operand 526 states and 597 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:50,141 INFO L93 Difference]: Finished difference Result 488 states and 559 transitions. [2024-10-14 18:59:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:59:50,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-14 18:59:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:50,148 INFO L225 Difference]: With dead ends: 488 [2024-10-14 18:59:50,148 INFO L226 Difference]: Without dead ends: 488 [2024-10-14 18:59:50,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:59:50,149 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 331 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:50,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 243 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 18:59:50,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-14 18:59:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 461. [2024-10-14 18:59:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 277 states have (on average 1.6931407942238268) internal successors, (469), 455 states have internal predecessors, (469), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 18:59:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 495 transitions. [2024-10-14 18:59:50,164 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 495 transitions. Word has length 49 [2024-10-14 18:59:50,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:50,164 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 495 transitions. [2024-10-14 18:59:50,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 495 transitions. [2024-10-14 18:59:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 18:59:50,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:59:50,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 18:59:50,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:50,367 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:50,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:50,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1764703016, now seen corresponding path program 1 times [2024-10-14 18:59:50,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:50,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505536082] [2024-10-14 18:59:50,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:50,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-14 18:59:50,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:50,371 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:50,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 18:59:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:50,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 18:59:50,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:50,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 18:59:50,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 18:59:50,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 18:59:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:50,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:59:50,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:50,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505536082] [2024-10-14 18:59:50,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505536082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:59:50,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:59:50,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:59:50,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976991891] [2024-10-14 18:59:50,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:59:50,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:59:50,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:50,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:59:50,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:59:50,659 INFO L87 Difference]: Start difference. First operand 461 states and 495 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:51,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:51,898 INFO L93 Difference]: Finished difference Result 460 states and 494 transitions. [2024-10-14 18:59:51,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:59:51,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 18:59:51,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:51,902 INFO L225 Difference]: With dead ends: 460 [2024-10-14 18:59:51,902 INFO L226 Difference]: Without dead ends: 460 [2024-10-14 18:59:51,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:59:51,903 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 2 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:51,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1051 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 18:59:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-14 18:59:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2024-10-14 18:59:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 277 states have (on average 1.6895306859205776) internal successors, (468), 454 states have internal predecessors, (468), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 18:59:51,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 494 transitions. [2024-10-14 18:59:51,912 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 494 transitions. Word has length 53 [2024-10-14 18:59:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:51,912 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 494 transitions. [2024-10-14 18:59:51,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 494 transitions. [2024-10-14 18:59:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 18:59:51,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:51,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:59:51,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 18:59:52,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:52,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:52,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:52,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1764703015, now seen corresponding path program 1 times [2024-10-14 18:59:52,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:52,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369686299] [2024-10-14 18:59:52,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:52,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:52,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:52,117 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:52,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 18:59:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:52,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 18:59:52,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:52,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:59:52,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 18:59:52,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 18:59:52,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 18:59:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:52,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:59:52,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:52,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369686299] [2024-10-14 18:59:52,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369686299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:59:52,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:59:52,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:59:52,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774008632] [2024-10-14 18:59:52,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:59:52,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:59:52,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:52,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:59:52,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:59:52,409 INFO L87 Difference]: Start difference. First operand 460 states and 494 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:53,624 INFO L93 Difference]: Finished difference Result 459 states and 493 transitions. [2024-10-14 18:59:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:59:53,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 18:59:53,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:53,628 INFO L225 Difference]: With dead ends: 459 [2024-10-14 18:59:53,629 INFO L226 Difference]: Without dead ends: 459 [2024-10-14 18:59:53,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:59:53,629 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 1 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:53,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1058 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 18:59:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-14 18:59:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2024-10-14 18:59:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 276 states have (on average 1.6920289855072463) internal successors, (467), 453 states have internal predecessors, (467), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-14 18:59:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 493 transitions. [2024-10-14 18:59:53,639 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 493 transitions. Word has length 53 [2024-10-14 18:59:53,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:53,639 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 493 transitions. [2024-10-14 18:59:53,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:59:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 493 transitions. [2024-10-14 18:59:53,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 18:59:53,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:53,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:59:53,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 18:59:53,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:53,842 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:53,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:53,842 INFO L85 PathProgramCache]: Analyzing trace with hash -783569796, now seen corresponding path program 1 times [2024-10-14 18:59:53,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:53,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854287913] [2024-10-14 18:59:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:53,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:53,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:53,844 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:53,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 18:59:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:54,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 18:59:54,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:54,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:59:54,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:54,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854287913] [2024-10-14 18:59:54,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854287913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:59:54,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:59:54,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:59:54,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260919671] [2024-10-14 18:59:54,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:59:54,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:59:54,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:54,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:59:54,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:59:54,070 INFO L87 Difference]: Start difference. First operand 459 states and 493 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:59:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:54,496 INFO L93 Difference]: Finished difference Result 461 states and 496 transitions. [2024-10-14 18:59:54,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:59:54,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-10-14 18:59:54,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:54,500 INFO L225 Difference]: With dead ends: 461 [2024-10-14 18:59:54,500 INFO L226 Difference]: Without dead ends: 461 [2024-10-14 18:59:54,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:59:54,501 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 0 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:54,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1179 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:59:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-10-14 18:59:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2024-10-14 18:59:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 277 states have (on average 1.6931407942238268) internal successors, (469), 455 states have internal predecessors, (469), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 18:59:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 496 transitions. [2024-10-14 18:59:54,510 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 496 transitions. Word has length 59 [2024-10-14 18:59:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:54,511 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 496 transitions. [2024-10-14 18:59:54,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 18:59:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 496 transitions. [2024-10-14 18:59:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 18:59:54,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:54,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:59:54,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-14 18:59:54,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:54,712 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:54,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:54,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1928290017, now seen corresponding path program 1 times [2024-10-14 18:59:54,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:54,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310605367] [2024-10-14 18:59:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:59:54,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:54,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:54,715 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:54,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 18:59:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:59:54,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:59:54,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:54,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:59:55,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:55,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:55,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310605367] [2024-10-14 18:59:55,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310605367] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:59:55,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:59:55,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 18:59:55,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079592438] [2024-10-14 18:59:55,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:59:55,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:59:55,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:55,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:59:55,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 18:59:55,018 INFO L87 Difference]: Start difference. First operand 461 states and 496 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:59:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:55,670 INFO L93 Difference]: Finished difference Result 470 states and 510 transitions. [2024-10-14 18:59:55,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 18:59:55,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2024-10-14 18:59:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:55,674 INFO L225 Difference]: With dead ends: 470 [2024-10-14 18:59:55,674 INFO L226 Difference]: Without dead ends: 470 [2024-10-14 18:59:55,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 18:59:55,675 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 5 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:55,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1568 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 18:59:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-14 18:59:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2024-10-14 18:59:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 284 states have (on average 1.6971830985915493) internal successors, (482), 462 states have internal predecessors, (482), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 18:59:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 509 transitions. [2024-10-14 18:59:55,693 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 509 transitions. Word has length 60 [2024-10-14 18:59:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:55,693 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 509 transitions. [2024-10-14 18:59:55,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:59:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 509 transitions. [2024-10-14 18:59:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 18:59:55,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:55,695 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:59:55,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-14 18:59:55,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:55,895 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:55,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:55,896 INFO L85 PathProgramCache]: Analyzing trace with hash -170418756, now seen corresponding path program 2 times [2024-10-14 18:59:55,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:55,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489947063] [2024-10-14 18:59:55,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:59:55,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:55,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:55,897 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:55,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 18:59:56,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 18:59:56,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:59:56,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 18:59:56,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:56,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:59:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:56,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:56,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489947063] [2024-10-14 18:59:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489947063] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:59:56,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:59:56,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 18:59:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813307763] [2024-10-14 18:59:56,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:59:56,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 18:59:56,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:56,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 18:59:56,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 18:59:56,518 INFO L87 Difference]: Start difference. First operand 469 states and 509 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:59:57,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:59:57,678 INFO L93 Difference]: Finished difference Result 481 states and 528 transitions. [2024-10-14 18:59:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 18:59:57,680 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2024-10-14 18:59:57,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:59:57,682 INFO L225 Difference]: With dead ends: 481 [2024-10-14 18:59:57,682 INFO L226 Difference]: Without dead ends: 479 [2024-10-14 18:59:57,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 18:59:57,683 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 8 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:59:57,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2744 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 18:59:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-14 18:59:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 478. [2024-10-14 18:59:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 293 states have (on average 1.6860068259385665) internal successors, (494), 471 states have internal predecessors, (494), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 18:59:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 521 transitions. [2024-10-14 18:59:57,693 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 521 transitions. Word has length 63 [2024-10-14 18:59:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:59:57,694 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 521 transitions. [2024-10-14 18:59:57,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:59:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 521 transitions. [2024-10-14 18:59:57,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 18:59:57,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:59:57,695 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:59:57,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-14 18:59:57,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:57,895 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 18:59:57,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:59:57,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2126027676, now seen corresponding path program 3 times [2024-10-14 18:59:57,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:59:57,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550777355] [2024-10-14 18:59:57,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 18:59:57,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:59:57,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:59:57,898 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 18:59:57,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 18:59:58,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 18:59:58,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:59:58,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 18:59:58,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:59:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:58,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:59:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:59:59,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:59:59,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550777355] [2024-10-14 18:59:59,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550777355] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:59:59,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:59:59,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 18:59:59,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913871945] [2024-10-14 18:59:59,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:59:59,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 18:59:59,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:59:59,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 18:59:59,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 18:59:59,100 INFO L87 Difference]: Start difference. First operand 478 states and 521 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:00:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:00:01,716 INFO L93 Difference]: Finished difference Result 499 states and 557 transitions. [2024-10-14 19:00:01,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 19:00:01,716 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2024-10-14 19:00:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:00:01,718 INFO L225 Difference]: With dead ends: 499 [2024-10-14 19:00:01,718 INFO L226 Difference]: Without dead ends: 496 [2024-10-14 19:00:01,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 19:00:01,719 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 14 mSDsluCounter, 4310 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4703 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:00:01,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4703 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:00:01,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-14 19:00:01,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2024-10-14 19:00:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 311 states have (on average 1.662379421221865) internal successors, (517), 489 states have internal predecessors, (517), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:00:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 544 transitions. [2024-10-14 19:00:01,728 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 544 transitions. Word has length 69 [2024-10-14 19:00:01,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:00:01,729 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 544 transitions. [2024-10-14 19:00:01,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:00:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 544 transitions. [2024-10-14 19:00:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 19:00:01,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:00:01,730 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:00:01,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-14 19:00:01,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:00:01,931 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 19:00:01,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:00:01,931 INFO L85 PathProgramCache]: Analyzing trace with hash 445570908, now seen corresponding path program 4 times [2024-10-14 19:00:01,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:00:01,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642343992] [2024-10-14 19:00:01,932 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:00:01,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:00:01,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:00:01,933 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:00:01,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-14 19:00:02,336 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:00:02,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:00:02,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 19:00:02,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:00:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:00:02,701 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:00:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:00:03,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:00:03,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642343992] [2024-10-14 19:00:03,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642343992] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:00:03,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:00:03,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 19:00:03,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923873531] [2024-10-14 19:00:03,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:00:03,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 19:00:03,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:00:03,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 19:00:03,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 19:00:03,914 INFO L87 Difference]: Start difference. First operand 496 states and 544 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:00:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:00:10,882 INFO L93 Difference]: Finished difference Result 533 states and 613 transitions. [2024-10-14 19:00:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 19:00:10,883 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-10-14 19:00:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:00:10,885 INFO L225 Difference]: With dead ends: 533 [2024-10-14 19:00:10,885 INFO L226 Difference]: Without dead ends: 531 [2024-10-14 19:00:10,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 19:00:10,888 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 26 mSDsluCounter, 9407 mSDsCounter, 0 mSdLazyCounter, 3181 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9800 SdHoareTripleChecker+Invalid, 3243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:00:10,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9800 Invalid, 3243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 3181 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-14 19:00:10,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-14 19:00:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 530. [2024-10-14 19:00:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 345 states have (on average 1.6318840579710145) internal successors, (563), 523 states have internal predecessors, (563), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-14 19:00:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 590 transitions. [2024-10-14 19:00:10,898 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 590 transitions. Word has length 81 [2024-10-14 19:00:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:00:10,898 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 590 transitions. [2024-10-14 19:00:10,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:00:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 590 transitions. [2024-10-14 19:00:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 19:00:10,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:00:10,900 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:00:10,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-14 19:00:11,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:00:11,101 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2024-10-14 19:00:11,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:00:11,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1525066300, now seen corresponding path program 5 times [2024-10-14 19:00:11,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:00:11,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668171411] [2024-10-14 19:00:11,102 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:00:11,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:00:11,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:00:11,103 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:00:11,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-14 19:00:12,283 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:00:12,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:00:12,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-14 19:00:12,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:00:12,338 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-14 19:00:12,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-10-14 19:00:12,765 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-10-14 19:00:12,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-10-14 19:00:12,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:00:13,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2024-10-14 19:00:15,682 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 19:00:15,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-10-14 19:00:15,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2024-10-14 19:00:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-14 19:00:15,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:00:16,181 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem32#1.base| v_ArrVal_1648) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2024-10-14 19:00:16,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:00:16,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668171411] [2024-10-14 19:00:16,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668171411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:00:16,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1918013076] [2024-10-14 19:00:16,185 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:00:16,185 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 19:00:16,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 19:00:16,189 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 19:00:16,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-10-14 19:00:16,689 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:00:16,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:00:16,736 WARN L253 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 596 conjuncts are in the unsatisfiable core [2024-10-14 19:00:16,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:00:16,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 5 [2024-10-14 19:00:16,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:00:16,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2024-10-14 19:00:16,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:00:16,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 69 [2024-10-14 19:00:33,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 82341 treesize of output 82373 [2024-10-14 19:00:34,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:00:34,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1