./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7c71bc25 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/complex_data_creation_test02-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 64bit --witnessprinter.graph.data.programhash 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c ......................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/complex_data_creation_test02-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 64bit --witnessprinter.graph.data.programhash 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-7c71bc2 [2019-11-25 13:31:08,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:31:08,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:31:08,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:31:08,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:31:08,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:31:08,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:31:08,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:31:08,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:31:08,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:31:08,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:31:08,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:31:08,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:31:08,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:31:08,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:31:08,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:31:08,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:31:08,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:31:08,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:31:08,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:31:08,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:31:08,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:31:08,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:31:08,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:31:08,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:31:08,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:31:08,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:31:08,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:31:08,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:31:08,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:31:08,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:31:08,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:31:08,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:31:08,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:31:08,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:31:08,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:31:08,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:31:08,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:31:08,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:31:08,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:31:08,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:31:08,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-25 13:31:08,697 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:31:08,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:31:08,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:31:08,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:31:08,699 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:31:08,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:31:08,701 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:31:08,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:31:08,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:31:08,705 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:31:08,706 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:31:08,707 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:31:08,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:31:08,707 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:31:08,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:31:08,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:31:08,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:31:08,708 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:31:08,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:31:08,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:31:08,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:31:08,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:31:08,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 13:31:08,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 13:31:08,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c [2019-11-25 13:31:08,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:31:09,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:31:09,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:31:09,018 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:31:09,018 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:31:09,019 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-25 13:31:09,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc67a1da/74a9c8a07d9844da9d4d47c3447a6133/FLAG5ed48a5d9 [2019-11-25 13:31:09,676 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:31:09,677 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-25 13:31:09,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc67a1da/74a9c8a07d9844da9d4d47c3447a6133/FLAG5ed48a5d9 [2019-11-25 13:31:09,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc67a1da/74a9c8a07d9844da9d4d47c3447a6133 [2019-11-25 13:31:09,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:31:09,960 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:31:09,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:31:09,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:31:09,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:31:09,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:31:09" (1/1) ... [2019-11-25 13:31:09,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ca62d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:31:09, skipping insertion in model container [2019-11-25 13:31:09,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:31:09" (1/1) ... [2019-11-25 13:31:09,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:31:10,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:31:10,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:31:10,381 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) [2019-11-25 13:31:10,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1770e2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:31:10, skipping insertion in model container [2019-11-25 13:31:10,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:31:10,383 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-25 13:31:10,386 INFO L168 Benchmark]: Toolchain (without parser) took 424.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2019-11-25 13:31:10,387 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:31:10,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-11-25 13:31:10,391 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 421.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 545]: 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... ### Bit-precise run ### This is Ultimate 0.1.24-7c71bc2 [2019-11-25 13:31:12,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:31:12,107 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:31:12,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:31:12,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:31:12,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:31:12,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:31:12,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:31:12,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:31:12,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:31:12,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:31:12,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:31:12,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:31:12,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:31:12,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:31:12,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:31:12,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:31:12,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:31:12,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:31:12,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:31:12,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:31:12,156 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:31:12,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:31:12,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:31:12,160 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:31:12,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:31:12,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:31:12,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:31:12,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:31:12,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:31:12,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:31:12,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:31:12,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:31:12,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:31:12,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:31:12,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:31:12,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:31:12,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:31:12,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:31:12,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:31:12,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:31:12,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-25 13:31:12,185 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:31:12,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:31:12,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:31:12,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:31:12,188 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:31:12,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:31:12,188 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:31:12,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:31:12,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:31:12,189 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:31:12,189 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:31:12,190 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:31:12,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:31:12,190 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:31:12,190 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 13:31:12,191 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 13:31:12,191 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:31:12,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:31:12,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:31:12,192 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:31:12,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:31:12,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:31:12,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:31:12,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:31:12,193 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 13:31:12,194 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 13:31:12,194 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 13:31:12,194 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c [2019-11-25 13:31:12,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:31:12,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:31:12,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:31:12,484 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:31:12,484 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:31:12,485 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-25 13:31:12,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15281d8cc/f967572fb8d34bfaa39f0cc1919b3127/FLAGb7aeb40e0 [2019-11-25 13:31:13,072 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:31:13,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-25 13:31:13,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15281d8cc/f967572fb8d34bfaa39f0cc1919b3127/FLAGb7aeb40e0 [2019-11-25 13:31:13,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15281d8cc/f967572fb8d34bfaa39f0cc1919b3127 [2019-11-25 13:31:13,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:31:13,375 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:31:13,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:31:13,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:31:13,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:31:13,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:31:13" (1/1) ... [2019-11-25 13:31:13,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6176253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:31:13, skipping insertion in model container [2019-11-25 13:31:13,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:31:13" (1/1) ... [2019-11-25 13:31:13,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:31:13,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:31:13,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:31:13,875 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-25 13:31:13,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:31:13,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:31:13,944 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 13:31:13,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:31:14,065 INFO L208 MainTranslator]: Completed translation [2019-11-25 13:31:14,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:31:14 WrapperNode [2019-11-25 13:31:14,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:31:14,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 13:31:14,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 13:31:14,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 13:31:14,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:31:14" (1/1) ... [2019-11-25 13:31:14,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:31:14" (1/1) ... [2019-11-25 13:31:14,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:31:14" (1/1) ... [2019-11-25 13:31:14,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:31:14" (1/1) ... [2019-11-25 13:31:14,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:31:14" (1/1) ... [2019-11-25 13:31:14,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:31:14" (1/1) ... [2019-11-25 13:31:14,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:31:14" (1/1) ... [2019-11-25 13:31:14,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 13:31:14,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 13:31:14,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 13:31:14,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 13:31:14,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:31:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:31:14,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 13:31:14,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 13:31:14,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:31:14,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 13:31:14,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 13:31:14,225 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-25 13:31:14,225 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-25 13:31:14,225 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-25 13:31:14,226 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 13:31:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 13:31:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 13:31:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 13:31:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 13:31:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 13:31:14,226 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 13:31:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 13:31:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 13:31:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 13:31:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 13:31:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 13:31:14,227 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 13:31:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 13:31:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 13:31:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 13:31:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 13:31:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 13:31:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 13:31:14,228 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 13:31:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 13:31:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 13:31:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 13:31:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 13:31:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 13:31:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 13:31:14,229 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 13:31:14,230 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 13:31:14,230 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 13:31:14,230 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 13:31:14,230 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 13:31:14,230 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 13:31:14,230 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 13:31:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 13:31:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 13:31:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 13:31:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 13:31:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 13:31:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 13:31:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 13:31:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 13:31:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 13:31:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 13:31:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 13:31:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 13:31:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 13:31:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 13:31:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 13:31:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 13:31:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 13:31:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 13:31:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 13:31:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 13:31:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 13:31:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 13:31:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 13:31:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 13:31:14,234 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 13:31:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-25 13:31:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 13:31:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 13:31:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 13:31:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 13:31:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 13:31:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 13:31:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 13:31:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 13:31:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 13:31:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 13:31:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 13:31:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 13:31:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 13:31:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 13:31:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 13:31:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 13:31:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 13:31:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 13:31:14,237 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 13:31:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 13:31:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 13:31:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 13:31:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 13:31:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 13:31:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 13:31:14,238 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 13:31:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 13:31:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 13:31:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 13:31:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 13:31:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 13:31:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 13:31:14,239 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 13:31:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 13:31:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 13:31:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 13:31:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 13:31:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 13:31:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 13:31:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 13:31:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 13:31:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 13:31:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 13:31:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 13:31:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 13:31:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 13:31:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 13:31:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 13:31:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 13:31:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-25 13:31:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 13:31:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 13:31:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 13:31:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 13:31:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 13:31:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-25 13:31:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 13:31:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-25 13:31:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 13:31:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 13:31:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 13:31:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 13:31:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 13:31:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:31:15,505 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 13:31:15,505 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-25 13:31:15,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:31:15 BoogieIcfgContainer [2019-11-25 13:31:15,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 13:31:15,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 13:31:15,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 13:31:15,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 13:31:15,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 01:31:13" (1/3) ... [2019-11-25 13:31:15,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aef2ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:31:15, skipping insertion in model container [2019-11-25 13:31:15,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:31:14" (2/3) ... [2019-11-25 13:31:15,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aef2ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:31:15, skipping insertion in model container [2019-11-25 13:31:15,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:31:15" (3/3) ... [2019-11-25 13:31:15,516 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2019-11-25 13:31:15,528 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 13:31:15,538 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 92 error locations. [2019-11-25 13:31:15,554 INFO L249 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2019-11-25 13:31:15,580 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 13:31:15,580 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 13:31:15,580 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 13:31:15,581 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 13:31:15,581 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 13:31:15,581 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 13:31:15,582 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 13:31:15,582 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 13:31:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-25 13:31:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-25 13:31:15,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:31:15,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:31:15,628 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-25 13:31:15,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:31:15,636 INFO L82 PathProgramCache]: Analyzing trace with hash 696010085, now seen corresponding path program 1 times [2019-11-25 13:31:15,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:31:15,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764155963] [2019-11-25 13:31:15,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-25 13:31:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:31:15,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-25 13:31:15,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:31:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:15,841 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:31:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:15,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764155963] [2019-11-25 13:31:15,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:31:15,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 13:31:15,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380432355] [2019-11-25 13:31:15,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 13:31:15,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:31:15,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 13:31:15,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 13:31:15,888 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 2 states. [2019-11-25 13:31:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:31:15,949 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2019-11-25 13:31:15,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 13:31:15,951 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-25 13:31:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:31:15,970 INFO L225 Difference]: With dead ends: 199 [2019-11-25 13:31:15,970 INFO L226 Difference]: Without dead ends: 196 [2019-11-25 13:31:15,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 13:31:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-25 13:31:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-11-25 13:31:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-25 13:31:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2019-11-25 13:31:16,037 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 8 [2019-11-25 13:31:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:31:16,037 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2019-11-25 13:31:16,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 13:31:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2019-11-25 13:31:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 13:31:16,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:31:16,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:31:16,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 13:31:16,251 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-25 13:31:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:31:16,252 INFO L82 PathProgramCache]: Analyzing trace with hash 101562384, now seen corresponding path program 1 times [2019-11-25 13:31:16,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:31:16,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688356500] [2019-11-25 13:31:16,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-25 13:31:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:31:16,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:31:16,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:31:16,469 INFO L377 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 [2019-11-25 13:31:16,473 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:16,479 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:16,480 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:16,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:31:16,535 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:16,536 INFO L377 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 14 treesize of output 30 [2019-11-25 13:31:16,538 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:16,558 INFO L588 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-25 13:31:16,559 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:31:16,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-25 13:31:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:16,582 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:31:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:16,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688356500] [2019-11-25 13:31:16,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:31:16,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 13:31:16,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198410622] [2019-11-25 13:31:16,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:31:16,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:31:16,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:31:16,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:31:16,614 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 5 states. [2019-11-25 13:31:17,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:31:17,438 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2019-11-25 13:31:17,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 13:31:17,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-25 13:31:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:31:17,443 INFO L225 Difference]: With dead ends: 190 [2019-11-25 13:31:17,443 INFO L226 Difference]: Without dead ends: 190 [2019-11-25 13:31:17,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 13:31:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-25 13:31:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-11-25 13:31:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-25 13:31:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 201 transitions. [2019-11-25 13:31:17,458 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 201 transitions. Word has length 9 [2019-11-25 13:31:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:31:17,459 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 201 transitions. [2019-11-25 13:31:17,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:31:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 201 transitions. [2019-11-25 13:31:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 13:31:17,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:31:17,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:31:17,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 13:31:17,679 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-25 13:31:17,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:31:17,679 INFO L82 PathProgramCache]: Analyzing trace with hash 101562385, now seen corresponding path program 1 times [2019-11-25 13:31:17,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:31:17,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797178263] [2019-11-25 13:31:17,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-25 13:31:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:31:17,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 13:31:17,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:31:17,797 INFO L377 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 [2019-11-25 13:31:17,797 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:17,819 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:17,826 INFO L377 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 [2019-11-25 13:31:17,826 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:17,835 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:17,836 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:17,836 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-25 13:31:17,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:31:17,924 INFO L377 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 [2019-11-25 13:31:17,925 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:17,946 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:17,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:31:17,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-25 13:31:17,956 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:17,972 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:17,976 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:31:17,976 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2019-11-25 13:31:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:18,006 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:31:18,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:18,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797178263] [2019-11-25 13:31:18,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:31:18,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-25 13:31:18,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676100099] [2019-11-25 13:31:18,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 13:31:18,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:31:18,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 13:31:18,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-25 13:31:18,297 INFO L87 Difference]: Start difference. First operand 190 states and 201 transitions. Second operand 8 states. [2019-11-25 13:31:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:31:23,591 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2019-11-25 13:31:23,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 13:31:23,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-25 13:31:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:31:23,596 INFO L225 Difference]: With dead ends: 205 [2019-11-25 13:31:23,597 INFO L226 Difference]: Without dead ends: 205 [2019-11-25 13:31:23,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:31:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-25 13:31:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-25 13:31:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-25 13:31:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 199 transitions. [2019-11-25 13:31:23,610 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 199 transitions. Word has length 9 [2019-11-25 13:31:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:31:23,611 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 199 transitions. [2019-11-25 13:31:23,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 13:31:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 199 transitions. [2019-11-25 13:31:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 13:31:23,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:31:23,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:31:23,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 13:31:23,817 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-25 13:31:23,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:31:23,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533154, now seen corresponding path program 1 times [2019-11-25 13:31:23,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:31:23,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607002268] [2019-11-25 13:31:23,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-25 13:31:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:31:23,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 13:31:23,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:31:23,912 INFO L377 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 [2019-11-25 13:31:23,912 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:23,914 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:23,914 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:23,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:31:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:23,918 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:31:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:23,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607002268] [2019-11-25 13:31:23,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:31:23,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 13:31:23,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548076397] [2019-11-25 13:31:23,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 13:31:23,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:31:23,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 13:31:23,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:31:23,934 INFO L87 Difference]: Start difference. First operand 188 states and 199 transitions. Second operand 3 states. [2019-11-25 13:31:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:31:24,229 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2019-11-25 13:31:24,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 13:31:24,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-25 13:31:24,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:31:24,232 INFO L225 Difference]: With dead ends: 186 [2019-11-25 13:31:24,232 INFO L226 Difference]: Without dead ends: 186 [2019-11-25 13:31:24,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:31:24,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-25 13:31:24,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-25 13:31:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-25 13:31:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 197 transitions. [2019-11-25 13:31:24,242 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 197 transitions. Word has length 10 [2019-11-25 13:31:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:31:24,243 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 197 transitions. [2019-11-25 13:31:24,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 13:31:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 197 transitions. [2019-11-25 13:31:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 13:31:24,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:31:24,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:31:24,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 13:31:24,464 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-25 13:31:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:31:24,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533153, now seen corresponding path program 1 times [2019-11-25 13:31:24,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:31:24,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660228384] [2019-11-25 13:31:24,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-25 13:31:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:31:24,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:31:24,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:31:24,568 INFO L377 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 [2019-11-25 13:31:24,569 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:24,575 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:24,575 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:24,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:31:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:24,584 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:31:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:24,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660228384] [2019-11-25 13:31:24,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:31:24,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-25 13:31:24,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201674973] [2019-11-25 13:31:24,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 13:31:24,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:31:24,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 13:31:24,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 13:31:24,633 INFO L87 Difference]: Start difference. First operand 186 states and 197 transitions. Second operand 4 states. [2019-11-25 13:31:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:31:25,209 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2019-11-25 13:31:25,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 13:31:25,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-25 13:31:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:31:25,212 INFO L225 Difference]: With dead ends: 184 [2019-11-25 13:31:25,213 INFO L226 Difference]: Without dead ends: 184 [2019-11-25 13:31:25,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 13:31:25,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-25 13:31:25,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-11-25 13:31:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-25 13:31:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 195 transitions. [2019-11-25 13:31:25,220 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 195 transitions. Word has length 10 [2019-11-25 13:31:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:31:25,221 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 195 transitions. [2019-11-25 13:31:25,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 13:31:25,221 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 195 transitions. [2019-11-25 13:31:25,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 13:31:25,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:31:25,222 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:31:25,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 13:31:25,430 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-25 13:31:25,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:31:25,431 INFO L82 PathProgramCache]: Analyzing trace with hash -182531198, now seen corresponding path program 1 times [2019-11-25 13:31:25,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:31:25,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907195767] [2019-11-25 13:31:25,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-25 13:31:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:31:25,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-25 13:31:25,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:31:25,561 INFO L377 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 [2019-11-25 13:31:25,562 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:25,572 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:25,572 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:25,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-11-25 13:31:25,637 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:25,637 INFO L377 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 13 treesize of output 17 [2019-11-25 13:31:25,638 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:25,649 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:25,650 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:25,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2019-11-25 13:31:25,695 INFO L377 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 [2019-11-25 13:31:25,696 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:25,721 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:25,730 INFO L377 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 [2019-11-25 13:31:25,731 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:25,750 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:25,751 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:25,751 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:15 [2019-11-25 13:31:25,776 INFO L377 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 [2019-11-25 13:31:25,777 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:25,791 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:25,794 INFO L377 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 [2019-11-25 13:31:25,795 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:25,799 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:25,799 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:25,799 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-25 13:31:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:25,813 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:31:27,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:32,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:32,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:31:32,288 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:32,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:31:32,294 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:32,295 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:32,295 INFO L508 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:32,295 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:87, output treesize:1 [2019-11-25 13:31:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:32,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907195767] [2019-11-25 13:31:32,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:31:32,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-25 13:31:32,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902482262] [2019-11-25 13:31:32,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:31:32,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:31:32,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:31:32,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=65, Unknown=3, NotChecked=0, Total=90 [2019-11-25 13:31:32,302 INFO L87 Difference]: Start difference. First operand 184 states and 195 transitions. Second operand 10 states. [2019-11-25 13:31:33,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:31:33,928 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2019-11-25 13:31:33,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 13:31:33,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-25 13:31:33,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:31:33,932 INFO L225 Difference]: With dead ends: 192 [2019-11-25 13:31:33,932 INFO L226 Difference]: Without dead ends: 192 [2019-11-25 13:31:33,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=35, Invalid=94, Unknown=3, NotChecked=0, Total=132 [2019-11-25 13:31:33,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-25 13:31:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-11-25 13:31:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-25 13:31:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2019-11-25 13:31:33,942 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 15 [2019-11-25 13:31:33,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:31:33,942 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2019-11-25 13:31:33,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:31:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2019-11-25 13:31:33,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:31:33,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:31:33,944 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:31:34,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 13:31:34,155 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-25 13:31:34,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:31:34,157 INFO L82 PathProgramCache]: Analyzing trace with hash 675193263, now seen corresponding path program 1 times [2019-11-25 13:31:34,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:31:34,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191557666] [2019-11-25 13:31:34,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-25 13:31:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:31:34,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 13:31:34,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:31:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:34,316 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:31:34,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:34,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191557666] [2019-11-25 13:31:34,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:31:34,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 13:31:34,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470985403] [2019-11-25 13:31:34,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 13:31:34,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:31:34,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 13:31:34,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 13:31:34,331 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand 4 states. [2019-11-25 13:31:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:31:34,363 INFO L93 Difference]: Finished difference Result 268 states and 284 transitions. [2019-11-25 13:31:34,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:31:34,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-25 13:31:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:31:34,365 INFO L225 Difference]: With dead ends: 268 [2019-11-25 13:31:34,365 INFO L226 Difference]: Without dead ends: 268 [2019-11-25 13:31:34,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:31:34,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-25 13:31:34,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 232. [2019-11-25 13:31:34,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 13:31:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2019-11-25 13:31:34,375 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 17 [2019-11-25 13:31:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:31:34,375 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2019-11-25 13:31:34,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 13:31:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2019-11-25 13:31:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 13:31:34,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:31:34,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:31:34,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 13:31:34,593 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-25 13:31:34,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:31:34,593 INFO L82 PathProgramCache]: Analyzing trace with hash -543839094, now seen corresponding path program 1 times [2019-11-25 13:31:34,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:31:34,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363737533] [2019-11-25 13:31:34,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-25 13:31:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:31:34,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 13:31:34,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:31:34,708 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_111|], 1=[|v_#valid_155|]} [2019-11-25 13:31:34,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:31:34,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-25 13:31:34,716 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:34,727 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:34,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:31:34,732 INFO L377 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 5 treesize of output 3 [2019-11-25 13:31:34,733 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:34,739 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:34,740 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:31:34,740 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-25 13:31:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:34,761 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:31:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:34,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363737533] [2019-11-25 13:31:34,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:31:34,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-25 13:31:34,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796543748] [2019-11-25 13:31:34,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 13:31:34,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:31:34,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 13:31:34,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 13:31:34,824 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand 4 states. [2019-11-25 13:31:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:31:35,839 INFO L93 Difference]: Finished difference Result 267 states and 328 transitions. [2019-11-25 13:31:35,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 13:31:35,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-25 13:31:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:31:35,841 INFO L225 Difference]: With dead ends: 267 [2019-11-25 13:31:35,841 INFO L226 Difference]: Without dead ends: 267 [2019-11-25 13:31:35,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 13:31:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-25 13:31:35,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 223. [2019-11-25 13:31:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-25 13:31:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2019-11-25 13:31:35,848 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 18 [2019-11-25 13:31:35,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:31:35,849 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2019-11-25 13:31:35,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 13:31:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2019-11-25 13:31:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 13:31:35,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:31:35,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:31:36,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 13:31:36,054 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-25 13:31:36,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:31:36,054 INFO L82 PathProgramCache]: Analyzing trace with hash -543839095, now seen corresponding path program 1 times [2019-11-25 13:31:36,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:31:36,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025440444] [2019-11-25 13:31:36,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-25 13:31:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:31:36,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 13:31:36,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:31:36,184 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-25 13:31:36,185 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-25 13:31:36,186 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:36,192 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:36,192 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:31:36,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-25 13:31:36,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:36,206 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:31:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:36,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025440444] [2019-11-25 13:31:36,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:31:36,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 13:31:36,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129735504] [2019-11-25 13:31:36,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 13:31:36,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:31:36,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 13:31:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:31:36,218 INFO L87 Difference]: Start difference. First operand 223 states and 266 transitions. Second operand 3 states. [2019-11-25 13:31:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:31:36,561 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-11-25 13:31:36,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 13:31:36,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-25 13:31:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:31:36,564 INFO L225 Difference]: With dead ends: 226 [2019-11-25 13:31:36,564 INFO L226 Difference]: Without dead ends: 226 [2019-11-25 13:31:36,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:31:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-25 13:31:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2019-11-25 13:31:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-25 13:31:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2019-11-25 13:31:36,574 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 256 transitions. Word has length 18 [2019-11-25 13:31:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:31:36,575 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 256 transitions. [2019-11-25 13:31:36,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 13:31:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 256 transitions. [2019-11-25 13:31:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 13:31:36,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:31:36,577 INFO L410 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] [2019-11-25 13:31:36,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 13:31:36,790 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-25 13:31:36,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:31:36,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108428, now seen corresponding path program 1 times [2019-11-25 13:31:36,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:31:36,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787030307] [2019-11-25 13:31:36,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-25 13:31:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:31:36,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 13:31:36,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:31:36,918 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-25 13:31:36,918 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-25 13:31:36,918 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:36,929 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:36,930 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:31:36,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-25 13:31:36,948 INFO L377 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 [2019-11-25 13:31:36,949 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:36,956 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:36,957 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:36,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-25 13:31:36,973 INFO L377 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 [2019-11-25 13:31:36,973 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:36,975 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:36,975 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:36,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-25 13:31:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:36,984 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:31:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:36,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787030307] [2019-11-25 13:31:36,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:31:36,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 13:31:36,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620845081] [2019-11-25 13:31:36,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:31:36,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:31:36,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:31:36,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:31:36,993 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. Second operand 5 states. [2019-11-25 13:31:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:31:37,622 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-11-25 13:31:37,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:31:37,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-25 13:31:37,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:31:37,627 INFO L225 Difference]: With dead ends: 226 [2019-11-25 13:31:37,627 INFO L226 Difference]: Without dead ends: 226 [2019-11-25 13:31:37,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 13:31:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-25 13:31:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 216. [2019-11-25 13:31:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-25 13:31:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2019-11-25 13:31:37,636 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 22 [2019-11-25 13:31:37,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:31:37,639 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2019-11-25 13:31:37,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:31:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2019-11-25 13:31:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 13:31:37,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:31:37,640 INFO L410 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] [2019-11-25 13:31:37,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 13:31:37,840 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-25 13:31:37,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:31:37,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108427, now seen corresponding path program 1 times [2019-11-25 13:31:37,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:31:37,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378414878] [2019-11-25 13:31:37,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-25 13:31:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:31:37,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 13:31:37,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:31:37,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:37,994 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-25 13:31:37,994 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:38,020 INFO L588 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-25 13:31:38,021 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:38,021 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-25 13:31:38,037 INFO L377 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 [2019-11-25 13:31:38,037 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:38,056 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:38,063 INFO L377 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 [2019-11-25 13:31:38,063 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:38,077 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:38,078 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:38,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2019-11-25 13:31:38,129 INFO L377 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 [2019-11-25 13:31:38,130 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:38,146 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:38,151 INFO L377 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 [2019-11-25 13:31:38,151 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:38,158 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:38,159 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:38,159 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-25 13:31:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:38,175 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:31:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:31:38,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378414878] [2019-11-25 13:31:38,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:31:38,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-25 13:31:38,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732552175] [2019-11-25 13:31:38,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:31:38,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:31:38,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:31:38,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:31:38,496 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand 10 states. [2019-11-25 13:31:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:31:41,570 INFO L93 Difference]: Finished difference Result 318 states and 374 transitions. [2019-11-25 13:31:41,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 13:31:41,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-25 13:31:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:31:41,574 INFO L225 Difference]: With dead ends: 318 [2019-11-25 13:31:41,575 INFO L226 Difference]: Without dead ends: 318 [2019-11-25 13:31:41,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-11-25 13:31:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-25 13:31:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 232. [2019-11-25 13:31:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 13:31:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 272 transitions. [2019-11-25 13:31:41,587 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 272 transitions. Word has length 22 [2019-11-25 13:31:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:31:41,587 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 272 transitions. [2019-11-25 13:31:41,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:31:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 272 transitions. [2019-11-25 13:31:41,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 13:31:41,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:31:41,589 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:31:41,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 13:31:41,795 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-25 13:31:41,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:31:41,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1143894645, now seen corresponding path program 1 times [2019-11-25 13:31:41,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:31:41,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522888600] [2019-11-25 13:31:41,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-25 13:31:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:31:42,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 13:31:42,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:31:42,015 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_117|], 1=[|v_#valid_174|]} [2019-11-25 13:31:42,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:31:42,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-25 13:31:42,020 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:42,029 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:42,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:31:42,035 INFO L377 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 5 treesize of output 3 [2019-11-25 13:31:42,035 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:42,043 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:42,043 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:42,043 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-25 13:31:42,063 INFO L377 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 [2019-11-25 13:31:42,063 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:42,078 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:42,083 INFO L377 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 [2019-11-25 13:31:42,083 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:42,097 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:42,097 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:31:42,097 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:28 [2019-11-25 13:31:42,212 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:42,212 INFO L377 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 98 treesize of output 112 [2019-11-25 13:31:42,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:42,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:42,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:42,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:42,218 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-25 13:31:42,393 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-11-25 13:31:42,394 INFO L588 ElimStorePlain]: treesize reduction 357, result has 22.4 percent of original size [2019-11-25 13:31:42,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:31:42,402 INFO L377 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 52 treesize of output 45 [2019-11-25 13:31:42,402 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:31:42,440 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:31:42,440 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:31:42,441 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:115, output treesize:93 [2019-11-25 13:31:48,515 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-25 13:31:50,593 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-25 13:31:52,660 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 44 [2019-11-25 13:31:53,107 WARN L192 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-25 13:31:53,108 INFO L343 Elim1Store]: treesize reduction 18, result has 92.4 percent of original size [2019-11-25 13:31:53,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 295 [2019-11-25 13:31:53,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:31:53,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:31:53,627 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 19 xjuncts. [2019-11-25 13:33:45,956 WARN L192 SmtUtils]: Spent 1.87 m on a formula simplification. DAG size of input: 431 DAG size of output: 65 [2019-11-25 13:33:45,958 INFO L588 ElimStorePlain]: treesize reduction 76696, result has 0.6 percent of original size [2019-11-25 13:33:46,440 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-25 13:33:46,441 INFO L343 Elim1Store]: treesize reduction 18, result has 93.9 percent of original size [2019-11-25 13:33:46,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 472 treesize of output 570 [2019-11-25 13:33:46,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:33:46,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:46,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:33:47,059 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 13 xjuncts. [2019-11-25 13:37:58,320 WARN L192 SmtUtils]: Spent 4.19 m on a formula simplification. DAG size of input: 873 DAG size of output: 67 [2019-11-25 13:37:58,322 INFO L588 ElimStorePlain]: treesize reduction 187359, result has 0.3 percent of original size [2019-11-25 13:37:58,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:37:58,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:37:58,330 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-25 13:37:58,331 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:182, output treesize:563 [2019-11-25 13:37:58,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:37:58,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:38:26,595 WARN L192 SmtUtils]: Spent 22.14 s on a formula simplification that was a NOOP. DAG size: 95 [2019-11-25 13:38:26,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:38:26,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:39:47,984 WARN L192 SmtUtils]: Spent 1.19 m on a formula simplification that was a NOOP. DAG size: 98 [2019-11-25 13:40:59,256 WARN L192 SmtUtils]: Spent 1.18 m on a formula simplification that was a NOOP. DAG size: 115 [2019-11-25 13:40:59,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-25 13:40:59,272 INFO L404 ElimStorePlain]: Different costs {42=[|#memory_$Pointer$.offset|], 240=[|#memory_$Pointer$.base|]} [2019-11-25 13:40:59,335 INFO L377 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 [2019-11-25 13:40:59,335 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:40:59,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:40:59,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:40:59,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 10 [2019-11-25 13:40:59,428 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:40:59,469 INFO L377 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 [2019-11-25 13:40:59,470 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 13:40:59,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:40:59,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:40:59,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 10 [2019-11-25 13:40:59,521 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 13:40:59,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:40:59,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:40:59,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 10 [2019-11-25 13:40:59,553 INFO L508 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 13:40:59,973 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-25 13:40:59,973 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:41:00,130 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-11-25 13:41:00,131 INFO L343 Elim1Store]: treesize reduction 54, result has 51.8 percent of original size [2019-11-25 13:41:00,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 77 [2019-11-25 13:41:00,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,133 INFO L508 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 13:41:00,342 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-11-25 13:41:00,342 INFO L343 Elim1Store]: treesize reduction 108, result has 41.6 percent of original size [2019-11-25 13:41:00,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 96 [2019-11-25 13:41:00,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,345 INFO L508 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 13:41:00,445 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-25 13:41:00,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 55 [2019-11-25 13:41:00,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,447 INFO L508 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 13:41:00,564 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-25 13:41:00,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 55 [2019-11-25 13:41:00,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,568 INFO L508 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-25 13:41:00,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:41:00,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:41:00,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:41:00,734 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-25 13:41:00,734 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:41:00,734 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 150 [2019-11-25 13:41:00,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:41:00,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:41:00,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:41:00,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:41:00,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:41:00,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:41:00,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:41:00,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:41:00,744 INFO L508 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-25 13:41:00,802 INFO L588 ElimStorePlain]: treesize reduction 34, result has 38.2 percent of original size [2019-11-25 13:41:00,802 INFO L508 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:41:00,803 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:631, output treesize:21 [2019-11-25 13:41:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:41:00,929 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:41:01,282 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-11-25 13:41:01,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:41:01,771 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:41:01,800 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:41:02,010 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-25 13:41:02,011 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:41:02,027 INFO L508 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:41:02,045 INFO L508 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:41:02,266 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-25 13:41:02,267 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:41:02,268 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-25 13:41:02,268 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:139 [2019-11-25 13:41:05,303 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-25 13:41:11,679 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-25 13:41:22,427 WARN L192 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 56 [2019-11-25 13:41:22,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:41:22,443 INFO L404 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_72|], 6=[|v_#memory_$Pointer$.base_73|]} [2019-11-25 13:41:22,459 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:41:22,488 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:41:23,127 WARN L192 SmtUtils]: Spent 638.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-25 13:41:23,128 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:41:23,141 INFO L508 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:41:23,171 INFO L508 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:41:23,942 WARN L192 SmtUtils]: Spent 769.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-11-25 13:41:23,942 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:41:23,943 INFO L508 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-11-25 13:41:23,943 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:304, output treesize:544 [2019-11-25 13:41:46,568 WARN L192 SmtUtils]: Spent 2.90 s on a formula simplification that was a NOOP. DAG size: 97 [2019-11-25 13:42:32,565 WARN L192 SmtUtils]: Spent 6.29 s on a formula simplification that was a NOOP. DAG size: 98 [2019-11-25 13:43:10,279 WARN L192 SmtUtils]: Spent 5.06 s on a formula simplification that was a NOOP. DAG size: 94 [2019-11-25 13:43:10,292 INFO L404 ElimStorePlain]: Different costs {5=[v_prenex_14, |#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|], 9=[v_prenex_13]} [2019-11-25 13:43:10,418 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:43:10,419 INFO L377 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 1661 treesize of output 1661 [2019-11-25 13:43:10,583 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:43:10,584 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2019-11-25 13:43:10,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:43:10,637 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 13:43:10,640 INFO L404 ElimStorePlain]: Different costs {0=[v_arrayElimCell_55], 1=[v_arrayElimCell_56]} [2019-11-25 13:43:10,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 13:43:10,879 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:303) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:351) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-25 13:43:10,886 INFO L168 Benchmark]: Toolchain (without parser) took 717511.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 955.0 MB in the beginning and 979.7 MB in the end (delta: -24.7 MB). Peak memory consumption was 293.6 MB. Max. memory is 11.5 GB. [2019-11-25 13:43:10,886 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:43:10,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:43:10,887 INFO L168 Benchmark]: Boogie Preprocessor took 102.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:43:10,887 INFO L168 Benchmark]: RCFGBuilder took 1335.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.2 MB). Peak memory consumption was 89.2 MB. Max. memory is 11.5 GB. [2019-11-25 13:43:10,888 INFO L168 Benchmark]: TraceAbstraction took 715377.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.0 GB in the beginning and 979.7 MB in the end (delta: 53.9 MB). Peak memory consumption was 213.3 MB. Max. memory is 11.5 GB. [2019-11-25 13:43:10,890 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 691.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1335.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.2 MB). Peak memory consumption was 89.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 715377.14 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.4 MB). Free memory was 1.0 GB in the beginning and 979.7 MB in the end (delta: 53.9 MB). Peak memory consumption was 213.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...