./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 6692e4fc 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: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-6692e4f [2019-11-25 17:18:39,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:18:39,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:18:39,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:18:39,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:18:39,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:18:39,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:18:39,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:18:39,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:18:39,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:18:39,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:18:39,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:18:39,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:18:39,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:18:39,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:18:39,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:18:39,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:18:39,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:18:39,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:18:39,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:18:39,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:18:39,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:18:39,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:18:39,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:18:39,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:18:39,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:18:39,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:18:39,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:18:39,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:18:39,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:18:39,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:18:39,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:18:39,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:18:39,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:18:39,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:18:39,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:18:39,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:18:39,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:18:39,496 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:18:39,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:18:39,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:18:39,502 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-25 17:18:39,527 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:18:39,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:18:39,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:18:39,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:18:39,531 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:18:39,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:18:39,531 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:18:39,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:18:39,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:18:39,532 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:18:39,534 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:18:39,534 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:18:39,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:18:39,535 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:18:39,535 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:18:39,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:18:39,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:18:39,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:18:39,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:18:39,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:18:39,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:18:39,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:18:39,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:18:39,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:18:39,538 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 17:18:39,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:18:39,898 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:18:39,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:18:39,903 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:18:39,903 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:18:39,904 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 17:18:39,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21dd03126/b25634610dac4621b46586c465788e47/FLAGc99bf3c4f [2019-11-25 17:18:40,496 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:18:40,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-25 17:18:40,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21dd03126/b25634610dac4621b46586c465788e47/FLAGc99bf3c4f [2019-11-25 17:18:40,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21dd03126/b25634610dac4621b46586c465788e47 [2019-11-25 17:18:40,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:18:40,794 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:18:40,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:18:40,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:18:40,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:18:40,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:18:40" (1/1) ... [2019-11-25 17:18:40,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564c4a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:40, skipping insertion in model container [2019-11-25 17:18:40,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:18:40" (1/1) ... [2019-11-25 17:18:40,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:18:40,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:18:41,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:18:41,285 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 17:18:41,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@371ffee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:41, skipping insertion in model container [2019-11-25 17:18:41,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:18:41,286 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-25 17:18:41,289 INFO L168 Benchmark]: Toolchain (without parser) took 494.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -139.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:18:41,290 INFO L168 Benchmark]: CDTParser took 0.13 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 17:18:41,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 491.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -145.0 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-25 17:18:41,293 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.13 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 491.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -145.0 MB). Peak memory consumption was 15.3 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-6692e4f [2019-11-25 17:18:42,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:18:42,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:18:43,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:18:43,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:18:43,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:18:43,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:18:43,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:18:43,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:18:43,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:18:43,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:18:43,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:18:43,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:18:43,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:18:43,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:18:43,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:18:43,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:18:43,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:18:43,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:18:43,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:18:43,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:18:43,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:18:43,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:18:43,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:18:43,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:18:43,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:18:43,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:18:43,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:18:43,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:18:43,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:18:43,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:18:43,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:18:43,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:18:43,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:18:43,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:18:43,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:18:43,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:18:43,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:18:43,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:18:43,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:18:43,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:18:43,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-25 17:18:43,117 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:18:43,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:18:43,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:18:43,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:18:43,122 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:18:43,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:18:43,123 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:18:43,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:18:43,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:18:43,124 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:18:43,124 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:18:43,124 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:18:43,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:18:43,125 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:18:43,125 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 17:18:43,126 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 17:18:43,126 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:18:43,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:18:43,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:18:43,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:18:43,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:18:43,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:18:43,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:18:43,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:18:43,128 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 17:18:43,128 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 17:18:43,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 17:18:43,129 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 17:18:43,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:18:43,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:18:43,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:18:43,487 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:18:43,488 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:18:43,489 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 17:18:43,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fd30a2c/d9f32a3cfe5c4ab0ac26e3d61fcaca07/FLAGb605b142f [2019-11-25 17:18:44,052 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:18:44,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-25 17:18:44,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fd30a2c/d9f32a3cfe5c4ab0ac26e3d61fcaca07/FLAGb605b142f [2019-11-25 17:18:44,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81fd30a2c/d9f32a3cfe5c4ab0ac26e3d61fcaca07 [2019-11-25 17:18:44,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:18:44,396 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:18:44,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:18:44,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:18:44,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:18:44,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:18:44" (1/1) ... [2019-11-25 17:18:44,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3e0ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:44, skipping insertion in model container [2019-11-25 17:18:44,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:18:44" (1/1) ... [2019-11-25 17:18:44,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:18:44,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:18:44,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:18:44,958 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-25 17:18:44,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:18:45,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:18:45,054 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:18:45,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:18:45,193 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:18:45,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45 WrapperNode [2019-11-25 17:18:45,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:18:45,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:18:45,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:18:45,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:18:45,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2019-11-25 17:18:45,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2019-11-25 17:18:45,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2019-11-25 17:18:45,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2019-11-25 17:18:45,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2019-11-25 17:18:45,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2019-11-25 17:18:45,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2019-11-25 17:18:45,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:18:45,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:18:45,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:18:45,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:18:45,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (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 17:18:45,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:18:45,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:18:45,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 17:18:45,336 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 17:18:45,336 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 17:18:45,336 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-25 17:18:45,336 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-25 17:18:45,337 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-25 17:18:45,337 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:18:45,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-25 17:18:45,337 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 17:18:45,337 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 17:18:45,338 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 17:18:45,338 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 17:18:45,338 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 17:18:45,338 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 17:18:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 17:18:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 17:18:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 17:18:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 17:18:45,339 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 17:18:45,340 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 17:18:45,340 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 17:18:45,340 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 17:18:45,340 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 17:18:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 17:18:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 17:18:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 17:18:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 17:18:45,341 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 17:18:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 17:18:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 17:18:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 17:18:45,342 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 17:18:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 17:18:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 17:18:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 17:18:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 17:18:45,343 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 17:18:45,344 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 17:18:45,344 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 17:18:45,344 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 17:18:45,344 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 17:18:45,344 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 17:18:45,345 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 17:18:45,345 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 17:18:45,345 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 17:18:45,345 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 17:18:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 17:18:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 17:18:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 17:18:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 17:18:45,346 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 17:18:45,347 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 17:18:45,347 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 17:18:45,347 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 17:18:45,347 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 17:18:45,347 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 17:18:45,348 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 17:18:45,348 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 17:18:45,348 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 17:18:45,348 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 17:18:45,348 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 17:18:45,349 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:18:45,349 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 17:18:45,349 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:18:45,349 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-25 17:18:45,350 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 17:18:45,350 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 17:18:45,350 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 17:18:45,350 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 17:18:45,350 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 17:18:45,351 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 17:18:45,351 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 17:18:45,351 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 17:18:45,351 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 17:18:45,351 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 17:18:45,352 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 17:18:45,352 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 17:18:45,352 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 17:18:45,352 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 17:18:45,353 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 17:18:45,353 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 17:18:45,353 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 17:18:45,353 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 17:18:45,353 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 17:18:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 17:18:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 17:18:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 17:18:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 17:18:45,354 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 17:18:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 17:18:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 17:18:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 17:18:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 17:18:45,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 17:18:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 17:18:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 17:18:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 17:18:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 17:18:45,356 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 17:18:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 17:18:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 17:18:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 17:18:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 17:18:45,357 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 17:18:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 17:18:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 17:18:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 17:18:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 17:18:45,358 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 17:18:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 17:18:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 17:18:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 17:18:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 17:18:45,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:18:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-25 17:18:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:18:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 17:18:45,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 17:18:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 17:18:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 17:18:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-25 17:18:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:18:45,361 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-25 17:18:45,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:18:45,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 17:18:45,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 17:18:45,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:18:45,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:18:45,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 17:18:46,588 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:18:46,589 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-25 17:18:46,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:18:46 BoogieIcfgContainer [2019-11-25 17:18:46,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:18:46,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:18:46,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:18:46,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:18:46,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:18:44" (1/3) ... [2019-11-25 17:18:46,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fe374d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:18:46, skipping insertion in model container [2019-11-25 17:18:46,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (2/3) ... [2019-11-25 17:18:46,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fe374d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:18:46, skipping insertion in model container [2019-11-25 17:18:46,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:18:46" (3/3) ... [2019-11-25 17:18:46,601 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2019-11-25 17:18:46,613 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:18:46,624 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 92 error locations. [2019-11-25 17:18:46,639 INFO L249 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2019-11-25 17:18:46,665 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:18:46,666 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:18:46,666 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:18:46,667 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:18:46,667 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:18:46,668 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:18:46,668 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:18:46,668 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:18:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-25 17:18:46,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-25 17:18:46,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:18:46,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:18:46,708 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 17:18:46,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:18:46,716 INFO L82 PathProgramCache]: Analyzing trace with hash 696010085, now seen corresponding path program 1 times [2019-11-25 17:18:46,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:18:46,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464705063] [2019-11-25 17:18:46,732 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 17:18:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:18:46,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-25 17:18:46,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:18:46,908 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 17:18:46,909 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:18:46,926 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 17:18:46,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464705063] [2019-11-25 17:18:46,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:18:46,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 17:18:46,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044486108] [2019-11-25 17:18:46,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 17:18:46,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:18:46,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 17:18:46,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 17:18:46,953 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 2 states. [2019-11-25 17:18:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:18:46,987 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2019-11-25 17:18:46,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 17:18:46,989 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-25 17:18:46,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:18:47,001 INFO L225 Difference]: With dead ends: 199 [2019-11-25 17:18:47,002 INFO L226 Difference]: Without dead ends: 196 [2019-11-25 17:18:47,003 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 17:18:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-25 17:18:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-11-25 17:18:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-25 17:18:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2019-11-25 17:18:47,061 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 8 [2019-11-25 17:18:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:18:47,062 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2019-11-25 17:18:47,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 17:18:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2019-11-25 17:18:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 17:18:47,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:18:47,063 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:18:47,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 17:18:47,275 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 17:18:47,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:18:47,278 INFO L82 PathProgramCache]: Analyzing trace with hash 101562384, now seen corresponding path program 1 times [2019-11-25 17:18:47,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:18:47,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949459583] [2019-11-25 17:18:47,281 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 17:18:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:18:47,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 17:18:47,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:18:47,489 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 17:18:47,490 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,496 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:47,497 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:18:47,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:47,554 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 17:18:47,556 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:47,581 INFO L588 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-25 17:18:47,582 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 17:18:47,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-25 17:18:47,606 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 17:18:47,608 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:18:47,632 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 17:18:47,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949459583] [2019-11-25 17:18:47,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:18:47,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 17:18:47,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040404574] [2019-11-25 17:18:47,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:18:47,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:18:47,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:18:47,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:18:47,639 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 5 states. [2019-11-25 17:18:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:18:48,467 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2019-11-25 17:18:48,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:18:48,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-25 17:18:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:18:48,470 INFO L225 Difference]: With dead ends: 190 [2019-11-25 17:18:48,470 INFO L226 Difference]: Without dead ends: 190 [2019-11-25 17:18:48,473 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 17:18:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-25 17:18:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-11-25 17:18:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-25 17:18:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 201 transitions. [2019-11-25 17:18:48,503 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 201 transitions. Word has length 9 [2019-11-25 17:18:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:18:48,507 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 201 transitions. [2019-11-25 17:18:48,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:18:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 201 transitions. [2019-11-25 17:18:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 17:18:48,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:18:48,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:18:48,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 17:18:48,725 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 17:18:48,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:18:48,725 INFO L82 PathProgramCache]: Analyzing trace with hash 101562385, now seen corresponding path program 1 times [2019-11-25 17:18:48,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:18:48,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311692600] [2019-11-25 17:18:48,727 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 17:18:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:18:48,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-25 17:18:48,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:18:48,835 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 17:18:48,835 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:48,847 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:48,855 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 17:18:48,856 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:48,872 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:48,873 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:18:48,873 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-25 17:18:48,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:48,958 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 17:18:48,959 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:48,986 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:48,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:49,000 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 17:18:49,001 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:49,014 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:49,015 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 17:18:49,016 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2019-11-25 17:18:49,045 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 17:18:49,045 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:18:49,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:49,332 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 17:18:49,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311692600] [2019-11-25 17:18:49,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:18:49,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-25 17:18:49,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875265029] [2019-11-25 17:18:49,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:18:49,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:18:49,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:18:49,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:18:49,336 INFO L87 Difference]: Start difference. First operand 190 states and 201 transitions. Second operand 8 states. [2019-11-25 17:18:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:18:54,660 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2019-11-25 17:18:54,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:18:54,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-25 17:18:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:18:54,665 INFO L225 Difference]: With dead ends: 205 [2019-11-25 17:18:54,666 INFO L226 Difference]: Without dead ends: 205 [2019-11-25 17:18:54,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:18:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-25 17:18:54,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-25 17:18:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-25 17:18:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 199 transitions. [2019-11-25 17:18:54,681 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 199 transitions. Word has length 9 [2019-11-25 17:18:54,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:18:54,682 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 199 transitions. [2019-11-25 17:18:54,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:18:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 199 transitions. [2019-11-25 17:18:54,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 17:18:54,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:18:54,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:18:54,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 17:18:54,893 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 17:18:54,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:18:54,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533154, now seen corresponding path program 1 times [2019-11-25 17:18:54,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:18:54,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895509752] [2019-11-25 17:18:54,896 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 17:18:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:18:54,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 17:18:54,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:18:55,007 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 17:18:55,008 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:55,015 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:55,015 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:18:55,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:18:55,021 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 17:18:55,021 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:18:55,027 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 17:18:55,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895509752] [2019-11-25 17:18:55,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:18:55,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 17:18:55,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410547749] [2019-11-25 17:18:55,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 17:18:55,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:18:55,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 17:18:55,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:18:55,029 INFO L87 Difference]: Start difference. First operand 188 states and 199 transitions. Second operand 3 states. [2019-11-25 17:18:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:18:55,325 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2019-11-25 17:18:55,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 17:18:55,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-25 17:18:55,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:18:55,328 INFO L225 Difference]: With dead ends: 186 [2019-11-25 17:18:55,328 INFO L226 Difference]: Without dead ends: 186 [2019-11-25 17:18:55,328 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 17:18:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-25 17:18:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-25 17:18:55,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-25 17:18:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 197 transitions. [2019-11-25 17:18:55,338 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 197 transitions. Word has length 10 [2019-11-25 17:18:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:18:55,339 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 197 transitions. [2019-11-25 17:18:55,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 17:18:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 197 transitions. [2019-11-25 17:18:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 17:18:55,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:18:55,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:18:55,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 17:18:55,552 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 17:18:55,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:18:55,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1146533153, now seen corresponding path program 1 times [2019-11-25 17:18:55,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:18:55,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375169694] [2019-11-25 17:18:55,555 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 17:18:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:18:55,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 17:18:55,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:18:55,668 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 17:18:55,669 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:55,675 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:55,676 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:18:55,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:18:55,686 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 17:18:55,687 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:18:55,752 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 17:18:55,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375169694] [2019-11-25 17:18:55,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:18:55,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-25 17:18:55,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771100557] [2019-11-25 17:18:55,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:18:55,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:18:55,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:18:55,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:18:55,754 INFO L87 Difference]: Start difference. First operand 186 states and 197 transitions. Second operand 4 states. [2019-11-25 17:18:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:18:56,416 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2019-11-25 17:18:56,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 17:18:56,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-25 17:18:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:18:56,418 INFO L225 Difference]: With dead ends: 184 [2019-11-25 17:18:56,418 INFO L226 Difference]: Without dead ends: 184 [2019-11-25 17:18:56,418 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 17:18:56,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-25 17:18:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-11-25 17:18:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-25 17:18:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 195 transitions. [2019-11-25 17:18:56,427 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 195 transitions. Word has length 10 [2019-11-25 17:18:56,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:18:56,427 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 195 transitions. [2019-11-25 17:18:56,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:18:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 195 transitions. [2019-11-25 17:18:56,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 17:18:56,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:18:56,429 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:18:56,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 17:18:56,637 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 17:18:56,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:18:56,639 INFO L82 PathProgramCache]: Analyzing trace with hash -182531198, now seen corresponding path program 1 times [2019-11-25 17:18:56,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:18:56,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160059982] [2019-11-25 17:18:56,640 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 17:18:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:18:56,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-25 17:18:56,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:18:56,767 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 17:18:56,768 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:56,778 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:56,779 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:18:56,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-11-25 17:18:56,838 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:56,838 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 17:18:56,839 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:56,851 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:56,852 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:18:56,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:19 [2019-11-25 17:18:56,905 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 17:18:56,906 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:56,931 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:56,937 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 17:18:56,938 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:56,961 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:56,962 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 17:18:56,963 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:45, output treesize:15 [2019-11-25 17:18:56,989 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 17:18:56,990 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:56,999 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:57,002 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 17:18:57,003 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:57,007 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:57,008 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 17:18:57,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-25 17:18:57,023 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 17:18:57,024 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:18:59,191 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-25 17:18:59,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:59,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:18:59,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:59,576 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:59,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:18:59,589 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:18:59,590 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:18:59,590 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 17:18:59,590 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:87, output treesize:1 [2019-11-25 17:18:59,593 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 17:18:59,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160059982] [2019-11-25 17:18:59,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:18:59,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-25 17:18:59,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175103199] [2019-11-25 17:18:59,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:18:59,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:18:59,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:18:59,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=67, Unknown=1, NotChecked=0, Total=90 [2019-11-25 17:18:59,597 INFO L87 Difference]: Start difference. First operand 184 states and 195 transitions. Second operand 10 states. [2019-11-25 17:19:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:19:01,272 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2019-11-25 17:19:01,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:19:01,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-25 17:19:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:19:01,275 INFO L225 Difference]: With dead ends: 192 [2019-11-25 17:19:01,275 INFO L226 Difference]: Without dead ends: 192 [2019-11-25 17:19:01,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=35, Invalid=96, Unknown=1, NotChecked=0, Total=132 [2019-11-25 17:19:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-25 17:19:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-11-25 17:19:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-25 17:19:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2019-11-25 17:19:01,287 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 15 [2019-11-25 17:19:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:19:01,288 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2019-11-25 17:19:01,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:19:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2019-11-25 17:19:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:19:01,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:19:01,289 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 17:19:01,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 17:19:01,496 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 17:19:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:19:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash 675193263, now seen corresponding path program 1 times [2019-11-25 17:19:01,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:19:01,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27656231] [2019-11-25 17:19:01,498 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 17:19:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:19:01,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 17:19:01,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:19:01,628 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 17:19:01,628 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:19:01,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:01,639 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 17:19:01,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27656231] [2019-11-25 17:19:01,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:19:01,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 17:19:01,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262736071] [2019-11-25 17:19:01,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:19:01,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:19:01,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:19:01,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:19:01,642 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand 4 states. [2019-11-25 17:19:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:19:01,716 INFO L93 Difference]: Finished difference Result 268 states and 284 transitions. [2019-11-25 17:19:01,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:19:01,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-25 17:19:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:19:01,718 INFO L225 Difference]: With dead ends: 268 [2019-11-25 17:19:01,719 INFO L226 Difference]: Without dead ends: 268 [2019-11-25 17:19:01,719 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 17:19:01,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-25 17:19:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 232. [2019-11-25 17:19:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 17:19:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2019-11-25 17:19:01,728 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 17 [2019-11-25 17:19:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:19:01,728 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2019-11-25 17:19:01,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:19:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2019-11-25 17:19:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 17:19:01,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:19:01,733 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 17:19:01,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 17:19:01,935 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 17:19:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:19:01,936 INFO L82 PathProgramCache]: Analyzing trace with hash -543839094, now seen corresponding path program 1 times [2019-11-25 17:19:01,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:19:01,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222115453] [2019-11-25 17:19:01,937 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 17:19:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:19:02,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 17:19:02,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:19:02,056 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_111|], 1=[|v_#valid_155|]} [2019-11-25 17:19:02,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:19:02,066 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 17:19:02,066 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:02,080 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:02,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:19:02,089 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 17:19:02,090 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:02,100 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:02,101 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 17:19:02,101 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-25 17:19:02,112 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 17:19:02,112 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:19:02,156 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 17:19:02,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222115453] [2019-11-25 17:19:02,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:19:02,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-25 17:19:02,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96215446] [2019-11-25 17:19:02,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 17:19:02,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:19:02,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 17:19:02,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 17:19:02,158 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand 4 states. [2019-11-25 17:19:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:19:03,252 INFO L93 Difference]: Finished difference Result 267 states and 328 transitions. [2019-11-25 17:19:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 17:19:03,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-25 17:19:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:19:03,258 INFO L225 Difference]: With dead ends: 267 [2019-11-25 17:19:03,259 INFO L226 Difference]: Without dead ends: 267 [2019-11-25 17:19:03,259 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 17:19:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-11-25 17:19:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 223. [2019-11-25 17:19:03,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-25 17:19:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 266 transitions. [2019-11-25 17:19:03,268 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 266 transitions. Word has length 18 [2019-11-25 17:19:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:19:03,268 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 266 transitions. [2019-11-25 17:19:03,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 17:19:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 266 transitions. [2019-11-25 17:19:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 17:19:03,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:19:03,270 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 17:19:03,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 17:19:03,476 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 17:19:03,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:19:03,476 INFO L82 PathProgramCache]: Analyzing trace with hash -543839095, now seen corresponding path program 1 times [2019-11-25 17:19:03,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:19:03,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330480608] [2019-11-25 17:19:03,477 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 17:19:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:19:03,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 17:19:03,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:19:03,605 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-25 17:19:03,606 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 17:19:03,607 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:03,614 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:03,615 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 17:19:03,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-25 17:19:03,629 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 17:19:03,629 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:19:03,644 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 17:19:03,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330480608] [2019-11-25 17:19:03,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:19:03,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 17:19:03,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819258667] [2019-11-25 17:19:03,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 17:19:03,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:19:03,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 17:19:03,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:19:03,646 INFO L87 Difference]: Start difference. First operand 223 states and 266 transitions. Second operand 3 states. [2019-11-25 17:19:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:19:03,982 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-11-25 17:19:03,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 17:19:03,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-25 17:19:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:19:03,984 INFO L225 Difference]: With dead ends: 226 [2019-11-25 17:19:03,984 INFO L226 Difference]: Without dead ends: 226 [2019-11-25 17:19:03,985 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 17:19:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-25 17:19:03,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2019-11-25 17:19:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-25 17:19:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2019-11-25 17:19:03,992 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 256 transitions. Word has length 18 [2019-11-25 17:19:03,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:19:03,993 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 256 transitions. [2019-11-25 17:19:03,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 17:19:03,994 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 256 transitions. [2019-11-25 17:19:03,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 17:19:03,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:19:03,995 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 17:19:04,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 17:19:04,205 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 17:19:04,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:19:04,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108428, now seen corresponding path program 1 times [2019-11-25 17:19:04,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:19:04,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618600863] [2019-11-25 17:19:04,207 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 17:19:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:19:04,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 17:19:04,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:19:04,324 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-25 17:19:04,324 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 17:19:04,325 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:04,329 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:04,329 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 17:19:04,330 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-25 17:19:04,347 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 17:19:04,347 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:04,360 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:04,361 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 17:19:04,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-25 17:19:04,379 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 17:19:04,379 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:04,382 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:04,382 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 17:19:04,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-25 17:19:04,391 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 17:19:04,392 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:19:04,400 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 17:19:04,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618600863] [2019-11-25 17:19:04,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:19:04,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 17:19:04,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780091796] [2019-11-25 17:19:04,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:19:04,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:19:04,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:19:04,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:19:04,402 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. Second operand 5 states. [2019-11-25 17:19:05,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:19:05,061 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-11-25 17:19:05,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:19:05,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-25 17:19:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:19:05,065 INFO L225 Difference]: With dead ends: 226 [2019-11-25 17:19:05,065 INFO L226 Difference]: Without dead ends: 226 [2019-11-25 17:19:05,066 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 17:19:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-25 17:19:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 216. [2019-11-25 17:19:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-25 17:19:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2019-11-25 17:19:05,074 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 22 [2019-11-25 17:19:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:19:05,076 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2019-11-25 17:19:05,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:19:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2019-11-25 17:19:05,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 17:19:05,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:19:05,077 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 17:19:05,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 17:19:05,292 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 17:19:05,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:19:05,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1938108427, now seen corresponding path program 1 times [2019-11-25 17:19:05,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:19:05,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577296029] [2019-11-25 17:19:05,294 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 17:19:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:19:05,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 17:19:05,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:19:05,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:05,451 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 17:19:05,451 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:05,491 INFO L588 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-25 17:19:05,493 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 17:19:05,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-25 17:19:05,517 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 17:19:05,517 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:05,536 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:05,541 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 17:19:05,542 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:05,554 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:05,555 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 17:19:05,555 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2019-11-25 17:19:05,613 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 17:19:05,613 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:05,630 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:05,635 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 17:19:05,636 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:05,646 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:05,646 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 17:19:05,646 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-25 17:19:05,665 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 17:19:05,665 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:19:05,991 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 17:19:05,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577296029] [2019-11-25 17:19:05,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:19:05,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-25 17:19:05,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393402543] [2019-11-25 17:19:05,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:19:05,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:19:05,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:19:05,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:19:05,993 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand 10 states. [2019-11-25 17:19:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:19:09,229 INFO L93 Difference]: Finished difference Result 318 states and 374 transitions. [2019-11-25 17:19:09,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 17:19:09,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-25 17:19:09,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:19:09,233 INFO L225 Difference]: With dead ends: 318 [2019-11-25 17:19:09,233 INFO L226 Difference]: Without dead ends: 318 [2019-11-25 17:19:09,234 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 17:19:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-25 17:19:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 232. [2019-11-25 17:19:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-25 17:19:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 272 transitions. [2019-11-25 17:19:09,242 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 272 transitions. Word has length 22 [2019-11-25 17:19:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:19:09,243 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 272 transitions. [2019-11-25 17:19:09,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:19:09,243 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 272 transitions. [2019-11-25 17:19:09,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 17:19:09,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:19:09,244 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 17:19:09,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 17:19:09,451 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 17:19:09,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:19:09,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1143894645, now seen corresponding path program 1 times [2019-11-25 17:19:09,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:19:09,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315549335] [2019-11-25 17:19:09,453 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 17:19:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:19:09,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 17:19:09,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:19:09,668 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_117|], 1=[|v_#valid_174|]} [2019-11-25 17:19:09,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:19:09,675 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 17:19:09,675 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:09,688 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:09,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:19:09,693 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 17:19:09,693 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:09,702 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:09,703 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:19:09,703 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-25 17:19:09,721 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 17:19:09,721 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:09,737 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:09,744 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 17:19:09,744 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:09,757 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:09,758 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 17:19:09,758 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:28 [2019-11-25 17:19:09,884 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:09,885 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 17:19:09,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:09,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:09,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:09,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:09,892 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-25 17:19:10,103 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-11-25 17:19:10,104 INFO L588 ElimStorePlain]: treesize reduction 357, result has 22.4 percent of original size [2019-11-25 17:19:10,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:19:10,116 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 17:19:10,117 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:19:10,150 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:19:10,152 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 17:19:10,152 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:115, output treesize:93 [2019-11-25 17:19:16,203 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-25 17:19:18,259 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-25 17:19:20,328 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 44 [2019-11-25 17:19:20,789 WARN L192 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-25 17:19:20,789 INFO L343 Elim1Store]: treesize reduction 18, result has 92.4 percent of original size [2019-11-25 17:19:20,790 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 17:19:20,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:20,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:20,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:19:21,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:19:21,320 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 19 xjuncts. [2019-11-25 17:21:13,530 WARN L192 SmtUtils]: Spent 1.87 m on a formula simplification. DAG size of input: 431 DAG size of output: 65 [2019-11-25 17:21:13,531 INFO L588 ElimStorePlain]: treesize reduction 76696, result has 0.6 percent of original size [2019-11-25 17:21:14,091 WARN L192 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-25 17:21:14,093 INFO L343 Elim1Store]: treesize reduction 18, result has 93.9 percent of original size [2019-11-25 17:21:14,093 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 17:21:14,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 17:21:14,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:21:14,654 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 13 xjuncts. [2019-11-25 17:26:21,757 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-25 17:26:21,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 17:26:21,959 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:133) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplifyWithStatistics(SmtUtils.java:220) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:583) 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 52 more [2019-11-25 17:26:21,966 INFO L168 Benchmark]: Toolchain (without parser) took 457570.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -282.2 MB). Peak memory consumption was 470.9 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:21,967 INFO L168 Benchmark]: CDTParser took 1.70 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 17:26:21,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:21,967 INFO L168 Benchmark]: Boogie Preprocessor took 85.80 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 17:26:21,968 INFO L168 Benchmark]: RCFGBuilder took 1309.71 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.8 MB). Peak memory consumption was 89.8 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:21,968 INFO L168 Benchmark]: TraceAbstraction took 455373.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -220.0 MB). Peak memory consumption was 392.0 MB. Max. memory is 11.5 GB. [2019-11-25 17:26:21,973 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.70 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 797.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -157.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.80 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 1309.71 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.8 MB). Peak memory consumption was 89.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 455373.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -220.0 MB). Peak memory consumption was 392.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...