./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e19ca921 Calling Ultimate with: /usr/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 ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:33:06,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:33:06,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:33:06,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:33:06,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:33:06,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:33:06,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:33:06,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:33:06,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:33:06,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:33:06,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:33:06,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:33:06,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:33:06,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:33:06,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:33:06,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:33:06,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:33:06,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:33:06,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:33:06,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:33:06,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:33:06,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:33:06,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:33:06,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:33:06,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:33:06,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:33:06,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:33:06,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:33:06,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:33:06,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:33:06,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:33:06,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:33:06,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:33:06,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:33:06,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:33:06,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:33:06,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:33:06,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:33:06,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:33:06,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:33:06,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:33:06,756 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 16:33:06,782 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:33:06,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:33:06,783 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:33:06,783 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:33:06,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:33:06,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:33:06,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:33:06,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:33:06,785 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:33:06,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:33:06,786 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 16:33:06,786 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 16:33:06,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:33:06,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 16:33:06,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:33:06,786 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 16:33:06,786 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 16:33:06,787 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 16:33:06,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:33:06,787 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 16:33:06,787 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 16:33:06,787 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:33:06,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:33:06,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:33:06,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:33:06,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:33:06,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:33:06,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:33:06,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 16:33:06,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 16:33:06,788 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:33:06,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2021-12-22 16:33:06,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:33:06,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:33:07,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:33:07,001 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:33:07,001 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:33:07,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2021-12-22 16:33:07,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3139eeb7/d263ec737788425697e38bdf0ebb7195/FLAGa752570fe [2021-12-22 16:33:07,428 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:33:07,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2021-12-22 16:33:07,443 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3139eeb7/d263ec737788425697e38bdf0ebb7195/FLAGa752570fe [2021-12-22 16:33:07,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3139eeb7/d263ec737788425697e38bdf0ebb7195 [2021-12-22 16:33:07,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:33:07,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:33:07,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:33:07,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:33:07,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:33:07,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:33:07" (1/1) ... [2021-12-22 16:33:07,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ee5e3a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:07, skipping insertion in model container [2021-12-22 16:33:07,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:33:07" (1/1) ... [2021-12-22 16:33:07,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:33:07,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:33:08,135 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:33:08,140 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-22 16:33:08,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4ac9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:08, skipping insertion in model container [2021-12-22 16:33:08,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:33:08,141 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-22 16:33:08,142 INFO L158 Benchmark]: Toolchain (without parser) took 351.42ms. Allocated memory is still 104.9MB. Free memory was 73.0MB in the beginning and 80.5MB in the end (delta: -7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 16:33:08,143 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 79.7MB. Free memory was 40.0MB in the beginning and 40.0MB in the end (delta: 36.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 16:33:08,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.19ms. Allocated memory is still 104.9MB. Free memory was 72.8MB in the beginning and 80.5MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 16:33:08,144 INFO L339 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 79.7MB. Free memory was 40.0MB in the beginning and 40.0MB in the end (delta: 36.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.19ms. Allocated memory is still 104.9MB. Free memory was 72.8MB in the beginning and 80.5MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 555]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type 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: /usr/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 ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:33:10,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:33:10,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:33:10,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:33:10,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:33:10,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:33:10,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:33:10,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:33:10,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:33:10,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:33:10,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:33:10,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:33:10,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:33:10,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:33:10,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:33:10,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:33:10,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:33:10,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:33:10,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:33:10,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:33:10,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:33:10,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:33:10,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:33:10,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:33:10,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:33:10,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:33:10,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:33:10,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:33:10,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:33:10,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:33:10,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:33:10,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:33:10,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:33:10,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:33:10,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:33:10,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:33:10,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:33:10,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:33:10,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:33:10,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:33:10,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:33:10,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-22 16:33:10,200 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:33:10,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:33:10,201 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:33:10,201 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:33:10,203 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:33:10,203 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:33:10,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:33:10,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:33:10,205 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:33:10,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:33:10,206 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 16:33:10,206 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 16:33:10,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:33:10,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 16:33:10,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:33:10,206 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 16:33:10,206 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 16:33:10,207 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 16:33:10,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:33:10,207 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 16:33:10,207 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-22 16:33:10,207 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-22 16:33:10,207 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 16:33:10,207 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:33:10,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:33:10,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:33:10,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:33:10,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:33:10,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:33:10,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:33:10,208 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-22 16:33:10,209 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-22 16:33:10,209 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:33:10,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-22 16:33:10,209 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2021-12-22 16:33:10,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:33:10,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:33:10,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:33:10,429 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:33:10,430 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:33:10,431 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2021-12-22 16:33:10,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13365334f/a96306f4e01f428c93128059a5193fdd/FLAG7b519957f [2021-12-22 16:33:10,963 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:33:10,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2021-12-22 16:33:10,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13365334f/a96306f4e01f428c93128059a5193fdd/FLAG7b519957f [2021-12-22 16:33:11,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13365334f/a96306f4e01f428c93128059a5193fdd [2021-12-22 16:33:11,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:33:11,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:33:11,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:33:11,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:33:11,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:33:11,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:33:11" (1/1) ... [2021-12-22 16:33:11,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d78163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:11, skipping insertion in model container [2021-12-22 16:33:11,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:33:11" (1/1) ... [2021-12-22 16:33:11,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:33:11,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:33:11,501 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:33:11,510 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-22 16:33:11,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:33:11,542 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:33:11,557 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:33:11,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:33:11,614 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:33:11,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:11 WrapperNode [2021-12-22 16:33:11,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:33:11,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:33:11,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:33:11,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:33:11,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:11" (1/1) ... [2021-12-22 16:33:11,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:11" (1/1) ... [2021-12-22 16:33:11,650 INFO L137 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2021-12-22 16:33:11,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:33:11,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:33:11,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:33:11,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:33:11,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:11" (1/1) ... [2021-12-22 16:33:11,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:11" (1/1) ... [2021-12-22 16:33:11,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:11" (1/1) ... [2021-12-22 16:33:11,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:11" (1/1) ... [2021-12-22 16:33:11,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:11" (1/1) ... [2021-12-22 16:33:11,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:11" (1/1) ... [2021-12-22 16:33:11,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:11" (1/1) ... [2021-12-22 16:33:11,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:33:11,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:33:11,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:33:11,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:33:11,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:11" (1/1) ... [2021-12-22 16:33:11,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:33:11,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:33:11,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 16:33:11,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 16:33:11,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 16:33:11,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 16:33:11,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 16:33:11,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 16:33:11,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 16:33:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:33:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-22 16:33:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-22 16:33:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-22 16:33:11,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:33:11,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:33:11,833 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:33:11,834 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:33:12,229 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:33:12,234 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:33:12,235 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-22 16:33:12,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:33:12 BoogieIcfgContainer [2021-12-22 16:33:12,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:33:12,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:33:12,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:33:12,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:33:12,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:33:11" (1/3) ... [2021-12-22 16:33:12,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26607ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:33:12, skipping insertion in model container [2021-12-22 16:33:12,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:11" (2/3) ... [2021-12-22 16:33:12,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26607ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:33:12, skipping insertion in model container [2021-12-22 16:33:12,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:33:12" (3/3) ... [2021-12-22 16:33:12,241 INFO L111 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2021-12-22 16:33:12,244 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:33:12,254 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2021-12-22 16:33:12,288 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:33:12,292 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 16:33:12,292 INFO L340 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2021-12-22 16:33:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-22 16:33:12,305 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:12,306 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-22 16:33:12,306 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:12,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:12,309 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2021-12-22 16:33:12,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:12,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956160379] [2021-12-22 16:33:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:12,317 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:12,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:12,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:12,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-22 16:33:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:12,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 16:33:12,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:12,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:12,457 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-22 16:33:12,457 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 17 [2021-12-22 16:33:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:12,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:12,472 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:12,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956160379] [2021-12-22 16:33:12,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956160379] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:12,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:12,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:33:12,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887508024] [2021-12-22 16:33:12,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:12,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:33:12,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:33:12,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:33:12,494 INFO L87 Difference]: Start difference. First operand has 98 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2021-12-22 16:33:12,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:12,738 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2021-12-22 16:33:12,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:33:12,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 [2021-12-22 16:33:12,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:12,746 INFO L225 Difference]: With dead ends: 148 [2021-12-22 16:33:12,747 INFO L226 Difference]: Without dead ends: 146 [2021-12-22 16:33:12,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:33:12,750 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 209 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:12,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 94 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:33:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-22 16:33:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 93. [2021-12-22 16:33:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 92 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2021-12-22 16:33:12,787 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 4 [2021-12-22 16:33:12,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:12,788 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2021-12-22 16:33:12,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2021-12-22 16:33:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2021-12-22 16:33:12,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-22 16:33:12,788 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:12,788 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-22 16:33:12,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:12,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:12,995 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:12,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2021-12-22 16:33:12,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:13,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612244120] [2021-12-22 16:33:13,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:13,006 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:13,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:13,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:13,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-22 16:33:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:13,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 16:33:13,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:13,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:13,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:13,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:33:13,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2021-12-22 16:33:13,135 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:33:13,136 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2021-12-22 16:33:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:13,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:13,150 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:13,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612244120] [2021-12-22 16:33:13,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612244120] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:13,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:13,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:33:13,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810213532] [2021-12-22 16:33:13,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:13,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:33:13,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:13,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:33:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:33:13,152 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2021-12-22 16:33:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:13,433 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2021-12-22 16:33:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:33:13,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 [2021-12-22 16:33:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:13,435 INFO L225 Difference]: With dead ends: 236 [2021-12-22 16:33:13,435 INFO L226 Difference]: Without dead ends: 236 [2021-12-22 16:33:13,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:33:13,436 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 235 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:13,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 97 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:33:13,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-12-22 16:33:13,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 107. [2021-12-22 16:33:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 106 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2021-12-22 16:33:13,447 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 4 [2021-12-22 16:33:13,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:13,447 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2021-12-22 16:33:13,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2021-12-22 16:33:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2021-12-22 16:33:13,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-22 16:33:13,448 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:13,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-22 16:33:13,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:13,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:13,655 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2021-12-22 16:33:13,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:13,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897232189] [2021-12-22 16:33:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:13,658 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:13,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:13,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:13,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-22 16:33:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:13,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 16:33:13,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:13,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:13,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:13,716 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:13,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897232189] [2021-12-22 16:33:13,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897232189] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:13,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:13,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:33:13,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061429291] [2021-12-22 16:33:13,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:13,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:33:13,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:13,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:33:13,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:33:13,718 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:13,836 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2021-12-22 16:33:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:33:13,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-22 16:33:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:13,837 INFO L225 Difference]: With dead ends: 136 [2021-12-22 16:33:13,837 INFO L226 Difference]: Without dead ends: 136 [2021-12-22 16:33:13,837 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:33:13,838 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 75 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:13,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 87 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:33:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-22 16:33:13,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2021-12-22 16:33:13,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2021-12-22 16:33:13,843 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 5 [2021-12-22 16:33:13,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:13,843 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2021-12-22 16:33:13,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:13,843 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2021-12-22 16:33:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-22 16:33:13,844 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:13,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-22 16:33:13,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:14,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:14,051 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:14,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2021-12-22 16:33:14,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:14,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143979919] [2021-12-22 16:33:14,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:14,053 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:14,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:14,068 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:14,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-22 16:33:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:14,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 16:33:14,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:14,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:14,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:14,153 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:14,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143979919] [2021-12-22 16:33:14,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143979919] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:14,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:14,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:33:14,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883572176] [2021-12-22 16:33:14,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:14,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:33:14,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:14,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:33:14,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:33:14,156 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:14,302 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2021-12-22 16:33:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:33:14,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-22 16:33:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:14,303 INFO L225 Difference]: With dead ends: 180 [2021-12-22 16:33:14,303 INFO L226 Difference]: Without dead ends: 180 [2021-12-22 16:33:14,303 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:33:14,304 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 72 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:14,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 114 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:33:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-22 16:33:14,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 108. [2021-12-22 16:33:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.732394366197183) internal successors, (123), 107 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2021-12-22 16:33:14,308 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 5 [2021-12-22 16:33:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:14,308 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2021-12-22 16:33:14,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2021-12-22 16:33:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-22 16:33:14,309 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:14,309 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:14,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:14,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:14,516 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:14,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:14,516 INFO L85 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2021-12-22 16:33:14,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:14,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115011436] [2021-12-22 16:33:14,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:14,517 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:14,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:14,518 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:14,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-22 16:33:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:14,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 16:33:14,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:14,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:14,690 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-22 16:33:14,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 17 [2021-12-22 16:33:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:14,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:14,706 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:14,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115011436] [2021-12-22 16:33:14,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115011436] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:14,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:14,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:33:14,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905818348] [2021-12-22 16:33:14,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:14,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:33:14,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:14,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:33:14,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:33:14,707 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:14,851 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2021-12-22 16:33:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:33:14,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-12-22 16:33:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:14,853 INFO L225 Difference]: With dead ends: 151 [2021-12-22 16:33:14,853 INFO L226 Difference]: Without dead ends: 151 [2021-12-22 16:33:14,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:33:14,853 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 69 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:14,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 144 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:33:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-22 16:33:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 104. [2021-12-22 16:33:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2021-12-22 16:33:14,857 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 9 [2021-12-22 16:33:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:14,857 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2021-12-22 16:33:14,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2021-12-22 16:33:14,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-22 16:33:14,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:14,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:14,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:15,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:15,069 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:15,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:15,069 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2021-12-22 16:33:15,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:15,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860348642] [2021-12-22 16:33:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:15,070 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:15,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:15,074 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:15,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-22 16:33:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:15,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 16:33:15,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:15,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:15,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:15,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:33:15,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 14 [2021-12-22 16:33:15,206 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:33:15,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2021-12-22 16:33:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:15,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:15,216 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:15,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860348642] [2021-12-22 16:33:15,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860348642] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:15,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:15,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:33:15,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25769173] [2021-12-22 16:33:15,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:15,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:33:15,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:15,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:33:15,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:33:15,218 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:15,489 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2021-12-22 16:33:15,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:33:15,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-12-22 16:33:15,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:15,490 INFO L225 Difference]: With dead ends: 200 [2021-12-22 16:33:15,490 INFO L226 Difference]: Without dead ends: 200 [2021-12-22 16:33:15,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:33:15,491 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 183 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:15,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 166 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:33:15,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-22 16:33:15,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 100. [2021-12-22 16:33:15,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.591549295774648) internal successors, (113), 99 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2021-12-22 16:33:15,494 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 9 [2021-12-22 16:33:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:15,495 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2021-12-22 16:33:15,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2021-12-22 16:33:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-22 16:33:15,495 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:15,495 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:15,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:15,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:15,703 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:15,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:15,703 INFO L85 PathProgramCache]: Analyzing trace with hash 184732728, now seen corresponding path program 1 times [2021-12-22 16:33:15,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:15,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411241680] [2021-12-22 16:33:15,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:15,704 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:15,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:15,705 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:15,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-22 16:33:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:15,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 16:33:15,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:15,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:15,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:15,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:15,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:15,828 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:15,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411241680] [2021-12-22 16:33:15,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411241680] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:15,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:15,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:33:15,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435270804] [2021-12-22 16:33:15,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:15,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:33:15,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:15,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:33:15,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:33:15,830 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:16,057 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2021-12-22 16:33:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:33:16,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-22 16:33:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:16,058 INFO L225 Difference]: With dead ends: 109 [2021-12-22 16:33:16,059 INFO L226 Difference]: Without dead ends: 109 [2021-12-22 16:33:16,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:33:16,059 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:16,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 216 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:33:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-22 16:33:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2021-12-22 16:33:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2021-12-22 16:33:16,062 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 13 [2021-12-22 16:33:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:16,062 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2021-12-22 16:33:16,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2021-12-22 16:33:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-22 16:33:16,063 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:16,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:16,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:16,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:16,271 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:16,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash 184732729, now seen corresponding path program 1 times [2021-12-22 16:33:16,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:16,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643720848] [2021-12-22 16:33:16,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:16,272 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:16,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:16,273 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:16,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-22 16:33:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:16,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-22 16:33:16,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:16,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:16,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:16,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:16,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:16,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-22 16:33:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:16,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:16,466 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:16,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643720848] [2021-12-22 16:33:16,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643720848] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:16,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:16,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:33:16,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528361776] [2021-12-22 16:33:16,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:16,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:33:16,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:16,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:33:16,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:33:16,468 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:16,723 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2021-12-22 16:33:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:33:16,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-22 16:33:16,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:16,724 INFO L225 Difference]: With dead ends: 104 [2021-12-22 16:33:16,724 INFO L226 Difference]: Without dead ends: 104 [2021-12-22 16:33:16,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:33:16,725 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:16,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 218 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:33:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-22 16:33:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2021-12-22 16:33:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2021-12-22 16:33:16,728 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 13 [2021-12-22 16:33:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:16,728 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2021-12-22 16:33:16,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2021-12-22 16:33:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 16:33:16,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:16,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:16,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:16,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:16,936 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:16,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:16,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1897191059, now seen corresponding path program 1 times [2021-12-22 16:33:16,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:16,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432188611] [2021-12-22 16:33:16,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:16,937 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:16,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:16,947 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:16,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-22 16:33:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:17,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 16:33:17,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:17,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:33:17,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 16 [2021-12-22 16:33:17,131 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:33:17,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 12 [2021-12-22 16:33:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:17,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:17,191 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:17,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432188611] [2021-12-22 16:33:17,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432188611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:17,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:17,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:33:17,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125253585] [2021-12-22 16:33:17,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:17,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:33:17,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:33:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:33:17,194 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:17,366 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2021-12-22 16:33:17,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:33:17,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-22 16:33:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:17,367 INFO L225 Difference]: With dead ends: 133 [2021-12-22 16:33:17,367 INFO L226 Difference]: Without dead ends: 133 [2021-12-22 16:33:17,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:33:17,368 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 411 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:17,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 65 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:33:17,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-22 16:33:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2021-12-22 16:33:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 97 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2021-12-22 16:33:17,370 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 15 [2021-12-22 16:33:17,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:17,371 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2021-12-22 16:33:17,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:17,371 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2021-12-22 16:33:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-22 16:33:17,371 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:17,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:17,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:17,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:17,572 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:17,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash -734113802, now seen corresponding path program 1 times [2021-12-22 16:33:17,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:17,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094849617] [2021-12-22 16:33:17,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:17,572 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:17,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:17,574 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:17,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-22 16:33:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:17,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 16:33:17,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:17,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-12-22 16:33:17,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-22 16:33:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:17,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:17,753 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:17,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094849617] [2021-12-22 16:33:17,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094849617] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:17,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:17,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:33:17,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762759257] [2021-12-22 16:33:17,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:17,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:33:17,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:17,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:33:17,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:33:17,754 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:17,925 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2021-12-22 16:33:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:33:17,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-22 16:33:17,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:17,926 INFO L225 Difference]: With dead ends: 137 [2021-12-22 16:33:17,927 INFO L226 Difference]: Without dead ends: 137 [2021-12-22 16:33:17,927 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:33:17,927 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 164 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:17,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 174 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:33:17,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-22 16:33:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 98. [2021-12-22 16:33:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2021-12-22 16:33:17,930 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 17 [2021-12-22 16:33:17,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:17,930 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2021-12-22 16:33:17,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:17,930 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2021-12-22 16:33:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-22 16:33:17,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:17,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:17,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:18,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:18,137 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:18,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:18,138 INFO L85 PathProgramCache]: Analyzing trace with hash -734113798, now seen corresponding path program 1 times [2021-12-22 16:33:18,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:18,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355978436] [2021-12-22 16:33:18,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:18,138 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:18,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:18,139 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:18,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-22 16:33:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:18,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-22 16:33:18,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:18,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:18,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:33:18,326 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-22 16:33:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:18,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:18,333 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:18,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355978436] [2021-12-22 16:33:18,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355978436] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:18,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:18,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:33:18,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112924379] [2021-12-22 16:33:18,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:18,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:33:18,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:18,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:33:18,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:33:18,334 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:18,582 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2021-12-22 16:33:18,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:33:18,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-22 16:33:18,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:18,583 INFO L225 Difference]: With dead ends: 129 [2021-12-22 16:33:18,583 INFO L226 Difference]: Without dead ends: 129 [2021-12-22 16:33:18,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:33:18,584 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 97 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:18,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 158 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:33:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-22 16:33:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 98. [2021-12-22 16:33:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 97 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2021-12-22 16:33:18,586 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 17 [2021-12-22 16:33:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:18,586 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2021-12-22 16:33:18,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:18,586 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2021-12-22 16:33:18,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-22 16:33:18,586 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:18,586 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:18,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:18,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:18,787 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:18,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:18,787 INFO L85 PathProgramCache]: Analyzing trace with hash -734113797, now seen corresponding path program 1 times [2021-12-22 16:33:18,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:18,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701479314] [2021-12-22 16:33:18,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:18,788 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:18,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:18,789 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:18,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-22 16:33:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:18,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-22 16:33:18,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:18,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:18,979 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:33:18,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:33:19,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-22 16:33:19,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-22 16:33:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:19,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:19,059 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:19,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701479314] [2021-12-22 16:33:19,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701479314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:19,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:19,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:33:19,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408759726] [2021-12-22 16:33:19,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:19,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:33:19,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:19,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:33:19,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:33:19,060 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:19,411 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2021-12-22 16:33:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:33:19,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-22 16:33:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:19,412 INFO L225 Difference]: With dead ends: 201 [2021-12-22 16:33:19,412 INFO L226 Difference]: Without dead ends: 201 [2021-12-22 16:33:19,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:33:19,413 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 148 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:19,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 221 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:33:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-12-22 16:33:19,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 106. [2021-12-22 16:33:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2021-12-22 16:33:19,415 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 17 [2021-12-22 16:33:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:19,415 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2021-12-22 16:33:19,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2021-12-22 16:33:19,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-22 16:33:19,416 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:19,416 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:19,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:19,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:19,624 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash 50233868, now seen corresponding path program 1 times [2021-12-22 16:33:19,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:19,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824323208] [2021-12-22 16:33:19,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:19,625 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:19,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:19,632 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:19,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-22 16:33:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:19,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 16:33:19,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:19,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:19,788 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-22 16:33:19,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2021-12-22 16:33:19,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-22 16:33:19,888 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:33:19,889 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2021-12-22 16:33:19,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-22 16:33:19,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 16:33:19,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:33:20,038 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2021-12-22 16:33:20,064 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:33:20,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-22 16:33:20,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2021-12-22 16:33:20,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 16:33:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-22 16:33:24,547 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:24,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824323208] [2021-12-22 16:33:24,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824323208] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:33:24,548 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 16:33:24,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2021-12-22 16:33:24,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561288765] [2021-12-22 16:33:24,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 16:33:24,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 16:33:24,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:24,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 16:33:24,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=95, Unknown=3, NotChecked=20, Total=156 [2021-12-22 16:33:24,548 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:24,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:24,867 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2021-12-22 16:33:24,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:33:24,868 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-22 16:33:24,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:24,868 INFO L225 Difference]: With dead ends: 154 [2021-12-22 16:33:24,868 INFO L226 Difference]: Without dead ends: 154 [2021-12-22 16:33:24,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=46, Invalid=111, Unknown=3, NotChecked=22, Total=182 [2021-12-22 16:33:24,869 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 78 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:24,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 562 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 225 Invalid, 0 Unknown, 330 Unchecked, 0.3s Time] [2021-12-22 16:33:24,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-22 16:33:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 105. [2021-12-22 16:33:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.5) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2021-12-22 16:33:24,871 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 18 [2021-12-22 16:33:24,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:24,871 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2021-12-22 16:33:24,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2021-12-22 16:33:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-22 16:33:24,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:24,872 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:24,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:25,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:25,080 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:25,080 INFO L85 PathProgramCache]: Analyzing trace with hash 50233869, now seen corresponding path program 1 times [2021-12-22 16:33:25,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:25,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259914130] [2021-12-22 16:33:25,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:25,081 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:25,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:25,082 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:25,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-22 16:33:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:25,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-22 16:33:25,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:25,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:25,207 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:33:25,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2021-12-22 16:33:25,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:33:25,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:25,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-22 16:33:25,350 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:33:25,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-22 16:33:25,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-22 16:33:25,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-22 16:33:25,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-22 16:33:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:25,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:33:25,802 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse1 (_ bv4 32) .cse2) (bvadd .cse1 (_ bv8 32) .cse2))))) is different from false [2021-12-22 16:33:25,843 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))) is different from false [2021-12-22 16:33:25,911 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2021-12-22 16:33:25,952 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:33:25,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2021-12-22 16:33:25,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2021-12-22 16:33:25,958 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-12-22 16:33:25,981 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:33:25,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2021-12-22 16:33:25,992 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:33:25,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-22 16:33:26,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:33:26,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-12-22 16:33:26,015 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:33:26,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-22 16:33:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-22 16:33:26,077 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:26,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259914130] [2021-12-22 16:33:26,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259914130] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:33:26,078 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 16:33:26,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2021-12-22 16:33:26,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137020663] [2021-12-22 16:33:26,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 16:33:26,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-22 16:33:26,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:26,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-22 16:33:26,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=124, Unknown=3, NotChecked=72, Total=240 [2021-12-22 16:33:26,078 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:27,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:27,989 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2021-12-22 16:33:27,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 16:33:27,989 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-22 16:33:27,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:27,990 INFO L225 Difference]: With dead ends: 160 [2021-12-22 16:33:27,990 INFO L226 Difference]: Without dead ends: 160 [2021-12-22 16:33:27,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=92, Invalid=297, Unknown=3, NotChecked=114, Total=506 [2021-12-22 16:33:27,991 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 80 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:27,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 683 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 475 Invalid, 0 Unknown, 303 Unchecked, 1.3s Time] [2021-12-22 16:33:27,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-22 16:33:27,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 110. [2021-12-22 16:33:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 109 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2021-12-22 16:33:27,993 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 18 [2021-12-22 16:33:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:27,993 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2021-12-22 16:33:27,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2021-12-22 16:33:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 16:33:27,994 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:27,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:28,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:28,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:28,200 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:28,200 INFO L85 PathProgramCache]: Analyzing trace with hash -10622392, now seen corresponding path program 1 times [2021-12-22 16:33:28,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:28,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70924587] [2021-12-22 16:33:28,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:28,200 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:28,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:28,202 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:28,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-22 16:33:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:28,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-22 16:33:28,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:28,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:28,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:33:28,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-22 16:33:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:28,377 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:28,377 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:28,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70924587] [2021-12-22 16:33:28,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [70924587] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:28,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:28,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:33:28,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589695745] [2021-12-22 16:33:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:28,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:33:28,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:28,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:33:28,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:33:28,378 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:28,604 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2021-12-22 16:33:28,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:33:28,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-22 16:33:28,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:28,605 INFO L225 Difference]: With dead ends: 146 [2021-12-22 16:33:28,605 INFO L226 Difference]: Without dead ends: 146 [2021-12-22 16:33:28,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:33:28,606 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 133 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:28,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 160 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:33:28,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-22 16:33:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2021-12-22 16:33:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 109 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2021-12-22 16:33:28,608 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 20 [2021-12-22 16:33:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:28,608 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2021-12-22 16:33:28,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2021-12-22 16:33:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 16:33:28,608 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:28,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:28,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:28,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:28,818 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:28,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:28,819 INFO L85 PathProgramCache]: Analyzing trace with hash -10622391, now seen corresponding path program 1 times [2021-12-22 16:33:28,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:28,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472392560] [2021-12-22 16:33:28,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:28,820 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:28,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:28,821 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:28,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-22 16:33:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:28,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-22 16:33:28,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:28,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:29,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:33:29,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:33:29,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-22 16:33:29,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-22 16:33:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:29,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:29,154 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:29,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472392560] [2021-12-22 16:33:29,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472392560] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:29,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:29,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:33:29,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205973734] [2021-12-22 16:33:29,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:29,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:33:29,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:29,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:33:29,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:33:29,156 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:29,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:29,479 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2021-12-22 16:33:29,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:33:29,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-22 16:33:29,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:29,480 INFO L225 Difference]: With dead ends: 203 [2021-12-22 16:33:29,480 INFO L226 Difference]: Without dead ends: 203 [2021-12-22 16:33:29,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:33:29,481 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 164 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:29,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 187 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:33:29,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-22 16:33:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 113. [2021-12-22 16:33:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.441860465116279) internal successors, (124), 112 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2021-12-22 16:33:29,483 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 20 [2021-12-22 16:33:29,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:29,483 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2021-12-22 16:33:29,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2021-12-22 16:33:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 16:33:29,484 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:29,484 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:33:29,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:29,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:29,696 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:29,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:29,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1375969503, now seen corresponding path program 1 times [2021-12-22 16:33:29,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:29,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694476885] [2021-12-22 16:33:29,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:29,698 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:29,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:29,699 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:29,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-22 16:33:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:29,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-22 16:33:29,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:29,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:29,818 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:33:29,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2021-12-22 16:33:29,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-12-22 16:33:29,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-12-22 16:33:30,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-22 16:33:30,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-22 16:33:30,153 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-22 16:33:30,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2021-12-22 16:33:30,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2021-12-22 16:33:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:30,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:30,193 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:30,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694476885] [2021-12-22 16:33:30,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694476885] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:30,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:30,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 16:33:30,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550908903] [2021-12-22 16:33:30,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:30,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 16:33:30,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:30,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 16:33:30,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-22 16:33:30,194 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:30,931 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2021-12-22 16:33:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 16:33:30,932 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-22 16:33:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:30,933 INFO L225 Difference]: With dead ends: 183 [2021-12-22 16:33:30,933 INFO L226 Difference]: Without dead ends: 183 [2021-12-22 16:33:30,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2021-12-22 16:33:30,933 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 196 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:30,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 589 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 424 Invalid, 0 Unknown, 59 Unchecked, 0.5s Time] [2021-12-22 16:33:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-22 16:33:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 128. [2021-12-22 16:33:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 101 states have (on average 1.386138613861386) internal successors, (140), 127 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2021-12-22 16:33:30,936 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 23 [2021-12-22 16:33:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:30,936 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2021-12-22 16:33:30,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2021-12-22 16:33:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 16:33:30,936 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:30,937 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:30,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:31,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:31,146 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:31,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:31,146 INFO L85 PathProgramCache]: Analyzing trace with hash 382685369, now seen corresponding path program 2 times [2021-12-22 16:33:31,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:31,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144943993] [2021-12-22 16:33:31,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 16:33:31,148 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:31,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:31,149 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:31,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-22 16:33:31,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 16:33:31,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:33:31,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-22 16:33:31,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:31,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:31,334 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:33:31,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2021-12-22 16:33:31,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:33:31,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-22 16:33:31,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:31,494 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:33:31,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-22 16:33:31,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-22 16:33:31,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2021-12-22 16:33:31,666 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:33:31,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 55 [2021-12-22 16:33:31,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-22 16:33:31,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-22 16:33:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:31,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:33:32,176 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse4 (bvadd (_ bv4 32) .cse3 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|))) (or (and (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_446) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (not (bvule (bvadd .cse3 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|) .cse4)) (not (bvule .cse4 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem8#1.base|)))))) is different from false [2021-12-22 16:33:32,236 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse0 (bvadd (_ bv4 32) .cse2 .cse3))) (or (not (bvule .cse0 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (not (bvule (bvadd .cse2 .cse3) .cse0)) (and (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_446) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)))))) (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse7 (let ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)))) (bvule (bvadd (_ bv4 32) .cse6 .cse7) (bvadd (_ bv8 32) .cse6 .cse7))))))))) is different from false [2021-12-22 16:33:34,453 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:33:34,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 272 treesize of output 222 [2021-12-22 16:33:34,468 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:33:34,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 222 treesize of output 172 [2021-12-22 16:33:34,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 860 treesize of output 728 [2021-12-22 16:33:34,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3140 treesize of output 2918 [2021-12-22 16:33:34,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2918 treesize of output 2774 [2021-12-22 16:33:34,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2774 treesize of output 2430 [2021-12-22 16:33:34,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2333 treesize of output 2141 [2021-12-22 16:33:34,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2141 treesize of output 1949 [2021-12-22 16:33:34,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1949 treesize of output 1885 [2021-12-22 16:33:34,609 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:34,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144943993] [2021-12-22 16:33:34,609 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-22 16:33:34,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [796949892] [2021-12-22 16:33:34,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 16:33:34,610 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-22 16:33:34,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-22 16:33:34,635 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-22 16:33:34,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2021-12-22 16:33:34,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 16:33:34,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:33:34,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-22 16:33:34,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:34,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:34,896 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:33:34,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2021-12-22 16:33:34,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:33:34,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-22 16:33:34,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:34,973 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:33:34,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-22 16:33:34,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-22 16:33:35,081 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:33:35,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-22 16:33:35,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-22 16:33:35,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-22 16:33:35,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-22 16:33:35,140 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:35,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:33:35,261 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_506) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_507) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))))) (forall ((v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_506) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2))))) is different from false [2021-12-22 16:33:35,302 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_506) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_506) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_507) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))) is different from false [2021-12-22 16:33:35,352 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_506) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_507) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse3 (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_506) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2021-12-22 16:33:35,545 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_504 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_505) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_504) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_506) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_504 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_504)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_505) .cse3 v_ArrVal_506) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_507) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))) is different from false [2021-12-22 16:33:35,739 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_504 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_504))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_505) .cse1 v_ArrVal_506) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_507) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_504 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_505) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_504) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) v_ArrVal_506)) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (.cse5 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (_ bv8 32) .cse4 .cse5) (bvadd .cse4 .cse5 (_ bv12 32)))))) is different from false [2021-12-22 16:33:35,793 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_504 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_505) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_504) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_506)) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_504 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_504))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_505) .cse4 v_ArrVal_506) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_507) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))))))))) is different from false [2021-12-22 16:33:35,809 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:33:35,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2021-12-22 16:33:35,819 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:33:35,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2021-12-22 16:33:35,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2021-12-22 16:33:35,827 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 286 treesize of output 244 [2021-12-22 16:33:35,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 186 [2021-12-22 16:33:35,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 184 [2021-12-22 16:33:35,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 130 [2021-12-22 16:33:35,917 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:33:35,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2021-12-22 16:33:35,930 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:33:35,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2021-12-22 16:33:35,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:33:35,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2021-12-22 16:33:35,944 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:33:35,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2021-12-22 16:33:35,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-22 16:33:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2021-12-22 16:33:36,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [796949892] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:33:36,107 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 16:33:36,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2021-12-22 16:33:36,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220591639] [2021-12-22 16:33:36,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 16:33:36,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-22 16:33:36,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:36,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-22 16:33:36,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=298, Unknown=14, NotChecked=344, Total=756 [2021-12-22 16:33:36,108 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:38,485 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2021-12-22 16:33:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 16:33:38,486 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-22 16:33:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:38,487 INFO L225 Difference]: With dead ends: 171 [2021-12-22 16:33:38,487 INFO L226 Difference]: Without dead ends: 171 [2021-12-22 16:33:38,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=179, Invalid=595, Unknown=14, NotChecked=472, Total=1260 [2021-12-22 16:33:38,488 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 80 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 628 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:38,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 736 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 530 Invalid, 0 Unknown, 628 Unchecked, 1.4s Time] [2021-12-22 16:33:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-22 16:33:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 133. [2021-12-22 16:33:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2021-12-22 16:33:38,491 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 23 [2021-12-22 16:33:38,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:38,491 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2021-12-22 16:33:38,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2021-12-22 16:33:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-22 16:33:38,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:38,494 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:33:38,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2021-12-22 16:33:38,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:38,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:38,908 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:38,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash -543267076, now seen corresponding path program 1 times [2021-12-22 16:33:38,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:38,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166335362] [2021-12-22 16:33:38,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:38,909 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:38,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:38,910 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:38,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-22 16:33:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:38,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-22 16:33:38,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:39,055 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:33:39,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-22 16:33:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:39,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:39,090 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:39,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166335362] [2021-12-22 16:33:39,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166335362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:39,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:39,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:33:39,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043338915] [2021-12-22 16:33:39,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:39,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:33:39,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:39,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:33:39,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:33:39,092 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:39,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:39,240 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2021-12-22 16:33:39,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:33:39,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-22 16:33:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:39,241 INFO L225 Difference]: With dead ends: 167 [2021-12-22 16:33:39,241 INFO L226 Difference]: Without dead ends: 167 [2021-12-22 16:33:39,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:33:39,242 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 155 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:39,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 169 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:33:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-22 16:33:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2021-12-22 16:33:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 144 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2021-12-22 16:33:39,244 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 25 [2021-12-22 16:33:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:39,244 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2021-12-22 16:33:39,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2021-12-22 16:33:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 16:33:39,245 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:39,245 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:33:39,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:39,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:39,451 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash 338589996, now seen corresponding path program 1 times [2021-12-22 16:33:39,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:39,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343335923] [2021-12-22 16:33:39,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:39,452 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:39,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:39,453 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:39,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-22 16:33:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:39,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 16:33:39,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:39,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-12-22 16:33:39,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:39,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:39,743 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:39,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343335923] [2021-12-22 16:33:39,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343335923] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:39,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:39,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:33:39,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748407783] [2021-12-22 16:33:39,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:39,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:33:39,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:39,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:33:39,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:33:39,744 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 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) [2021-12-22 16:33:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:39,979 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2021-12-22 16:33:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:33:39,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 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 [2021-12-22 16:33:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:39,980 INFO L225 Difference]: With dead ends: 168 [2021-12-22 16:33:39,981 INFO L226 Difference]: Without dead ends: 168 [2021-12-22 16:33:39,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:33:39,981 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 154 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:39,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 144 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:33:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-22 16:33:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 146. [2021-12-22 16:33:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 145 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2021-12-22 16:33:39,983 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 26 [2021-12-22 16:33:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:39,983 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2021-12-22 16:33:39,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 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) [2021-12-22 16:33:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2021-12-22 16:33:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 16:33:39,984 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:39,984 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:33:39,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:40,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:40,184 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:40,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1906355454, now seen corresponding path program 1 times [2021-12-22 16:33:40,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:40,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814534843] [2021-12-22 16:33:40,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:40,185 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:40,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:40,186 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:40,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-22 16:33:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:40,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-22 16:33:40,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:40,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:40,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:33:40,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-22 16:33:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:40,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:40,401 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:40,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814534843] [2021-12-22 16:33:40,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814534843] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:40,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:40,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:33:40,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183586904] [2021-12-22 16:33:40,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:40,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:33:40,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:40,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:33:40,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:33:40,402 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:40,626 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2021-12-22 16:33:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:33:40,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-22 16:33:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:40,627 INFO L225 Difference]: With dead ends: 167 [2021-12-22 16:33:40,627 INFO L226 Difference]: Without dead ends: 167 [2021-12-22 16:33:40,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:33:40,628 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 78 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:40,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 164 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:33:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-22 16:33:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 149. [2021-12-22 16:33:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 122 states have (on average 1.4262295081967213) internal successors, (174), 148 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2021-12-22 16:33:40,630 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 27 [2021-12-22 16:33:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:40,630 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2021-12-22 16:33:40,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2021-12-22 16:33:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 16:33:40,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:40,630 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:33:40,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-22 16:33:40,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:40,831 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:40,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823547, now seen corresponding path program 1 times [2021-12-22 16:33:40,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:40,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795235593] [2021-12-22 16:33:40,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:40,832 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:40,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:40,832 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:40,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-22 16:33:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:40,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-22 16:33:40,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:41,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:41,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:33:41,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:33:41,274 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-22 16:33:41,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2021-12-22 16:33:41,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-22 16:33:41,507 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:33:41,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2021-12-22 16:33:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:41,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:41,539 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:41,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795235593] [2021-12-22 16:33:41,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795235593] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:41,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:41,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 16:33:41,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963804647] [2021-12-22 16:33:41,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:41,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 16:33:41,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:41,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 16:33:41,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:33:41,540 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:42,080 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2021-12-22 16:33:42,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 16:33:42,080 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-22 16:33:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:42,081 INFO L225 Difference]: With dead ends: 171 [2021-12-22 16:33:42,081 INFO L226 Difference]: Without dead ends: 171 [2021-12-22 16:33:42,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2021-12-22 16:33:42,082 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 283 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:42,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 358 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 349 Invalid, 0 Unknown, 137 Unchecked, 0.3s Time] [2021-12-22 16:33:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-22 16:33:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2021-12-22 16:33:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 128 states have (on average 1.4140625) internal successors, (181), 153 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2021-12-22 16:33:42,089 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 27 [2021-12-22 16:33:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:42,089 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2021-12-22 16:33:42,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2021-12-22 16:33:42,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 16:33:42,090 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:42,090 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:33:42,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:42,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:42,290 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:42,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823546, now seen corresponding path program 1 times [2021-12-22 16:33:42,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:42,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731792929] [2021-12-22 16:33:42,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:42,291 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:42,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:42,292 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:42,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-22 16:33:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:42,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-22 16:33:42,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:42,444 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:42,465 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:33:42,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2021-12-22 16:33:42,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:42,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-12-22 16:33:42,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-12-22 16:33:42,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 16:33:42,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-22 16:33:42,835 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-22 16:33:42,836 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 38 [2021-12-22 16:33:42,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2021-12-22 16:33:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:42,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:42,923 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:42,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731792929] [2021-12-22 16:33:42,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731792929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:42,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:42,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 16:33:42,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211910214] [2021-12-22 16:33:42,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:42,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 16:33:42,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:42,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 16:33:42,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:33:42,924 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:44,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:44,143 INFO L93 Difference]: Finished difference Result 216 states and 242 transitions. [2021-12-22 16:33:44,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 16:33:44,144 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-22 16:33:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:44,144 INFO L225 Difference]: With dead ends: 216 [2021-12-22 16:33:44,144 INFO L226 Difference]: Without dead ends: 216 [2021-12-22 16:33:44,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2021-12-22 16:33:44,150 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 291 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:44,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 382 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 623 Invalid, 0 Unknown, 81 Unchecked, 0.8s Time] [2021-12-22 16:33:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-22 16:33:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 164. [2021-12-22 16:33:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.4202898550724639) internal successors, (196), 163 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 196 transitions. [2021-12-22 16:33:44,152 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 196 transitions. Word has length 27 [2021-12-22 16:33:44,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:44,153 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 196 transitions. [2021-12-22 16:33:44,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 196 transitions. [2021-12-22 16:33:44,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 16:33:44,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:44,153 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:33:44,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:44,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:44,361 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:44,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:44,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522897, now seen corresponding path program 1 times [2021-12-22 16:33:44,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:44,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840552382] [2021-12-22 16:33:44,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:44,362 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:44,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:44,363 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:44,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-22 16:33:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:44,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-22 16:33:44,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:44,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:33:44,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-12-22 16:33:44,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-22 16:33:44,813 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:33:44,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2021-12-22 16:33:44,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-22 16:33:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:44,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:44,858 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:44,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840552382] [2021-12-22 16:33:44,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840552382] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:44,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:44,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 16:33:44,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293850786] [2021-12-22 16:33:44,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:44,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 16:33:44,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:44,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 16:33:44,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:33:44,859 INFO L87 Difference]: Start difference. First operand 164 states and 196 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:45,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:45,672 INFO L93 Difference]: Finished difference Result 188 states and 210 transitions. [2021-12-22 16:33:45,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 16:33:45,673 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-12-22 16:33:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:45,673 INFO L225 Difference]: With dead ends: 188 [2021-12-22 16:33:45,673 INFO L226 Difference]: Without dead ends: 188 [2021-12-22 16:33:45,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2021-12-22 16:33:45,674 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 478 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:45,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 291 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 16:33:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-22 16:33:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 165. [2021-12-22 16:33:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 139 states have (on average 1.4244604316546763) internal successors, (198), 164 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2021-12-22 16:33:45,676 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 28 [2021-12-22 16:33:45,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:45,677 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2021-12-22 16:33:45,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2021-12-22 16:33:45,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 16:33:45,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:45,677 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:33:45,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-12-22 16:33:45,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:45,877 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:45,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522896, now seen corresponding path program 1 times [2021-12-22 16:33:45,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:45,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952672996] [2021-12-22 16:33:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:33:45,878 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:45,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:45,879 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:45,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-22 16:33:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:33:45,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 16:33:45,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:46,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 16:33:46,068 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:33:46,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952672996] [2021-12-22 16:33:46,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952672996] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:33:46,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:33:46,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:33:46,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504347055] [2021-12-22 16:33:46,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:33:46,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:33:46,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 16:33:46,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:33:46,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:33:46,069 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:46,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:33:46,154 INFO L93 Difference]: Finished difference Result 160 states and 190 transitions. [2021-12-22 16:33:46,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:33:46,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-12-22 16:33:46,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:33:46,156 INFO L225 Difference]: With dead ends: 160 [2021-12-22 16:33:46,156 INFO L226 Difference]: Without dead ends: 160 [2021-12-22 16:33:46,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:33:46,156 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 70 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:33:46,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 50 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:33:46,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-22 16:33:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-22 16:33:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 139 states have (on average 1.3669064748201438) internal successors, (190), 159 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 190 transitions. [2021-12-22 16:33:46,159 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 190 transitions. Word has length 28 [2021-12-22 16:33:46,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:33:46,159 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 190 transitions. [2021-12-22 16:33:46,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:33:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 190 transitions. [2021-12-22 16:33:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 16:33:46,160 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:33:46,160 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:33:46,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-22 16:33:46,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 16:33:46,367 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-22 16:33:46,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:33:46,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1865364083, now seen corresponding path program 3 times [2021-12-22 16:33:46,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 16:33:46,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757397057] [2021-12-22 16:33:46,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 16:33:46,368 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 16:33:46,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 16:33:46,369 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 16:33:46,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-22 16:33:46,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-22 16:33:46,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:33:46,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-22 16:33:46,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:33:46,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:46,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:46,690 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:33:46,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2021-12-22 16:33:46,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-22 16:33:46,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:33:46,812 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:33:46,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-22 16:33:46,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-22 16:33:46,947 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:33:46,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 65 [2021-12-22 16:33:46,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2021-12-22 16:33:47,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2021-12-22 16:33:47,088 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:33:47,088 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 55 [2021-12-22 16:33:47,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-22 16:33:47,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-22 16:33:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:33:47,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:33:47,654 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse1 (bvadd (_ bv4 32) .cse0 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|))) (or (not (bvule (bvadd .cse0 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|) .cse1)) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem8#1.base|))) (and (forall ((v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_814) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse2 (_ bv4 32) .cse3) (bvadd .cse2 (_ bv8 32) .cse3)))) (forall ((v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_814) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_815) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))) (not (bvslt (bvadd |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv1 32)) (_ bv20 32)))))) is different from false [2021-12-22 16:33:47,713 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse7 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse5 (bvadd (_ bv4 32) .cse7 .cse8))) (or (and (forall ((v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_814) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_815) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse3 (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_814) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (bvule (bvadd (_ bv4 32) .cse2 .cse3) (bvadd (_ bv8 32) .cse2 .cse3))))) (not (bvule .cse5 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))) (not (bvslt (bvadd |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv1 32)) (_ bv20 32))) (not (bvule (bvadd .cse7 .cse8) .cse5)))))) is different from false [2021-12-22 16:33:47,820 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse0 (bvadd (_ bv8 32) .cse2 .cse3))) (or (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (not (bvule .cse0 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (not (bvule (bvadd (_ bv4 32) .cse2 .cse3) .cse0)) (and (forall ((v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_815 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_814) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_815) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)))))) (forall ((v_ArrVal_814 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse7 (let ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) v_ArrVal_814) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)))) (bvule (bvadd (_ bv8 32) .cse6 .cse7) (bvadd .cse6 .cse7 (_ bv12 32)))))))))) is different from false [2021-12-22 16:34:07,140 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:34:07,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 628 treesize of output 548 [2021-12-22 16:34:07,166 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:34:07,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 548 treesize of output 368 [2021-12-22 16:34:07,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 16140 treesize of output 13428 [2021-12-22 16:34:07,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 233676 treesize of output 227202 [2021-12-22 16:34:07,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 227202 treesize of output 218898 [2021-12-22 16:34:08,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218898 treesize of output 201666 [2021-12-22 16:34:08,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 201666 treesize of output 197354 [2021-12-22 16:34:09,387 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197354 treesize of output 169930 [2021-12-22 16:34:10,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168485 treesize of output 152933 [2021-12-22 16:34:10,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152933 treesize of output 137381 [2021-12-22 16:34:11,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137381 treesize of output 136389 [2021-12-22 16:34:11,873 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 16:34:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757397057] [2021-12-22 16:34:11,873 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-22 16:34:11,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [834577336] [2021-12-22 16:34:11,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 16:34:11,874 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-22 16:34:11,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-22 16:34:11,881 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-22 16:34:11,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2021-12-22 16:34:12,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-22 16:34:12,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 16:34:12,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-22 16:34:12,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:34:12,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:34:12,609 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 16:34:12,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2021-12-22 16:34:12,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 16:34:12,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-22 16:34:12,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-22 16:34:12,704 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:34:12,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-22 16:34:12,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-22 16:34:12,851 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:34:12,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-22 16:34:12,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-22 16:34:13,008 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 16:34:13,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-22 16:34:13,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-22 16:34:13,096 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-22 16:34:13,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-22 16:34:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:34:13,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:34:13,530 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_891) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_891) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2021-12-22 16:34:13,575 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_891) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_891) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse2 (_ bv4 32) .cse3) (bvadd .cse2 (_ bv8 32) .cse3))))) is different from false [2021-12-22 16:34:13,650 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_891) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_891) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse2 (_ bv8 32) .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2021-12-22 16:34:13,947 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_889)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_890) .cse0 v_ArrVal_891) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse4 (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_890) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_889) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) v_ArrVal_891) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)))) (bvule (bvadd (_ bv8 32) .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2021-12-22 16:34:14,135 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_889))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_890) .cse1 v_ArrVal_891) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_890) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_889) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) v_ArrVal_891)) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (.cse5 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse4 (_ bv8 32) .cse5) (bvadd .cse4 .cse5 (_ bv12 32)))))) is different from false [2021-12-22 16:34:14,212 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_890) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_889) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_891)) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_889))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_890) .cse5 v_ArrVal_891) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))))))))) is different from false [2021-12-22 16:34:14,453 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_888))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_887) .cse2 v_ArrVal_890) (select (select (store .cse3 .cse2 v_ArrVal_889) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_891))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_888)) (.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_889))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_887) .cse5 v_ArrVal_890) .cse6 v_ArrVal_891) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))))))))) is different from false [2021-12-22 16:34:14,683 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_888))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_887) .cse3 v_ArrVal_890) (select (select (store .cse4 .cse3 v_ArrVal_889) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) v_ArrVal_891)))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_888))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_889))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_887) .cse7 v_ArrVal_890) .cse8 v_ArrVal_891) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))))))))))) is different from false [2021-12-22 16:34:14,763 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_888))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_887) .cse2 v_ArrVal_890) (select (select (store .cse3 .cse2 v_ArrVal_889) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_891)))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv12 32)) (bvadd (_ bv16 32) .cse0)))) (forall ((v_ArrVal_890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_888 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_888))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_889))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_887) .cse6 v_ArrVal_890) .cse7 v_ArrVal_891) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_892) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))))))))))) is different from false [2021-12-22 16:34:14,789 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:34:14,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2021-12-22 16:34:14,811 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:34:14,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2021-12-22 16:34:14,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 17386 treesize of output 14944 [2021-12-22 16:34:15,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 192128 treesize of output 186362 [2021-12-22 16:34:16,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186358 treesize of output 172662 [2021-12-22 16:34:16,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172662 treesize of output 169334 [2021-12-22 16:34:16,975 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169334 treesize of output 155638 [2021-12-22 16:34:17,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155638 treesize of output 139326 [2021-12-22 16:34:17,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139326 treesize of output 132798 [2021-12-22 16:34:18,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132798 treesize of output 117566