./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b080422d226ffd628438a4bd0a3f8daac94fceb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b080422d226ffd628438a4bd0a3f8daac94fceb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 19:44:36,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:44:36,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:44:36,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:44:36,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:44:36,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:44:36,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:44:36,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:44:36,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:44:36,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:44:36,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:44:36,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:44:36,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:44:36,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:44:36,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:44:36,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:44:36,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:44:36,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:44:36,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:44:36,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:44:36,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:44:36,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:44:36,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:44:36,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:44:36,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:44:36,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:44:36,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:44:36,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:44:36,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:44:36,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:44:36,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:44:36,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:44:36,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:44:36,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:44:36,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:44:36,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:44:36,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:44:36,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:44:36,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:44:36,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:44:36,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:44:36,659 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 19:44:36,682 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:44:36,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:44:36,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:44:36,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:44:36,694 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:44:36,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:44:36,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:44:36,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:44:36,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:44:36,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:44:36,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 19:44:36,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 19:44:36,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 19:44:36,696 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:44:36,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 19:44:36,697 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:44:36,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 19:44:36,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:44:36,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:44:36,698 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 19:44:36,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 19:44:36,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:44:36,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:44:36,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 19:44:36,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 19:44:36,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 19:44:36,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 19:44:36,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 19:44:36,701 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b080422d226ffd628438a4bd0a3f8daac94fceb [2019-11-15 19:44:36,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:44:36,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:44:36,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:44:36,738 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:44:36,739 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:44:36,739 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-1.c [2019-11-15 19:44:36,788 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/data/0736efcda/5a340266eb9a43d39d429b894680f93f/FLAGe72474b00 [2019-11-15 19:44:37,347 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:44:37,347 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-1.c [2019-11-15 19:44:37,374 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/data/0736efcda/5a340266eb9a43d39d429b894680f93f/FLAGe72474b00 [2019-11-15 19:44:37,808 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/data/0736efcda/5a340266eb9a43d39d429b894680f93f [2019-11-15 19:44:37,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:44:37,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 19:44:37,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:44:37,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:44:37,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:44:37,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:44:37" (1/1) ... [2019-11-15 19:44:37,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8016c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:37, skipping insertion in model container [2019-11-15 19:44:37,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:44:37" (1/1) ... [2019-11-15 19:44:37,838 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:44:37,913 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:44:38,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:44:38,427 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:44:38,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:44:38,557 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:44:38,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38 WrapperNode [2019-11-15 19:44:38,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:44:38,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 19:44:38,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 19:44:38,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 19:44:38,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 19:44:38,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:44:38,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:44:38,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:44:38,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:44:38,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:44:38,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:44:38,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:44:38,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/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-15 19:44:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 19:44:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 19:44:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 19:44:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 19:44:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 19:44:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 19:44:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:44:38,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:44:39,170 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 19:44:39,959 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 19:44:39,959 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 19:44:39,960 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:44:39,962 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 19:44:39,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:44:39 BoogieIcfgContainer [2019-11-15 19:44:39,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:44:39,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 19:44:39,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 19:44:39,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 19:44:39,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 07:44:37" (1/3) ... [2019-11-15 19:44:39,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c481843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:44:39, skipping insertion in model container [2019-11-15 19:44:39,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (2/3) ... [2019-11-15 19:44:39,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c481843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:44:39, skipping insertion in model container [2019-11-15 19:44:39,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:44:39" (3/3) ... [2019-11-15 19:44:39,972 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-1.c [2019-11-15 19:44:39,981 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 19:44:39,990 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 19:44:40,000 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 19:44:40,023 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 19:44:40,024 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 19:44:40,024 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 19:44:40,024 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:44:40,024 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:44:40,024 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 19:44:40,024 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:44:40,024 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 19:44:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 19:44:40,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 19:44:40,060 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:40,060 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:40,062 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:40,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-11-15 19:44:40,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:40,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350489974] [2019-11-15 19:44:40,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:40,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:40,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:40,355 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-15 19:44:40,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350489974] [2019-11-15 19:44:40,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:40,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:40,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649653123] [2019-11-15 19:44:40,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:40,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:40,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:40,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:40,375 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-15 19:44:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:40,839 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-15 19:44:40,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:40,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 19:44:40,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:40,853 INFO L225 Difference]: With dead ends: 323 [2019-11-15 19:44:40,853 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 19:44:40,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 19:44:40,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 19:44:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 19:44:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-15 19:44:40,902 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-15 19:44:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:40,902 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-15 19:44:40,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-15 19:44:40,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 19:44:40,905 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:40,906 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:40,906 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:40,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:40,906 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2019-11-15 19:44:40,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:40,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545914573] [2019-11-15 19:44:40,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:40,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:40,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:41,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545914573] [2019-11-15 19:44:41,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:41,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:41,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026766721] [2019-11-15 19:44:41,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:41,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:41,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:41,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:41,061 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-15 19:44:41,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:41,424 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-15 19:44:41,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:41,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-15 19:44:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:41,427 INFO L225 Difference]: With dead ends: 290 [2019-11-15 19:44:41,427 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 19:44:41,429 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 19:44:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 19:44:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 19:44:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-15 19:44:41,443 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-15 19:44:41,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:41,443 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-15 19:44:41,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-15 19:44:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 19:44:41,448 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:41,449 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:41,449 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:41,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:41,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2019-11-15 19:44:41,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:41,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105194623] [2019-11-15 19:44:41,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:41,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:41,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:41,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105194623] [2019-11-15 19:44:41,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:41,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:41,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392164391] [2019-11-15 19:44:41,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:41,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:41,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:41,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:41,563 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-15 19:44:41,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:41,974 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-15 19:44:41,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:41,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 19:44:41,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:41,977 INFO L225 Difference]: With dead ends: 289 [2019-11-15 19:44:41,977 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 19:44:41,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 19:44:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-15 19:44:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 19:44:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-15 19:44:41,991 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-15 19:44:41,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:41,991 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-15 19:44:41,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:41,991 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-15 19:44:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 19:44:42,000 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:42,001 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:42,001 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:42,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:42,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2019-11-15 19:44:42,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:42,002 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020754720] [2019-11-15 19:44:42,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:42,002 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:42,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:42,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020754720] [2019-11-15 19:44:42,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:42,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:42,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684727650] [2019-11-15 19:44:42,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:42,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:42,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:42,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:42,107 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-15 19:44:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:42,405 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-15 19:44:42,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:42,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 19:44:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:42,407 INFO L225 Difference]: With dead ends: 287 [2019-11-15 19:44:42,407 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 19:44:42,408 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 19:44:42,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-15 19:44:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 19:44:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-15 19:44:42,418 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-15 19:44:42,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:42,418 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-15 19:44:42,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-15 19:44:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 19:44:42,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:42,420 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:42,421 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:42,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:42,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2019-11-15 19:44:42,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:42,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803361685] [2019-11-15 19:44:42,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:42,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:42,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:42,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:42,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803361685] [2019-11-15 19:44:42,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:42,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:42,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398220858] [2019-11-15 19:44:42,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:42,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:42,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:42,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:42,481 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-15 19:44:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:42,756 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-15 19:44:42,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:42,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 19:44:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:42,758 INFO L225 Difference]: With dead ends: 286 [2019-11-15 19:44:42,758 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 19:44:42,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:42,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 19:44:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 19:44:42,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 19:44:42,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-15 19:44:42,776 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-15 19:44:42,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:42,777 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-15 19:44:42,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:42,777 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-15 19:44:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 19:44:42,778 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:42,778 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:42,778 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:42,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:42,779 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2019-11-15 19:44:42,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:42,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273049430] [2019-11-15 19:44:42,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:42,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:42,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:42,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273049430] [2019-11-15 19:44:42,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:42,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:42,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653566674] [2019-11-15 19:44:42,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:42,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:42,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:42,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:42,860 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-15 19:44:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:43,161 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-15 19:44:43,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:43,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 19:44:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:43,163 INFO L225 Difference]: With dead ends: 286 [2019-11-15 19:44:43,163 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 19:44:43,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 19:44:43,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 19:44:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 19:44:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-15 19:44:43,171 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-15 19:44:43,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:43,171 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-15 19:44:43,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:43,171 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-15 19:44:43,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 19:44:43,173 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:43,173 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:43,173 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:43,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:43,174 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2019-11-15 19:44:43,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:43,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565823923] [2019-11-15 19:44:43,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:43,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:43,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:43,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565823923] [2019-11-15 19:44:43,228 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:43,228 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:43,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510268546] [2019-11-15 19:44:43,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:43,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:43,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:43,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:43,229 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-15 19:44:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:43,496 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-15 19:44:43,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:43,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-15 19:44:43,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:43,497 INFO L225 Difference]: With dead ends: 286 [2019-11-15 19:44:43,498 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 19:44:43,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 19:44:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 19:44:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 19:44:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-15 19:44:43,503 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-15 19:44:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:43,504 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-15 19:44:43,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-15 19:44:43,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 19:44:43,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:43,505 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:43,505 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:43,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:43,506 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2019-11-15 19:44:43,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:43,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215116582] [2019-11-15 19:44:43,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:43,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:43,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:43,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215116582] [2019-11-15 19:44:43,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:43,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:43,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455905951] [2019-11-15 19:44:43,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:43,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:43,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:43,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:43,559 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-15 19:44:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:43,856 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-15 19:44:43,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:43,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-15 19:44:43,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:43,858 INFO L225 Difference]: With dead ends: 286 [2019-11-15 19:44:43,858 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 19:44:43,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:43,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 19:44:43,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 19:44:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 19:44:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-15 19:44:43,862 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-15 19:44:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:43,863 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-15 19:44:43,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-15 19:44:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 19:44:43,864 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:43,864 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:43,864 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2019-11-15 19:44:43,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:43,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906741883] [2019-11-15 19:44:43,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:43,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:43,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:43,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906741883] [2019-11-15 19:44:43,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:43,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:43,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474630348] [2019-11-15 19:44:43,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:43,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:43,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:43,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:43,915 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-15 19:44:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:44,159 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-15 19:44:44,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:44,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 19:44:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:44,160 INFO L225 Difference]: With dead ends: 276 [2019-11-15 19:44:44,160 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 19:44:44,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:44,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 19:44:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-15 19:44:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 19:44:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-15 19:44:44,165 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-15 19:44:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:44,166 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-15 19:44:44,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-15 19:44:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 19:44:44,166 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:44,167 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:44,167 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:44,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2019-11-15 19:44:44,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:44,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344778680] [2019-11-15 19:44:44,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:44,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:44,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:44,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344778680] [2019-11-15 19:44:44,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:44,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:44,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669759269] [2019-11-15 19:44:44,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:44,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:44,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:44,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:44,223 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-15 19:44:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:44,557 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-15 19:44:44,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:44,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 19:44:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:44,570 INFO L225 Difference]: With dead ends: 316 [2019-11-15 19:44:44,570 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 19:44:44,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:44:44,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 19:44:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 19:44:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 19:44:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-15 19:44:44,576 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-15 19:44:44,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:44,577 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-15 19:44:44,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:44,577 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-15 19:44:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 19:44:44,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:44,578 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:44,578 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:44,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2019-11-15 19:44:44,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:44,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077461480] [2019-11-15 19:44:44,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:44,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:44,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:44,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077461480] [2019-11-15 19:44:44,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:44,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:44,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359720164] [2019-11-15 19:44:44,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:44,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:44,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:44,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:44,669 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-15 19:44:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:45,002 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-15 19:44:45,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:45,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 19:44:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:45,004 INFO L225 Difference]: With dead ends: 338 [2019-11-15 19:44:45,004 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 19:44:45,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:44:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 19:44:45,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 19:44:45,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 19:44:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-15 19:44:45,014 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-15 19:44:45,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:45,014 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-15 19:44:45,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:45,015 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-15 19:44:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 19:44:45,015 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:45,016 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:45,016 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:45,016 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2019-11-15 19:44:45,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:45,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328946715] [2019-11-15 19:44:45,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:45,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:45,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:45,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328946715] [2019-11-15 19:44:45,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:45,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:45,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689049583] [2019-11-15 19:44:45,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:45,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:45,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:45,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:45,077 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-15 19:44:45,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:45,421 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-15 19:44:45,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:45,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 19:44:45,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:45,423 INFO L225 Difference]: With dead ends: 337 [2019-11-15 19:44:45,423 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 19:44:45,424 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:44:45,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 19:44:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-15 19:44:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 19:44:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-15 19:44:45,431 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-15 19:44:45,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:45,432 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-15 19:44:45,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-15 19:44:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 19:44:45,433 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:45,435 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:45,435 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:45,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2019-11-15 19:44:45,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:45,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611556702] [2019-11-15 19:44:45,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:45,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:45,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:45,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611556702] [2019-11-15 19:44:45,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:45,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:45,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3980429] [2019-11-15 19:44:45,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:45,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:45,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:45,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:45,501 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-15 19:44:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:45,830 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-15 19:44:45,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:45,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 19:44:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:45,832 INFO L225 Difference]: With dead ends: 335 [2019-11-15 19:44:45,832 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 19:44:45,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:44:45,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 19:44:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-15 19:44:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 19:44:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-15 19:44:45,838 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-15 19:44:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:45,840 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-15 19:44:45,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-15 19:44:45,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 19:44:45,841 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:45,841 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:45,841 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:45,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2019-11-15 19:44:45,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:45,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555989840] [2019-11-15 19:44:45,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:45,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:45,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:45,889 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:45,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555989840] [2019-11-15 19:44:45,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:45,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:45,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740894550] [2019-11-15 19:44:45,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:45,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:45,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:45,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:45,896 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-15 19:44:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:46,202 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-15 19:44:46,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:46,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 19:44:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:46,203 INFO L225 Difference]: With dead ends: 334 [2019-11-15 19:44:46,204 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 19:44:46,204 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:44:46,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 19:44:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 19:44:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 19:44:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-15 19:44:46,209 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-15 19:44:46,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:46,209 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-15 19:44:46,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-15 19:44:46,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 19:44:46,210 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:46,211 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:46,211 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:46,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:46,211 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2019-11-15 19:44:46,211 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:46,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360362490] [2019-11-15 19:44:46,211 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:46,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:46,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:46,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360362490] [2019-11-15 19:44:46,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:46,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:46,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899838366] [2019-11-15 19:44:46,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:46,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:46,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:46,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:46,284 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-15 19:44:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:46,597 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-15 19:44:46,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:46,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 19:44:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:46,599 INFO L225 Difference]: With dead ends: 334 [2019-11-15 19:44:46,599 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 19:44:46,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:44:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 19:44:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 19:44:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 19:44:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-15 19:44:46,605 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-15 19:44:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:46,605 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-15 19:44:46,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-15 19:44:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 19:44:46,606 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:46,606 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:46,606 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:46,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2019-11-15 19:44:46,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:46,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348529262] [2019-11-15 19:44:46,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:46,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:46,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:46,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348529262] [2019-11-15 19:44:46,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:46,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:46,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192613986] [2019-11-15 19:44:46,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:46,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:46,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:46,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:46,643 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-15 19:44:46,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:46,950 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-15 19:44:46,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:46,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 19:44:46,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:46,952 INFO L225 Difference]: With dead ends: 334 [2019-11-15 19:44:46,952 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 19:44:46,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:44:46,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 19:44:46,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 19:44:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 19:44:46,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-15 19:44:46,957 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-15 19:44:46,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:46,957 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-15 19:44:46,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:46,958 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-15 19:44:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 19:44:46,958 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:46,958 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:46,958 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:46,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:46,959 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2019-11-15 19:44:46,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:46,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021586722] [2019-11-15 19:44:46,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:46,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:46,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:47,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021586722] [2019-11-15 19:44:47,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:47,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:47,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057273102] [2019-11-15 19:44:47,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:47,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:47,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:47,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:47,001 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-15 19:44:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:47,340 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-15 19:44:47,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:47,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 19:44:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:47,342 INFO L225 Difference]: With dead ends: 334 [2019-11-15 19:44:47,342 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 19:44:47,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:44:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 19:44:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 19:44:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 19:44:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-15 19:44:47,347 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-15 19:44:47,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:47,347 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-15 19:44:47,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:47,347 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-15 19:44:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 19:44:47,348 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:47,349 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:47,349 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:47,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:47,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2019-11-15 19:44:47,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:47,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041071004] [2019-11-15 19:44:47,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:47,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:47,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:47,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041071004] [2019-11-15 19:44:47,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:47,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:47,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587199879] [2019-11-15 19:44:47,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:47,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:47,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:47,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:47,396 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-15 19:44:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:47,684 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-15 19:44:47,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:47,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-15 19:44:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:47,686 INFO L225 Difference]: With dead ends: 324 [2019-11-15 19:44:47,686 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 19:44:47,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:44:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 19:44:47,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-15 19:44:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 19:44:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-15 19:44:47,693 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-15 19:44:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:47,693 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-15 19:44:47,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-15 19:44:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 19:44:47,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:47,694 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:47,694 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:47,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2019-11-15 19:44:47,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:47,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186635897] [2019-11-15 19:44:47,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:47,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:47,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:47,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186635897] [2019-11-15 19:44:47,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:47,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:47,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236448395] [2019-11-15 19:44:47,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:47,769 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:47,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:47,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:47,769 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-15 19:44:48,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:48,241 INFO L93 Difference]: Finished difference Result 422 states and 635 transitions. [2019-11-15 19:44:48,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:48,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 19:44:48,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:48,243 INFO L225 Difference]: With dead ends: 422 [2019-11-15 19:44:48,243 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 19:44:48,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:48,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 19:44:48,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 198. [2019-11-15 19:44:48,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-15 19:44:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-15 19:44:48,250 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-15 19:44:48,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:48,250 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-15 19:44:48,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:48,250 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-15 19:44:48,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 19:44:48,251 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:48,251 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:48,251 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:48,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:48,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2019-11-15 19:44:48,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:48,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234901052] [2019-11-15 19:44:48,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:48,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:48,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:48,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234901052] [2019-11-15 19:44:48,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:48,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:48,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216528363] [2019-11-15 19:44:48,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:48,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:48,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:48,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:48,326 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-15 19:44:48,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:48,637 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-15 19:44:48,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:48,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 19:44:48,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:48,639 INFO L225 Difference]: With dead ends: 427 [2019-11-15 19:44:48,639 INFO L226 Difference]: Without dead ends: 248 [2019-11-15 19:44:48,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-15 19:44:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-15 19:44:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-15 19:44:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-15 19:44:48,681 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-15 19:44:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:48,681 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-15 19:44:48,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-15 19:44:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 19:44:48,681 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:48,682 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:48,682 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:48,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:48,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2019-11-15 19:44:48,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:48,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625223041] [2019-11-15 19:44:48,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:48,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:48,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:48,737 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:48,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625223041] [2019-11-15 19:44:48,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:48,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:48,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945703742] [2019-11-15 19:44:48,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:48,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:48,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:48,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:48,739 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-15 19:44:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:49,185 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2019-11-15 19:44:49,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:49,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 19:44:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:49,187 INFO L225 Difference]: With dead ends: 492 [2019-11-15 19:44:49,187 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 19:44:49,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 19:44:49,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 223. [2019-11-15 19:44:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-15 19:44:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-15 19:44:49,193 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-15 19:44:49,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:49,193 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-15 19:44:49,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-15 19:44:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 19:44:49,194 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:49,194 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:49,195 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:49,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:49,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2019-11-15 19:44:49,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:49,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382656192] [2019-11-15 19:44:49,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:49,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:49,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:49,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382656192] [2019-11-15 19:44:49,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:49,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:49,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461292004] [2019-11-15 19:44:49,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:49,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:49,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:49,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:49,269 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-15 19:44:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:49,693 INFO L93 Difference]: Finished difference Result 493 states and 757 transitions. [2019-11-15 19:44:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:49,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-15 19:44:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:49,697 INFO L225 Difference]: With dead ends: 493 [2019-11-15 19:44:49,697 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 19:44:49,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 19:44:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 233. [2019-11-15 19:44:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-15 19:44:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-15 19:44:49,705 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-11-15 19:44:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:49,705 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-15 19:44:49,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-15 19:44:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 19:44:49,706 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:49,706 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:49,707 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:49,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:49,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2019-11-15 19:44:49,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:49,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589897504] [2019-11-15 19:44:49,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:49,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:49,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:49,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589897504] [2019-11-15 19:44:49,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:49,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:49,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47133143] [2019-11-15 19:44:49,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:49,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:49,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:49,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:49,791 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-15 19:44:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:50,211 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2019-11-15 19:44:50,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:50,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-15 19:44:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:50,213 INFO L225 Difference]: With dead ends: 497 [2019-11-15 19:44:50,213 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 19:44:50,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 19:44:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-15 19:44:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 19:44:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-15 19:44:50,220 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-11-15 19:44:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:50,220 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-15 19:44:50,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-15 19:44:50,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 19:44:50,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:50,222 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:50,222 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:50,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:50,223 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2019-11-15 19:44:50,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:50,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423571946] [2019-11-15 19:44:50,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:50,224 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:50,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:50,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423571946] [2019-11-15 19:44:50,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:50,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:50,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50505420] [2019-11-15 19:44:50,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:50,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:50,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:50,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:50,290 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-15 19:44:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:50,668 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2019-11-15 19:44:50,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:50,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 19:44:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:50,670 INFO L225 Difference]: With dead ends: 498 [2019-11-15 19:44:50,670 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 19:44:50,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:50,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 19:44:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-11-15 19:44:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 19:44:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-15 19:44:50,677 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-15 19:44:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:50,677 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-15 19:44:50,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-15 19:44:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 19:44:50,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:50,678 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:50,679 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:50,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:50,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2019-11-15 19:44:50,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:50,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937055696] [2019-11-15 19:44:50,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:50,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:50,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:50,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937055696] [2019-11-15 19:44:50,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:50,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:50,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100495397] [2019-11-15 19:44:50,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:50,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:50,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:50,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:50,746 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-15 19:44:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:51,104 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-15 19:44:51,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:51,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 19:44:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:51,106 INFO L225 Difference]: With dead ends: 475 [2019-11-15 19:44:51,106 INFO L226 Difference]: Without dead ends: 260 [2019-11-15 19:44:51,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-15 19:44:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-15 19:44:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 19:44:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-15 19:44:51,114 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-15 19:44:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:51,114 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-15 19:44:51,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-15 19:44:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 19:44:51,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:51,116 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:51,116 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:51,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2019-11-15 19:44:51,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:51,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173797111] [2019-11-15 19:44:51,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:51,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:51,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:51,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173797111] [2019-11-15 19:44:51,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:51,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:51,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917813518] [2019-11-15 19:44:51,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:51,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:51,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:51,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:51,175 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-15 19:44:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:51,616 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-15 19:44:51,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:51,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 19:44:51,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:51,618 INFO L225 Difference]: With dead ends: 497 [2019-11-15 19:44:51,619 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 19:44:51,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 19:44:51,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-15 19:44:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 19:44:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-15 19:44:51,626 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-15 19:44:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:51,626 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-15 19:44:51,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-15 19:44:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 19:44:51,627 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:51,627 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:51,628 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:51,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2019-11-15 19:44:51,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:51,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285055227] [2019-11-15 19:44:51,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:51,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:51,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:51,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285055227] [2019-11-15 19:44:51,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:51,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:51,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859655073] [2019-11-15 19:44:51,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:51,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:51,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:51,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:51,696 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-15 19:44:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:52,093 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2019-11-15 19:44:52,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:52,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 19:44:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:52,095 INFO L225 Difference]: With dead ends: 495 [2019-11-15 19:44:52,095 INFO L226 Difference]: Without dead ends: 280 [2019-11-15 19:44:52,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:52,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-15 19:44:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2019-11-15 19:44:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 19:44:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-15 19:44:52,102 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-15 19:44:52,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:52,102 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-15 19:44:52,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-15 19:44:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 19:44:52,103 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:52,104 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:52,104 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:52,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:52,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2019-11-15 19:44:52,104 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:52,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56898702] [2019-11-15 19:44:52,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:52,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:52,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:52,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56898702] [2019-11-15 19:44:52,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:52,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:52,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473917297] [2019-11-15 19:44:52,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:52,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:52,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:52,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:52,162 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-15 19:44:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:52,557 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2019-11-15 19:44:52,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:52,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 19:44:52,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:52,560 INFO L225 Difference]: With dead ends: 494 [2019-11-15 19:44:52,560 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 19:44:52,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:52,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 19:44:52,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2019-11-15 19:44:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 19:44:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-15 19:44:52,566 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-15 19:44:52,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:52,566 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-15 19:44:52,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-15 19:44:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 19:44:52,567 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:52,567 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:52,568 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:52,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:52,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2019-11-15 19:44:52,569 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:52,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134152231] [2019-11-15 19:44:52,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:52,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:52,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 19:44:52,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134152231] [2019-11-15 19:44:52,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:52,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:44:52,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112830700] [2019-11-15 19:44:52,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:44:52,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:52,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:44:52,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:52,640 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-15 19:44:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:53,128 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-15 19:44:53,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:44:53,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-15 19:44:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:53,130 INFO L225 Difference]: With dead ends: 470 [2019-11-15 19:44:53,130 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 19:44:53,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:44:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 19:44:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-15 19:44:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 19:44:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-15 19:44:53,137 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-15 19:44:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:53,137 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-15 19:44:53,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:44:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-15 19:44:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 19:44:53,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:53,138 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:53,139 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:53,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:53,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2019-11-15 19:44:53,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:53,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653460849] [2019-11-15 19:44:53,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:53,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:53,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:53,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653460849] [2019-11-15 19:44:53,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:53,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:53,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168821836] [2019-11-15 19:44:53,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:53,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:53,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:53,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:53,198 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-15 19:44:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:53,498 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-15 19:44:53,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:53,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 19:44:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:53,500 INFO L225 Difference]: With dead ends: 512 [2019-11-15 19:44:53,500 INFO L226 Difference]: Without dead ends: 277 [2019-11-15 19:44:53,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-15 19:44:53,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-15 19:44:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 19:44:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-15 19:44:53,508 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-15 19:44:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:53,509 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-15 19:44:53,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-15 19:44:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 19:44:53,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:53,510 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:53,511 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:53,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:53,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2019-11-15 19:44:53,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:53,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809697887] [2019-11-15 19:44:53,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:53,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:53,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:53,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809697887] [2019-11-15 19:44:53,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:53,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:53,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268305367] [2019-11-15 19:44:53,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:53,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:53,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:53,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:53,571 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-15 19:44:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:53,855 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-15 19:44:53,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:53,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 19:44:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:53,857 INFO L225 Difference]: With dead ends: 511 [2019-11-15 19:44:53,858 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 19:44:53,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 19:44:53,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 19:44:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 19:44:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-15 19:44:53,865 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-15 19:44:53,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:53,865 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-15 19:44:53,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-15 19:44:53,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 19:44:53,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:53,867 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:53,867 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:53,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:53,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2019-11-15 19:44:53,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:53,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274924082] [2019-11-15 19:44:53,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:53,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:53,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:53,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274924082] [2019-11-15 19:44:53,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:53,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:53,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575502131] [2019-11-15 19:44:53,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:53,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:53,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:53,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:53,953 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-15 19:44:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:54,363 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2019-11-15 19:44:54,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:54,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 19:44:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:54,365 INFO L225 Difference]: With dead ends: 534 [2019-11-15 19:44:54,365 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 19:44:54,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 19:44:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-15 19:44:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 19:44:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-15 19:44:54,373 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-15 19:44:54,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:54,374 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-15 19:44:54,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-15 19:44:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 19:44:54,375 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:54,375 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:54,376 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:54,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:54,376 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2019-11-15 19:44:54,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:54,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584425727] [2019-11-15 19:44:54,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:54,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:54,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:54,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584425727] [2019-11-15 19:44:54,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:54,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:54,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522384455] [2019-11-15 19:44:54,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:54,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:54,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:54,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:54,428 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-15 19:44:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:54,766 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-15 19:44:54,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:54,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 19:44:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:54,768 INFO L225 Difference]: With dead ends: 511 [2019-11-15 19:44:54,768 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 19:44:54,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 19:44:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 19:44:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 19:44:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-15 19:44:54,777 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-15 19:44:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:54,777 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-15 19:44:54,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-15 19:44:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 19:44:54,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:54,779 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:54,780 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:54,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:54,780 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2019-11-15 19:44:54,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:54,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778753704] [2019-11-15 19:44:54,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:54,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:54,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:54,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778753704] [2019-11-15 19:44:54,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:54,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:54,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818061542] [2019-11-15 19:44:54,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:54,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:54,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:54,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:54,842 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-15 19:44:55,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:55,228 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2019-11-15 19:44:55,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:55,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 19:44:55,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:55,230 INFO L225 Difference]: With dead ends: 534 [2019-11-15 19:44:55,230 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 19:44:55,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:55,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 19:44:55,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-15 19:44:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 19:44:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-15 19:44:55,237 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-15 19:44:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:55,237 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-15 19:44:55,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-15 19:44:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 19:44:55,239 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:55,239 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:55,239 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:55,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:55,239 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2019-11-15 19:44:55,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:55,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576900494] [2019-11-15 19:44:55,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:55,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:55,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:55,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576900494] [2019-11-15 19:44:55,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:55,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:55,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718512484] [2019-11-15 19:44:55,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:55,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:55,302 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-15 19:44:55,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:55,586 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-15 19:44:55,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:55,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 19:44:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:55,589 INFO L225 Difference]: With dead ends: 511 [2019-11-15 19:44:55,589 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 19:44:55,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:55,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 19:44:55,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 19:44:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 19:44:55,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-15 19:44:55,596 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-15 19:44:55,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:55,597 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-15 19:44:55,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-15 19:44:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 19:44:55,598 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:55,598 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:55,598 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:55,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2019-11-15 19:44:55,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:55,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441931419] [2019-11-15 19:44:55,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:55,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:55,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:55,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441931419] [2019-11-15 19:44:55,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:55,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:55,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172347911] [2019-11-15 19:44:55,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:55,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:55,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:55,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:55,649 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-15 19:44:56,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:56,057 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2019-11-15 19:44:56,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:56,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 19:44:56,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:56,060 INFO L225 Difference]: With dead ends: 534 [2019-11-15 19:44:56,060 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 19:44:56,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:56,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 19:44:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-11-15 19:44:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 19:44:56,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-15 19:44:56,068 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-15 19:44:56,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:56,068 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-15 19:44:56,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-15 19:44:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 19:44:56,069 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:56,069 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:56,070 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:56,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:56,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2019-11-15 19:44:56,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:56,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051299774] [2019-11-15 19:44:56,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:56,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:56,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:56,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051299774] [2019-11-15 19:44:56,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:56,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:56,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302955987] [2019-11-15 19:44:56,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:56,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:56,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:56,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:56,126 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-15 19:44:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:56,471 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-15 19:44:56,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:56,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 19:44:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:56,473 INFO L225 Difference]: With dead ends: 511 [2019-11-15 19:44:56,473 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 19:44:56,474 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:56,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 19:44:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 19:44:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 19:44:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-15 19:44:56,480 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-15 19:44:56,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:56,480 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-15 19:44:56,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-15 19:44:56,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 19:44:56,481 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:56,481 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:56,482 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:56,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:56,482 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2019-11-15 19:44:56,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:56,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851706786] [2019-11-15 19:44:56,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:56,483 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:56,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:56,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851706786] [2019-11-15 19:44:56,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:56,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:56,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440556739] [2019-11-15 19:44:56,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:56,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:56,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:56,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:56,549 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-15 19:44:56,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:56,917 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2019-11-15 19:44:56,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:56,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 19:44:56,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:56,919 INFO L225 Difference]: With dead ends: 524 [2019-11-15 19:44:56,919 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 19:44:56,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 19:44:56,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-15 19:44:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 19:44:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-15 19:44:56,928 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-15 19:44:56,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:56,929 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-15 19:44:56,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:56,929 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-15 19:44:56,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 19:44:56,930 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:56,930 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:56,931 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:56,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:56,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2019-11-15 19:44:56,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:56,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304016428] [2019-11-15 19:44:56,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:56,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:56,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:57,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304016428] [2019-11-15 19:44:57,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:57,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:57,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535891940] [2019-11-15 19:44:57,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:57,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:57,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:57,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:57,012 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-15 19:44:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:57,293 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-15 19:44:57,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:57,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 19:44:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:57,295 INFO L225 Difference]: With dead ends: 501 [2019-11-15 19:44:57,295 INFO L226 Difference]: Without dead ends: 266 [2019-11-15 19:44:57,296 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-15 19:44:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-15 19:44:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 19:44:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-15 19:44:57,338 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-15 19:44:57,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:57,339 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-15 19:44:57,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-15 19:44:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 19:44:57,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:57,340 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:57,340 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:57,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:57,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2019-11-15 19:44:57,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:57,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597913192] [2019-11-15 19:44:57,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:57,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:57,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:44:57,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597913192] [2019-11-15 19:44:57,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:57,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:57,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80968766] [2019-11-15 19:44:57,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:57,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:57,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:57,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:57,404 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-15 19:44:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:57,742 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2019-11-15 19:44:57,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:57,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 19:44:57,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:57,744 INFO L225 Difference]: With dead ends: 524 [2019-11-15 19:44:57,744 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 19:44:57,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:44:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 19:44:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-11-15 19:44:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 19:44:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-15 19:44:57,751 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-15 19:44:57,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:57,751 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-15 19:44:57,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-15 19:44:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 19:44:57,752 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:57,752 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:57,753 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:57,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:57,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2019-11-15 19:44:57,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:57,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562208320] [2019-11-15 19:44:57,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:57,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:57,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 19:44:57,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562208320] [2019-11-15 19:44:57,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:57,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:44:57,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815747673] [2019-11-15 19:44:57,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:44:57,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:57,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:44:57,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:57,810 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-15 19:44:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:57,861 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-15 19:44:57,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:44:57,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-15 19:44:57,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:57,864 INFO L225 Difference]: With dead ends: 722 [2019-11-15 19:44:57,864 INFO L226 Difference]: Without dead ends: 487 [2019-11-15 19:44:57,864 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-15 19:44:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-15 19:44:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-15 19:44:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-15 19:44:57,879 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-15 19:44:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:57,879 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-15 19:44:57,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:44:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-15 19:44:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 19:44:57,881 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:57,881 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:57,881 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:57,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:57,882 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2019-11-15 19:44:57,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:57,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369444598] [2019-11-15 19:44:57,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:57,882 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:57,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 19:44:57,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369444598] [2019-11-15 19:44:57,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:57,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:44:57,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506701339] [2019-11-15 19:44:57,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:44:57,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:57,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:44:57,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:57,941 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-15 19:44:57,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:57,997 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-15 19:44:57,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:44:57,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 19:44:57,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:58,001 INFO L225 Difference]: With dead ends: 1190 [2019-11-15 19:44:58,001 INFO L226 Difference]: Without dead ends: 722 [2019-11-15 19:44:58,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:58,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-15 19:44:58,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-15 19:44:58,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-15 19:44:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-15 19:44:58,021 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-15 19:44:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:58,021 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-15 19:44:58,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:44:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-15 19:44:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 19:44:58,023 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:58,023 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:58,023 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:58,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:58,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2019-11-15 19:44:58,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:58,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452049545] [2019-11-15 19:44:58,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:58,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:58,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 19:44:58,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452049545] [2019-11-15 19:44:58,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:58,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:44:58,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262893006] [2019-11-15 19:44:58,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:44:58,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:58,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:44:58,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:58,081 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-15 19:44:58,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:58,159 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-15 19:44:58,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:44:58,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 19:44:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:58,165 INFO L225 Difference]: With dead ends: 1656 [2019-11-15 19:44:58,165 INFO L226 Difference]: Without dead ends: 955 [2019-11-15 19:44:58,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:58,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-15 19:44:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-15 19:44:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-15 19:44:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-15 19:44:58,192 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-11-15 19:44:58,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:58,193 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-15 19:44:58,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:44:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-15 19:44:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 19:44:58,196 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:58,196 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:58,196 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:58,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2010094734, now seen corresponding path program 1 times [2019-11-15 19:44:58,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:58,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129332277] [2019-11-15 19:44:58,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:58,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:58,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 19:44:58,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129332277] [2019-11-15 19:44:58,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:58,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:44:58,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119216250] [2019-11-15 19:44:58,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:44:58,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:58,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:44:58,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:58,251 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-15 19:44:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:58,316 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-15 19:44:58,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:44:58,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 19:44:58,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:58,323 INFO L225 Difference]: With dead ends: 2120 [2019-11-15 19:44:58,323 INFO L226 Difference]: Without dead ends: 1186 [2019-11-15 19:44:58,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-15 19:44:58,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-15 19:44:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-15 19:44:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-15 19:44:58,356 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-11-15 19:44:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:58,357 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-15 19:44:58,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:44:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-15 19:44:58,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 19:44:58,359 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:58,359 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:58,359 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:58,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:58,360 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2019-11-15 19:44:58,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:58,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293723193] [2019-11-15 19:44:58,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:58,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:58,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 19:44:58,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293723193] [2019-11-15 19:44:58,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:58,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:44:58,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462526357] [2019-11-15 19:44:58,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:44:58,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:58,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:44:58,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:58,418 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-11-15 19:44:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:58,479 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-11-15 19:44:58,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:44:58,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-15 19:44:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:58,486 INFO L225 Difference]: With dead ends: 1423 [2019-11-15 19:44:58,486 INFO L226 Difference]: Without dead ends: 1421 [2019-11-15 19:44:58,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:58,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-11-15 19:44:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-11-15 19:44:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-15 19:44:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-11-15 19:44:58,525 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-11-15 19:44:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:58,526 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-11-15 19:44:58,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:44:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-11-15 19:44:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-15 19:44:58,529 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:58,529 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:58,530 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:58,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash 990449606, now seen corresponding path program 1 times [2019-11-15 19:44:58,530 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:58,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077901645] [2019-11-15 19:44:58,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:58,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:58,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-15 19:44:58,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077901645] [2019-11-15 19:44:58,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:58,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:44:58,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378077604] [2019-11-15 19:44:58,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:44:58,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:58,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:44:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:58,650 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 3 states. [2019-11-15 19:44:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:58,717 INFO L93 Difference]: Finished difference Result 2120 states and 3120 transitions. [2019-11-15 19:44:58,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:44:58,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-15 19:44:58,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:58,725 INFO L225 Difference]: With dead ends: 2120 [2019-11-15 19:44:58,726 INFO L226 Difference]: Without dead ends: 1652 [2019-11-15 19:44:58,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2019-11-15 19:44:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1652. [2019-11-15 19:44:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-11-15 19:44:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2432 transitions. [2019-11-15 19:44:58,781 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2432 transitions. Word has length 164 [2019-11-15 19:44:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:58,781 INFO L462 AbstractCegarLoop]: Abstraction has 1652 states and 2432 transitions. [2019-11-15 19:44:58,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:44:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2432 transitions. [2019-11-15 19:44:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-15 19:44:58,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:58,785 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:58,785 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1277551777, now seen corresponding path program 1 times [2019-11-15 19:44:58,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:58,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985780338] [2019-11-15 19:44:58,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:58,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:58,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 19:44:58,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985780338] [2019-11-15 19:44:58,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:58,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:58,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830906302] [2019-11-15 19:44:58,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:58,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:58,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:58,874 INFO L87 Difference]: Start difference. First operand 1652 states and 2432 transitions. Second operand 4 states. [2019-11-15 19:44:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:59,362 INFO L93 Difference]: Finished difference Result 3726 states and 5519 transitions. [2019-11-15 19:44:59,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:59,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-15 19:44:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:59,373 INFO L225 Difference]: With dead ends: 3726 [2019-11-15 19:44:59,373 INFO L226 Difference]: Without dead ends: 2093 [2019-11-15 19:44:59,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:44:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2019-11-15 19:44:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1848. [2019-11-15 19:44:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 19:44:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2775 transitions. [2019-11-15 19:44:59,426 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2775 transitions. Word has length 170 [2019-11-15 19:44:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:59,427 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2775 transitions. [2019-11-15 19:44:59,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:44:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2775 transitions. [2019-11-15 19:44:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-15 19:44:59,431 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:59,431 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:59,431 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:44:59,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash 891580692, now seen corresponding path program 1 times [2019-11-15 19:44:59,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:59,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133296303] [2019-11-15 19:44:59,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:59,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:59,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 19:44:59,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133296303] [2019-11-15 19:44:59,511 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:59,511 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:44:59,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547280598] [2019-11-15 19:44:59,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:44:59,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:59,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:44:59,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:44:59,513 INFO L87 Difference]: Start difference. First operand 1848 states and 2775 transitions. Second operand 4 states. [2019-11-15 19:44:59,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:59,960 INFO L93 Difference]: Finished difference Result 3922 states and 5855 transitions. [2019-11-15 19:44:59,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:44:59,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-11-15 19:44:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:59,971 INFO L225 Difference]: With dead ends: 3922 [2019-11-15 19:44:59,971 INFO L226 Difference]: Without dead ends: 2093 [2019-11-15 19:44:59,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:44:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2019-11-15 19:45:00,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1848. [2019-11-15 19:45:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 19:45:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2768 transitions. [2019-11-15 19:45:00,025 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2768 transitions. Word has length 183 [2019-11-15 19:45:00,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:00,025 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2768 transitions. [2019-11-15 19:45:00,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:00,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2768 transitions. [2019-11-15 19:45:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 19:45:00,029 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:00,029 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:00,030 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:00,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:00,030 INFO L82 PathProgramCache]: Analyzing trace with hash -446050215, now seen corresponding path program 1 times [2019-11-15 19:45:00,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:00,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577726945] [2019-11-15 19:45:00,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:00,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:00,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 19:45:00,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577726945] [2019-11-15 19:45:00,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:00,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:00,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817017080] [2019-11-15 19:45:00,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:00,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:00,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:00,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:00,135 INFO L87 Difference]: Start difference. First operand 1848 states and 2768 transitions. Second operand 4 states. [2019-11-15 19:45:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:00,551 INFO L93 Difference]: Finished difference Result 3908 states and 5827 transitions. [2019-11-15 19:45:00,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:00,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-11-15 19:45:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:00,562 INFO L225 Difference]: With dead ends: 3908 [2019-11-15 19:45:00,562 INFO L226 Difference]: Without dead ends: 2079 [2019-11-15 19:45:00,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:00,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2019-11-15 19:45:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1848. [2019-11-15 19:45:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 19:45:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2761 transitions. [2019-11-15 19:45:00,617 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2761 transitions. Word has length 184 [2019-11-15 19:45:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:00,617 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2761 transitions. [2019-11-15 19:45:00,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2761 transitions. [2019-11-15 19:45:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-15 19:45:00,621 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:00,622 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:00,622 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:00,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:00,623 INFO L82 PathProgramCache]: Analyzing trace with hash -983707367, now seen corresponding path program 1 times [2019-11-15 19:45:00,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:00,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053518754] [2019-11-15 19:45:00,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:00,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:00,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 19:45:00,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053518754] [2019-11-15 19:45:00,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:00,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:00,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094276926] [2019-11-15 19:45:00,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:00,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:00,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:00,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:00,704 INFO L87 Difference]: Start difference. First operand 1848 states and 2761 transitions. Second operand 4 states. [2019-11-15 19:45:01,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:01,122 INFO L93 Difference]: Finished difference Result 3901 states and 5806 transitions. [2019-11-15 19:45:01,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:01,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-11-15 19:45:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:01,133 INFO L225 Difference]: With dead ends: 3901 [2019-11-15 19:45:01,133 INFO L226 Difference]: Without dead ends: 2072 [2019-11-15 19:45:01,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-15 19:45:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-15 19:45:01,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 19:45:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2754 transitions. [2019-11-15 19:45:01,183 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2754 transitions. Word has length 184 [2019-11-15 19:45:01,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:01,183 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2754 transitions. [2019-11-15 19:45:01,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:01,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2754 transitions. [2019-11-15 19:45:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 19:45:01,187 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:01,187 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:01,188 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:01,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:01,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1263023272, now seen corresponding path program 1 times [2019-11-15 19:45:01,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:01,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184803518] [2019-11-15 19:45:01,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:01,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:01,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 19:45:01,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184803518] [2019-11-15 19:45:01,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:01,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:01,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658867752] [2019-11-15 19:45:01,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:01,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:01,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:01,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:01,279 INFO L87 Difference]: Start difference. First operand 1848 states and 2754 transitions. Second operand 4 states. [2019-11-15 19:45:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:01,679 INFO L93 Difference]: Finished difference Result 3901 states and 5792 transitions. [2019-11-15 19:45:01,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:01,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-15 19:45:01,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:01,732 INFO L225 Difference]: With dead ends: 3901 [2019-11-15 19:45:01,733 INFO L226 Difference]: Without dead ends: 2072 [2019-11-15 19:45:01,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-15 19:45:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-15 19:45:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 19:45:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2747 transitions. [2019-11-15 19:45:01,780 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2747 transitions. Word has length 185 [2019-11-15 19:45:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:01,781 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2747 transitions. [2019-11-15 19:45:01,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2747 transitions. [2019-11-15 19:45:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 19:45:01,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:01,786 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:01,786 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:01,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:01,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1547746275, now seen corresponding path program 1 times [2019-11-15 19:45:01,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:01,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633841231] [2019-11-15 19:45:01,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:01,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:01,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 19:45:01,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633841231] [2019-11-15 19:45:01,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:01,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:01,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841509027] [2019-11-15 19:45:01,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:01,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:01,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:01,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:01,863 INFO L87 Difference]: Start difference. First operand 1848 states and 2747 transitions. Second operand 4 states. [2019-11-15 19:45:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:02,212 INFO L93 Difference]: Finished difference Result 3901 states and 5778 transitions. [2019-11-15 19:45:02,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:02,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-15 19:45:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:02,224 INFO L225 Difference]: With dead ends: 3901 [2019-11-15 19:45:02,224 INFO L226 Difference]: Without dead ends: 2072 [2019-11-15 19:45:02,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:02,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-15 19:45:02,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-15 19:45:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 19:45:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2740 transitions. [2019-11-15 19:45:02,272 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2740 transitions. Word has length 186 [2019-11-15 19:45:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:02,273 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2740 transitions. [2019-11-15 19:45:02,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:02,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2740 transitions. [2019-11-15 19:45:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-15 19:45:02,277 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:02,277 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:02,277 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:02,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:02,278 INFO L82 PathProgramCache]: Analyzing trace with hash -619567939, now seen corresponding path program 1 times [2019-11-15 19:45:02,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:02,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864954036] [2019-11-15 19:45:02,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:02,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:02,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 19:45:02,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864954036] [2019-11-15 19:45:02,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:02,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:02,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105106970] [2019-11-15 19:45:02,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:02,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:02,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:02,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:02,356 INFO L87 Difference]: Start difference. First operand 1848 states and 2740 transitions. Second operand 4 states. [2019-11-15 19:45:02,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:02,679 INFO L93 Difference]: Finished difference Result 3901 states and 5764 transitions. [2019-11-15 19:45:02,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:02,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-11-15 19:45:02,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:02,684 INFO L225 Difference]: With dead ends: 3901 [2019-11-15 19:45:02,684 INFO L226 Difference]: Without dead ends: 2072 [2019-11-15 19:45:02,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-15 19:45:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-15 19:45:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 19:45:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2733 transitions. [2019-11-15 19:45:02,729 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2733 transitions. Word has length 187 [2019-11-15 19:45:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:02,730 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2733 transitions. [2019-11-15 19:45:02,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2733 transitions. [2019-11-15 19:45:02,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 19:45:02,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:02,734 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:02,735 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:02,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:02,735 INFO L82 PathProgramCache]: Analyzing trace with hash -746153758, now seen corresponding path program 1 times [2019-11-15 19:45:02,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:02,735 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340546788] [2019-11-15 19:45:02,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:02,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:02,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 19:45:02,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340546788] [2019-11-15 19:45:02,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:02,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:02,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590768037] [2019-11-15 19:45:02,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:02,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:02,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:02,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:02,821 INFO L87 Difference]: Start difference. First operand 1848 states and 2733 transitions. Second operand 4 states. [2019-11-15 19:45:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:03,239 INFO L93 Difference]: Finished difference Result 3831 states and 5666 transitions. [2019-11-15 19:45:03,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:03,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-15 19:45:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:03,243 INFO L225 Difference]: With dead ends: 3831 [2019-11-15 19:45:03,243 INFO L226 Difference]: Without dead ends: 2002 [2019-11-15 19:45:03,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-11-15 19:45:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-11-15 19:45:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 19:45:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2726 transitions. [2019-11-15 19:45:03,283 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2726 transitions. Word has length 188 [2019-11-15 19:45:03,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:03,284 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2726 transitions. [2019-11-15 19:45:03,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2726 transitions. [2019-11-15 19:45:03,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-15 19:45:03,287 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:03,288 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:03,288 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:03,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:03,289 INFO L82 PathProgramCache]: Analyzing trace with hash 426346312, now seen corresponding path program 1 times [2019-11-15 19:45:03,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:03,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678829487] [2019-11-15 19:45:03,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:03,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:03,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 19:45:03,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678829487] [2019-11-15 19:45:03,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:03,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:03,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6426771] [2019-11-15 19:45:03,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:03,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:03,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:03,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:03,377 INFO L87 Difference]: Start difference. First operand 1848 states and 2726 transitions. Second operand 4 states. [2019-11-15 19:45:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:03,766 INFO L93 Difference]: Finished difference Result 3831 states and 5652 transitions. [2019-11-15 19:45:03,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:03,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-15 19:45:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:03,770 INFO L225 Difference]: With dead ends: 3831 [2019-11-15 19:45:03,770 INFO L226 Difference]: Without dead ends: 2002 [2019-11-15 19:45:03,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-11-15 19:45:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-11-15 19:45:03,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 19:45:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2719 transitions. [2019-11-15 19:45:03,810 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2719 transitions. Word has length 192 [2019-11-15 19:45:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:03,810 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2719 transitions. [2019-11-15 19:45:03,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2719 transitions. [2019-11-15 19:45:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-15 19:45:03,814 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:03,814 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:03,814 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:03,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash 147913884, now seen corresponding path program 1 times [2019-11-15 19:45:03,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:03,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708317808] [2019-11-15 19:45:03,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:03,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:03,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 19:45:03,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708317808] [2019-11-15 19:45:03,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:03,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:03,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153669123] [2019-11-15 19:45:03,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:03,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:03,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:03,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:03,946 INFO L87 Difference]: Start difference. First operand 1848 states and 2719 transitions. Second operand 4 states. [2019-11-15 19:45:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:04,323 INFO L93 Difference]: Finished difference Result 3831 states and 5638 transitions. [2019-11-15 19:45:04,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:04,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-15 19:45:04,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:04,327 INFO L225 Difference]: With dead ends: 3831 [2019-11-15 19:45:04,328 INFO L226 Difference]: Without dead ends: 2002 [2019-11-15 19:45:04,329 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-11-15 19:45:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-11-15 19:45:04,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 19:45:04,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2712 transitions. [2019-11-15 19:45:04,371 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2712 transitions. Word has length 192 [2019-11-15 19:45:04,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:04,371 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2712 transitions. [2019-11-15 19:45:04,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2712 transitions. [2019-11-15 19:45:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 19:45:04,375 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:04,375 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:04,375 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:04,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash -433619005, now seen corresponding path program 1 times [2019-11-15 19:45:04,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:04,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571897497] [2019-11-15 19:45:04,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:04,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:04,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 19:45:04,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571897497] [2019-11-15 19:45:04,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:04,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:04,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56028358] [2019-11-15 19:45:04,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:04,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:04,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:04,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:04,473 INFO L87 Difference]: Start difference. First operand 1848 states and 2712 transitions. Second operand 4 states. [2019-11-15 19:45:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:04,768 INFO L93 Difference]: Finished difference Result 3803 states and 5585 transitions. [2019-11-15 19:45:04,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:04,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-15 19:45:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:04,772 INFO L225 Difference]: With dead ends: 3803 [2019-11-15 19:45:04,772 INFO L226 Difference]: Without dead ends: 1974 [2019-11-15 19:45:04,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-11-15 19:45:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1848. [2019-11-15 19:45:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 19:45:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2705 transitions. [2019-11-15 19:45:04,815 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2705 transitions. Word has length 193 [2019-11-15 19:45:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:04,816 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2705 transitions. [2019-11-15 19:45:04,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2705 transitions. [2019-11-15 19:45:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 19:45:04,819 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:04,820 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:04,820 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:04,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:04,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1986132087, now seen corresponding path program 1 times [2019-11-15 19:45:04,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:04,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093536510] [2019-11-15 19:45:04,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:04,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:04,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 19:45:04,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093536510] [2019-11-15 19:45:04,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:04,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:04,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626522941] [2019-11-15 19:45:04,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:04,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:04,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:04,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:04,907 INFO L87 Difference]: Start difference. First operand 1848 states and 2705 transitions. Second operand 4 states. [2019-11-15 19:45:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:05,243 INFO L93 Difference]: Finished difference Result 3768 states and 5525 transitions. [2019-11-15 19:45:05,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:05,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-15 19:45:05,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:05,248 INFO L225 Difference]: With dead ends: 3768 [2019-11-15 19:45:05,248 INFO L226 Difference]: Without dead ends: 1939 [2019-11-15 19:45:05,250 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-11-15 19:45:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1848. [2019-11-15 19:45:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 19:45:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2698 transitions. [2019-11-15 19:45:05,291 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2698 transitions. Word has length 193 [2019-11-15 19:45:05,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:05,291 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2698 transitions. [2019-11-15 19:45:05,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2698 transitions. [2019-11-15 19:45:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 19:45:05,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:05,295 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:05,295 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:05,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:05,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1584643734, now seen corresponding path program 1 times [2019-11-15 19:45:05,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:05,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601737459] [2019-11-15 19:45:05,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:05,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:05,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 19:45:05,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601737459] [2019-11-15 19:45:05,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:05,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:05,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238628675] [2019-11-15 19:45:05,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:05,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:05,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:05,391 INFO L87 Difference]: Start difference. First operand 1848 states and 2698 transitions. Second operand 4 states. [2019-11-15 19:45:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:05,771 INFO L93 Difference]: Finished difference Result 4146 states and 6093 transitions. [2019-11-15 19:45:05,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:05,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-11-15 19:45:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:05,776 INFO L225 Difference]: With dead ends: 4146 [2019-11-15 19:45:05,777 INFO L226 Difference]: Without dead ends: 2317 [2019-11-15 19:45:05,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2019-11-15 19:45:05,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2058. [2019-11-15 19:45:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-11-15 19:45:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 3069 transitions. [2019-11-15 19:45:05,824 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 3069 transitions. Word has length 195 [2019-11-15 19:45:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:05,824 INFO L462 AbstractCegarLoop]: Abstraction has 2058 states and 3069 transitions. [2019-11-15 19:45:05,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:05,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 3069 transitions. [2019-11-15 19:45:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 19:45:05,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:05,828 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:05,829 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:05,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:05,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1413225241, now seen corresponding path program 1 times [2019-11-15 19:45:05,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:05,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444843374] [2019-11-15 19:45:05,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:05,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:05,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 19:45:05,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444843374] [2019-11-15 19:45:05,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:05,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:05,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946800277] [2019-11-15 19:45:05,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:05,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:05,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:05,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:05,955 INFO L87 Difference]: Start difference. First operand 2058 states and 3069 transitions. Second operand 4 states. [2019-11-15 19:45:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:06,577 INFO L93 Difference]: Finished difference Result 4799 states and 7183 transitions. [2019-11-15 19:45:06,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:06,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-15 19:45:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:06,583 INFO L225 Difference]: With dead ends: 4799 [2019-11-15 19:45:06,583 INFO L226 Difference]: Without dead ends: 2760 [2019-11-15 19:45:06,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2019-11-15 19:45:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2254. [2019-11-15 19:45:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2019-11-15 19:45:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3412 transitions. [2019-11-15 19:45:06,636 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3412 transitions. Word has length 201 [2019-11-15 19:45:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:06,637 INFO L462 AbstractCegarLoop]: Abstraction has 2254 states and 3412 transitions. [2019-11-15 19:45:06,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3412 transitions. [2019-11-15 19:45:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-15 19:45:06,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:06,641 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:06,641 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:06,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:06,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1046019792, now seen corresponding path program 1 times [2019-11-15 19:45:06,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:06,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539339784] [2019-11-15 19:45:06,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:06,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:06,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 19:45:06,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539339784] [2019-11-15 19:45:06,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:06,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:06,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243947817] [2019-11-15 19:45:06,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:06,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:06,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:06,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:06,757 INFO L87 Difference]: Start difference. First operand 2254 states and 3412 transitions. Second operand 4 states. [2019-11-15 19:45:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:07,265 INFO L93 Difference]: Finished difference Result 4939 states and 7428 transitions. [2019-11-15 19:45:07,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:07,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 202 [2019-11-15 19:45:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:07,270 INFO L225 Difference]: With dead ends: 4939 [2019-11-15 19:45:07,271 INFO L226 Difference]: Without dead ends: 2704 [2019-11-15 19:45:07,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2019-11-15 19:45:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2261. [2019-11-15 19:45:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2019-11-15 19:45:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3419 transitions. [2019-11-15 19:45:07,325 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3419 transitions. Word has length 202 [2019-11-15 19:45:07,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:07,325 INFO L462 AbstractCegarLoop]: Abstraction has 2261 states and 3419 transitions. [2019-11-15 19:45:07,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3419 transitions. [2019-11-15 19:45:07,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-15 19:45:07,329 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:07,329 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:07,329 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:07,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:07,330 INFO L82 PathProgramCache]: Analyzing trace with hash -570945240, now seen corresponding path program 1 times [2019-11-15 19:45:07,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:07,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144881099] [2019-11-15 19:45:07,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:07,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:07,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 133 proven. 4 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-11-15 19:45:07,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144881099] [2019-11-15 19:45:07,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878730431] [2019-11-15 19:45:07,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:07,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 19:45:07,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:45:07,775 INFO L375 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 20 treesize of output 8 [2019-11-15 19:45:07,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:07,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:07,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:07,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:45:07,817 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:45:07,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 19:45:07,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:07,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:07,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:07,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 19:45:07,855 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:45:07,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:45:07,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:07,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:07,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:07,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:45:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 133 proven. 4 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-11-15 19:45:07,945 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:45:07,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 19:45:07,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304081168] [2019-11-15 19:45:07,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 19:45:07,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:07,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 19:45:07,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:45:07,947 INFO L87 Difference]: Start difference. First operand 2261 states and 3419 transitions. Second operand 8 states. [2019-11-15 19:45:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:09,327 INFO L93 Difference]: Finished difference Result 5690 states and 8560 transitions. [2019-11-15 19:45:09,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:45:09,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 206 [2019-11-15 19:45:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:09,340 INFO L225 Difference]: With dead ends: 5690 [2019-11-15 19:45:09,340 INFO L226 Difference]: Without dead ends: 3448 [2019-11-15 19:45:09,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:45:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2019-11-15 19:45:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 2541. [2019-11-15 19:45:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2541 states. [2019-11-15 19:45:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 3923 transitions. [2019-11-15 19:45:09,423 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 3923 transitions. Word has length 206 [2019-11-15 19:45:09,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:09,424 INFO L462 AbstractCegarLoop]: Abstraction has 2541 states and 3923 transitions. [2019-11-15 19:45:09,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 19:45:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 3923 transitions. [2019-11-15 19:45:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-15 19:45:09,432 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:09,432 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:09,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:09,638 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:09,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:09,639 INFO L82 PathProgramCache]: Analyzing trace with hash -526470438, now seen corresponding path program 1 times [2019-11-15 19:45:09,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:09,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393168943] [2019-11-15 19:45:09,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:09,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:09,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 135 proven. 3 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-11-15 19:45:09,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393168943] [2019-11-15 19:45:09,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521691273] [2019-11-15 19:45:09,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:10,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 19:45:10,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:45:10,099 INFO L375 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 20 treesize of output 8 [2019-11-15 19:45:10,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:10,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:10,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:10,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:45:10,119 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:45:10,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 19:45:10,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:10,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:10,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:10,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 19:45:10,147 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:45:10,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:45:10,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:10,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:10,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:10,151 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:45:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 135 proven. 3 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2019-11-15 19:45:10,217 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:45:10,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 19:45:10,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853758672] [2019-11-15 19:45:10,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 19:45:10,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:10,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 19:45:10,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:45:10,220 INFO L87 Difference]: Start difference. First operand 2541 states and 3923 transitions. Second operand 8 states. [2019-11-15 19:45:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:11,609 INFO L93 Difference]: Finished difference Result 6143 states and 9419 transitions. [2019-11-15 19:45:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:45:11,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 207 [2019-11-15 19:45:11,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:11,613 INFO L225 Difference]: With dead ends: 6143 [2019-11-15 19:45:11,613 INFO L226 Difference]: Without dead ends: 3621 [2019-11-15 19:45:11,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:45:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2019-11-15 19:45:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 2632. [2019-11-15 19:45:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2632 states. [2019-11-15 19:45:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 4126 transitions. [2019-11-15 19:45:11,685 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 4126 transitions. Word has length 207 [2019-11-15 19:45:11,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:11,686 INFO L462 AbstractCegarLoop]: Abstraction has 2632 states and 4126 transitions. [2019-11-15 19:45:11,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 19:45:11,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 4126 transitions. [2019-11-15 19:45:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-15 19:45:11,695 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:11,695 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:11,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:11,899 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:11,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:11,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1243630358, now seen corresponding path program 1 times [2019-11-15 19:45:11,900 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:11,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046864249] [2019-11-15 19:45:11,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:11,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:11,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-15 19:45:12,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046864249] [2019-11-15 19:45:12,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:12,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:12,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83287035] [2019-11-15 19:45:12,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:12,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:12,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:12,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:12,014 INFO L87 Difference]: Start difference. First operand 2632 states and 4126 transitions. Second operand 4 states. [2019-11-15 19:45:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:12,466 INFO L93 Difference]: Finished difference Result 5917 states and 9246 transitions. [2019-11-15 19:45:12,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:12,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-11-15 19:45:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:12,470 INFO L225 Difference]: With dead ends: 5917 [2019-11-15 19:45:12,470 INFO L226 Difference]: Without dead ends: 3304 [2019-11-15 19:45:12,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3304 states. [2019-11-15 19:45:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3304 to 2828. [2019-11-15 19:45:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2019-11-15 19:45:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4469 transitions. [2019-11-15 19:45:12,543 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4469 transitions. Word has length 214 [2019-11-15 19:45:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:12,543 INFO L462 AbstractCegarLoop]: Abstraction has 2828 states and 4469 transitions. [2019-11-15 19:45:12,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4469 transitions. [2019-11-15 19:45:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-15 19:45:12,548 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:12,548 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:12,549 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:12,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:12,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2008493869, now seen corresponding path program 1 times [2019-11-15 19:45:12,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:12,549 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934053630] [2019-11-15 19:45:12,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:12,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:12,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:12,661 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-15 19:45:12,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934053630] [2019-11-15 19:45:12,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:12,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:12,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254942757] [2019-11-15 19:45:12,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:12,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:12,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:12,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:12,663 INFO L87 Difference]: Start difference. First operand 2828 states and 4469 transitions. Second operand 4 states. [2019-11-15 19:45:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:13,181 INFO L93 Difference]: Finished difference Result 6057 states and 9491 transitions. [2019-11-15 19:45:13,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:13,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2019-11-15 19:45:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:13,186 INFO L225 Difference]: With dead ends: 6057 [2019-11-15 19:45:13,186 INFO L226 Difference]: Without dead ends: 3248 [2019-11-15 19:45:13,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2019-11-15 19:45:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2632. [2019-11-15 19:45:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2632 states. [2019-11-15 19:45:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 4126 transitions. [2019-11-15 19:45:13,271 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 4126 transitions. Word has length 215 [2019-11-15 19:45:13,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:13,272 INFO L462 AbstractCegarLoop]: Abstraction has 2632 states and 4126 transitions. [2019-11-15 19:45:13,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 4126 transitions. [2019-11-15 19:45:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-15 19:45:13,277 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:13,278 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:13,278 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:13,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:13,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1579191647, now seen corresponding path program 1 times [2019-11-15 19:45:13,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:13,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447384005] [2019-11-15 19:45:13,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:13,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:13,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-15 19:45:13,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447384005] [2019-11-15 19:45:13,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:13,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:13,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261582907] [2019-11-15 19:45:13,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:13,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:13,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:13,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:13,477 INFO L87 Difference]: Start difference. First operand 2632 states and 4126 transitions. Second operand 4 states. [2019-11-15 19:45:14,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:14,043 INFO L93 Difference]: Finished difference Result 5917 states and 9246 transitions. [2019-11-15 19:45:14,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:14,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2019-11-15 19:45:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:14,047 INFO L225 Difference]: With dead ends: 5917 [2019-11-15 19:45:14,048 INFO L226 Difference]: Without dead ends: 3304 [2019-11-15 19:45:14,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3304 states. [2019-11-15 19:45:14,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3304 to 2828. [2019-11-15 19:45:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2019-11-15 19:45:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4469 transitions. [2019-11-15 19:45:14,122 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4469 transitions. Word has length 215 [2019-11-15 19:45:14,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:14,122 INFO L462 AbstractCegarLoop]: Abstraction has 2828 states and 4469 transitions. [2019-11-15 19:45:14,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4469 transitions. [2019-11-15 19:45:14,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-15 19:45:14,126 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:14,127 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:14,127 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:14,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:14,127 INFO L82 PathProgramCache]: Analyzing trace with hash -196028502, now seen corresponding path program 1 times [2019-11-15 19:45:14,127 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:14,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319996834] [2019-11-15 19:45:14,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:14,128 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:14,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-15 19:45:14,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319996834] [2019-11-15 19:45:14,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:14,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:14,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622623268] [2019-11-15 19:45:14,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:14,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:14,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:14,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:14,234 INFO L87 Difference]: Start difference. First operand 2828 states and 4469 transitions. Second operand 4 states. [2019-11-15 19:45:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:14,759 INFO L93 Difference]: Finished difference Result 6057 states and 9491 transitions. [2019-11-15 19:45:14,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:14,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2019-11-15 19:45:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:14,763 INFO L225 Difference]: With dead ends: 6057 [2019-11-15 19:45:14,763 INFO L226 Difference]: Without dead ends: 3248 [2019-11-15 19:45:14,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2019-11-15 19:45:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2632. [2019-11-15 19:45:14,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2632 states. [2019-11-15 19:45:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2632 states to 2632 states and 4126 transitions. [2019-11-15 19:45:14,836 INFO L78 Accepts]: Start accepts. Automaton has 2632 states and 4126 transitions. Word has length 216 [2019-11-15 19:45:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:14,836 INFO L462 AbstractCegarLoop]: Abstraction has 2632 states and 4126 transitions. [2019-11-15 19:45:14,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 4126 transitions. [2019-11-15 19:45:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-15 19:45:14,840 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:14,843 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:14,843 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:14,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:14,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1925400850, now seen corresponding path program 1 times [2019-11-15 19:45:14,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:14,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853857645] [2019-11-15 19:45:14,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:14,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:14,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:14,980 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 19:45:14,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853857645] [2019-11-15 19:45:14,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:14,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:14,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425318469] [2019-11-15 19:45:14,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:14,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:14,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:14,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:14,982 INFO L87 Difference]: Start difference. First operand 2632 states and 4126 transitions. Second operand 4 states. [2019-11-15 19:45:15,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:15,448 INFO L93 Difference]: Finished difference Result 5861 states and 9141 transitions. [2019-11-15 19:45:15,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:15,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2019-11-15 19:45:15,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:15,452 INFO L225 Difference]: With dead ends: 5861 [2019-11-15 19:45:15,452 INFO L226 Difference]: Without dead ends: 3248 [2019-11-15 19:45:15,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:15,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2019-11-15 19:45:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2716. [2019-11-15 19:45:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-11-15 19:45:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 4245 transitions. [2019-11-15 19:45:15,526 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 4245 transitions. Word has length 216 [2019-11-15 19:45:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:15,527 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 4245 transitions. [2019-11-15 19:45:15,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:15,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 4245 transitions. [2019-11-15 19:45:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-15 19:45:15,531 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:15,531 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:15,531 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:15,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:15,532 INFO L82 PathProgramCache]: Analyzing trace with hash 822466331, now seen corresponding path program 1 times [2019-11-15 19:45:15,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:15,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626088218] [2019-11-15 19:45:15,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:15,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:15,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 19:45:15,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626088218] [2019-11-15 19:45:15,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:15,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:15,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807168907] [2019-11-15 19:45:15,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:15,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:15,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:15,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:15,650 INFO L87 Difference]: Start difference. First operand 2716 states and 4245 transitions. Second operand 4 states. [2019-11-15 19:45:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:16,310 INFO L93 Difference]: Finished difference Result 5945 states and 9253 transitions. [2019-11-15 19:45:16,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:16,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-11-15 19:45:16,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:16,315 INFO L225 Difference]: With dead ends: 5945 [2019-11-15 19:45:16,315 INFO L226 Difference]: Without dead ends: 3248 [2019-11-15 19:45:16,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2019-11-15 19:45:16,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2723. [2019-11-15 19:45:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-15 19:45:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4252 transitions. [2019-11-15 19:45:16,390 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4252 transitions. Word has length 217 [2019-11-15 19:45:16,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:16,390 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4252 transitions. [2019-11-15 19:45:16,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4252 transitions. [2019-11-15 19:45:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-15 19:45:16,395 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:16,395 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:16,395 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:16,396 INFO L82 PathProgramCache]: Analyzing trace with hash -290799987, now seen corresponding path program 1 times [2019-11-15 19:45:16,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:16,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785716705] [2019-11-15 19:45:16,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:16,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:16,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 19:45:16,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785716705] [2019-11-15 19:45:16,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:16,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:16,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490209570] [2019-11-15 19:45:16,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:16,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:16,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:16,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:16,607 INFO L87 Difference]: Start difference. First operand 2723 states and 4252 transitions. Second operand 4 states. [2019-11-15 19:45:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:17,211 INFO L93 Difference]: Finished difference Result 5952 states and 9253 transitions. [2019-11-15 19:45:17,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:17,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-11-15 19:45:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:17,215 INFO L225 Difference]: With dead ends: 5952 [2019-11-15 19:45:17,215 INFO L226 Difference]: Without dead ends: 3248 [2019-11-15 19:45:17,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2019-11-15 19:45:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2730. [2019-11-15 19:45:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2019-11-15 19:45:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 4259 transitions. [2019-11-15 19:45:17,269 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 4259 transitions. Word has length 218 [2019-11-15 19:45:17,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:17,269 INFO L462 AbstractCegarLoop]: Abstraction has 2730 states and 4259 transitions. [2019-11-15 19:45:17,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 4259 transitions. [2019-11-15 19:45:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-15 19:45:17,272 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:17,272 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:17,272 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:17,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:17,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1724352074, now seen corresponding path program 1 times [2019-11-15 19:45:17,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:17,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733732193] [2019-11-15 19:45:17,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:17,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:17,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 19:45:17,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733732193] [2019-11-15 19:45:17,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:17,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:17,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969326620] [2019-11-15 19:45:17,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:17,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:17,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:17,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:17,383 INFO L87 Difference]: Start difference. First operand 2730 states and 4259 transitions. Second operand 4 states. [2019-11-15 19:45:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:17,886 INFO L93 Difference]: Finished difference Result 5889 states and 9169 transitions. [2019-11-15 19:45:17,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:17,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-11-15 19:45:17,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:17,890 INFO L225 Difference]: With dead ends: 5889 [2019-11-15 19:45:17,890 INFO L226 Difference]: Without dead ends: 3178 [2019-11-15 19:45:17,894 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2019-11-15 19:45:17,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 2737. [2019-11-15 19:45:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2737 states. [2019-11-15 19:45:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2737 states and 4266 transitions. [2019-11-15 19:45:17,967 INFO L78 Accepts]: Start accepts. Automaton has 2737 states and 4266 transitions. Word has length 219 [2019-11-15 19:45:17,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:17,967 INFO L462 AbstractCegarLoop]: Abstraction has 2737 states and 4266 transitions. [2019-11-15 19:45:17,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 4266 transitions. [2019-11-15 19:45:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-15 19:45:17,973 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:17,974 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:17,974 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:17,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:17,974 INFO L82 PathProgramCache]: Analyzing trace with hash 701567676, now seen corresponding path program 1 times [2019-11-15 19:45:17,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:17,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569393388] [2019-11-15 19:45:17,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:17,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:17,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:18,137 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 138 proven. 6 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-15 19:45:18,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569393388] [2019-11-15 19:45:18,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151416654] [2019-11-15 19:45:18,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:18,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 19:45:18,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:45:18,382 INFO L375 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 20 treesize of output 8 [2019-11-15 19:45:18,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:18,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:18,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:18,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:45:18,402 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:45:18,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 19:45:18,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:18,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:18,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:18,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 19:45:18,436 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:45:18,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:45:18,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:18,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:18,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:18,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:45:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 138 proven. 6 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-15 19:45:18,495 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:45:18,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-15 19:45:18,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916220646] [2019-11-15 19:45:18,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 19:45:18,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:18,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 19:45:18,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 19:45:18,497 INFO L87 Difference]: Start difference. First operand 2737 states and 4266 transitions. Second operand 9 states. [2019-11-15 19:45:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:19,705 INFO L93 Difference]: Finished difference Result 6465 states and 9952 transitions. [2019-11-15 19:45:19,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 19:45:19,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 223 [2019-11-15 19:45:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:19,714 INFO L225 Difference]: With dead ends: 6465 [2019-11-15 19:45:19,715 INFO L226 Difference]: Without dead ends: 3747 [2019-11-15 19:45:19,717 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-15 19:45:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2019-11-15 19:45:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 2919. [2019-11-15 19:45:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2919 states. [2019-11-15 19:45:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4525 transitions. [2019-11-15 19:45:19,795 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4525 transitions. Word has length 223 [2019-11-15 19:45:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:19,795 INFO L462 AbstractCegarLoop]: Abstraction has 2919 states and 4525 transitions. [2019-11-15 19:45:19,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 19:45:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4525 transitions. [2019-11-15 19:45:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 19:45:19,799 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:19,799 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:20,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:20,003 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash 160180308, now seen corresponding path program 1 times [2019-11-15 19:45:20,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:20,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132081802] [2019-11-15 19:45:20,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:20,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:20,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-15 19:45:20,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132081802] [2019-11-15 19:45:20,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:20,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:20,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482522213] [2019-11-15 19:45:20,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:20,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:20,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:20,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:20,152 INFO L87 Difference]: Start difference. First operand 2919 states and 4525 transitions. Second operand 4 states. [2019-11-15 19:45:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:20,740 INFO L93 Difference]: Finished difference Result 6435 states and 9932 transitions. [2019-11-15 19:45:20,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:20,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-11-15 19:45:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:20,743 INFO L225 Difference]: With dead ends: 6435 [2019-11-15 19:45:20,743 INFO L226 Difference]: Without dead ends: 3535 [2019-11-15 19:45:20,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3535 states. [2019-11-15 19:45:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3535 to 3003. [2019-11-15 19:45:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3003 states. [2019-11-15 19:45:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 4644 transitions. [2019-11-15 19:45:20,802 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 4644 transitions. Word has length 230 [2019-11-15 19:45:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:20,802 INFO L462 AbstractCegarLoop]: Abstraction has 3003 states and 4644 transitions. [2019-11-15 19:45:20,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 4644 transitions. [2019-11-15 19:45:20,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 19:45:20,804 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:20,804 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:20,804 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:20,805 INFO L82 PathProgramCache]: Analyzing trace with hash -477738552, now seen corresponding path program 1 times [2019-11-15 19:45:20,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:20,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536139549] [2019-11-15 19:45:20,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:20,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:20,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 19:45:20,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536139549] [2019-11-15 19:45:20,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:20,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:20,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658660203] [2019-11-15 19:45:20,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:20,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:20,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:20,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:20,916 INFO L87 Difference]: Start difference. First operand 3003 states and 4644 transitions. Second operand 4 states. [2019-11-15 19:45:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:21,327 INFO L93 Difference]: Finished difference Result 6414 states and 9897 transitions. [2019-11-15 19:45:21,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:21,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-11-15 19:45:21,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:21,329 INFO L225 Difference]: With dead ends: 6414 [2019-11-15 19:45:21,329 INFO L226 Difference]: Without dead ends: 3430 [2019-11-15 19:45:21,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2019-11-15 19:45:21,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3087. [2019-11-15 19:45:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3087 states. [2019-11-15 19:45:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 4798 transitions. [2019-11-15 19:45:21,405 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 4798 transitions. Word has length 230 [2019-11-15 19:45:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:21,405 INFO L462 AbstractCegarLoop]: Abstraction has 3087 states and 4798 transitions. [2019-11-15 19:45:21,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 4798 transitions. [2019-11-15 19:45:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 19:45:21,408 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:21,408 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:21,408 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1200606639, now seen corresponding path program 1 times [2019-11-15 19:45:21,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:21,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267085213] [2019-11-15 19:45:21,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:21,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:21,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 19:45:21,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267085213] [2019-11-15 19:45:21,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:21,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:21,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242562949] [2019-11-15 19:45:21,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:21,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:21,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:21,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:21,530 INFO L87 Difference]: Start difference. First operand 3087 states and 4798 transitions. Second operand 4 states. [2019-11-15 19:45:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:22,065 INFO L93 Difference]: Finished difference Result 6477 states and 10016 transitions. [2019-11-15 19:45:22,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:22,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-11-15 19:45:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:22,069 INFO L225 Difference]: With dead ends: 6477 [2019-11-15 19:45:22,069 INFO L226 Difference]: Without dead ends: 3409 [2019-11-15 19:45:22,071 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3409 states. [2019-11-15 19:45:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3409 to 3122. [2019-11-15 19:45:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2019-11-15 19:45:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4847 transitions. [2019-11-15 19:45:22,162 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4847 transitions. Word has length 230 [2019-11-15 19:45:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:22,162 INFO L462 AbstractCegarLoop]: Abstraction has 3122 states and 4847 transitions. [2019-11-15 19:45:22,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4847 transitions. [2019-11-15 19:45:22,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-15 19:45:22,166 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:22,166 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:22,166 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:22,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:22,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1721700591, now seen corresponding path program 1 times [2019-11-15 19:45:22,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:22,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984849336] [2019-11-15 19:45:22,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:22,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:22,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:22,273 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-15 19:45:22,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984849336] [2019-11-15 19:45:22,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:22,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:22,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5976611] [2019-11-15 19:45:22,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:22,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:22,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:22,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:22,275 INFO L87 Difference]: Start difference. First operand 3122 states and 4847 transitions. Second operand 4 states. [2019-11-15 19:45:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:22,725 INFO L93 Difference]: Finished difference Result 6757 states and 10450 transitions. [2019-11-15 19:45:22,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:22,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-11-15 19:45:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:22,728 INFO L225 Difference]: With dead ends: 6757 [2019-11-15 19:45:22,728 INFO L226 Difference]: Without dead ends: 3654 [2019-11-15 19:45:22,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2019-11-15 19:45:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3129. [2019-11-15 19:45:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2019-11-15 19:45:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4854 transitions. [2019-11-15 19:45:22,789 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4854 transitions. Word has length 231 [2019-11-15 19:45:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:22,789 INFO L462 AbstractCegarLoop]: Abstraction has 3129 states and 4854 transitions. [2019-11-15 19:45:22,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4854 transitions. [2019-11-15 19:45:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-15 19:45:22,791 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:22,792 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:22,792 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:22,792 INFO L82 PathProgramCache]: Analyzing trace with hash -382158691, now seen corresponding path program 1 times [2019-11-15 19:45:22,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:22,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138646359] [2019-11-15 19:45:22,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:22,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:22,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-15 19:45:22,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138646359] [2019-11-15 19:45:22,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:22,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:22,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467533306] [2019-11-15 19:45:22,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:22,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:22,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:22,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:22,897 INFO L87 Difference]: Start difference. First operand 3129 states and 4854 transitions. Second operand 4 states. [2019-11-15 19:45:23,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:23,470 INFO L93 Difference]: Finished difference Result 6764 states and 10450 transitions. [2019-11-15 19:45:23,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:23,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-11-15 19:45:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:23,473 INFO L225 Difference]: With dead ends: 6764 [2019-11-15 19:45:23,473 INFO L226 Difference]: Without dead ends: 3654 [2019-11-15 19:45:23,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:23,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2019-11-15 19:45:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3129. [2019-11-15 19:45:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2019-11-15 19:45:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4847 transitions. [2019-11-15 19:45:23,560 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4847 transitions. Word has length 231 [2019-11-15 19:45:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:23,560 INFO L462 AbstractCegarLoop]: Abstraction has 3129 states and 4847 transitions. [2019-11-15 19:45:23,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4847 transitions. [2019-11-15 19:45:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 19:45:23,562 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:23,562 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:23,562 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:23,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:23,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1018833159, now seen corresponding path program 1 times [2019-11-15 19:45:23,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:23,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053625922] [2019-11-15 19:45:23,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:23,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:23,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-15 19:45:23,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053625922] [2019-11-15 19:45:23,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:23,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:23,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521830145] [2019-11-15 19:45:23,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:23,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:23,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:23,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:23,774 INFO L87 Difference]: Start difference. First operand 3129 states and 4847 transitions. Second operand 4 states. [2019-11-15 19:45:24,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:24,140 INFO L93 Difference]: Finished difference Result 6764 states and 10436 transitions. [2019-11-15 19:45:24,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:24,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-11-15 19:45:24,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:24,143 INFO L225 Difference]: With dead ends: 6764 [2019-11-15 19:45:24,143 INFO L226 Difference]: Without dead ends: 3654 [2019-11-15 19:45:24,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2019-11-15 19:45:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3136. [2019-11-15 19:45:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2019-11-15 19:45:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 4854 transitions. [2019-11-15 19:45:24,209 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 4854 transitions. Word has length 232 [2019-11-15 19:45:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:24,209 INFO L462 AbstractCegarLoop]: Abstraction has 3136 states and 4854 transitions. [2019-11-15 19:45:24,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 4854 transitions. [2019-11-15 19:45:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 19:45:24,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:24,211 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:24,212 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:24,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1354340376, now seen corresponding path program 1 times [2019-11-15 19:45:24,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:24,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224253991] [2019-11-15 19:45:24,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:24,213 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:24,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-15 19:45:24,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224253991] [2019-11-15 19:45:24,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:24,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:24,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82200462] [2019-11-15 19:45:24,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:24,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:24,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:24,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:24,308 INFO L87 Difference]: Start difference. First operand 3136 states and 4854 transitions. Second operand 4 states. [2019-11-15 19:45:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:24,701 INFO L93 Difference]: Finished difference Result 6771 states and 10436 transitions. [2019-11-15 19:45:24,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:24,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-11-15 19:45:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:24,704 INFO L225 Difference]: With dead ends: 6771 [2019-11-15 19:45:24,704 INFO L226 Difference]: Without dead ends: 3654 [2019-11-15 19:45:24,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:24,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2019-11-15 19:45:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3136. [2019-11-15 19:45:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2019-11-15 19:45:24,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 4847 transitions. [2019-11-15 19:45:24,768 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 4847 transitions. Word has length 232 [2019-11-15 19:45:24,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:24,769 INFO L462 AbstractCegarLoop]: Abstraction has 3136 states and 4847 transitions. [2019-11-15 19:45:24,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 4847 transitions. [2019-11-15 19:45:24,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 19:45:24,770 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:24,771 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:24,771 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:24,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:24,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1793146090, now seen corresponding path program 1 times [2019-11-15 19:45:24,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:24,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335661426] [2019-11-15 19:45:24,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:24,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:24,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-15 19:45:24,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335661426] [2019-11-15 19:45:24,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:24,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:24,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588694546] [2019-11-15 19:45:24,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:24,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:24,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:24,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:24,879 INFO L87 Difference]: Start difference. First operand 3136 states and 4847 transitions. Second operand 4 states. [2019-11-15 19:45:25,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:25,459 INFO L93 Difference]: Finished difference Result 6701 states and 10338 transitions. [2019-11-15 19:45:25,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:25,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-11-15 19:45:25,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:25,463 INFO L225 Difference]: With dead ends: 6701 [2019-11-15 19:45:25,464 INFO L226 Difference]: Without dead ends: 3584 [2019-11-15 19:45:25,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:25,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2019-11-15 19:45:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3143. [2019-11-15 19:45:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2019-11-15 19:45:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 4854 transitions. [2019-11-15 19:45:25,563 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 4854 transitions. Word has length 233 [2019-11-15 19:45:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:25,563 INFO L462 AbstractCegarLoop]: Abstraction has 3143 states and 4854 transitions. [2019-11-15 19:45:25,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:25,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 4854 transitions. [2019-11-15 19:45:25,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 19:45:25,566 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:25,567 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:25,567 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:25,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:25,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1779398914, now seen corresponding path program 1 times [2019-11-15 19:45:25,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:25,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454815301] [2019-11-15 19:45:25,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:25,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:25,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-15 19:45:25,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454815301] [2019-11-15 19:45:25,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:25,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:25,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49451898] [2019-11-15 19:45:25,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:25,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:25,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:25,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:25,666 INFO L87 Difference]: Start difference. First operand 3143 states and 4854 transitions. Second operand 4 states. [2019-11-15 19:45:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:26,065 INFO L93 Difference]: Finished difference Result 6778 states and 10422 transitions. [2019-11-15 19:45:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:26,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-11-15 19:45:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:26,068 INFO L225 Difference]: With dead ends: 6778 [2019-11-15 19:45:26,068 INFO L226 Difference]: Without dead ends: 3654 [2019-11-15 19:45:26,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2019-11-15 19:45:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3143. [2019-11-15 19:45:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2019-11-15 19:45:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 4847 transitions. [2019-11-15 19:45:26,135 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 4847 transitions. Word has length 233 [2019-11-15 19:45:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:26,135 INFO L462 AbstractCegarLoop]: Abstraction has 3143 states and 4847 transitions. [2019-11-15 19:45:26,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 4847 transitions. [2019-11-15 19:45:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-15 19:45:26,137 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:26,138 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:26,138 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:26,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1674987992, now seen corresponding path program 1 times [2019-11-15 19:45:26,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:26,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814453307] [2019-11-15 19:45:26,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:26,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:26,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-11-15 19:45:26,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814453307] [2019-11-15 19:45:26,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:26,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:26,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143791660] [2019-11-15 19:45:26,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:26,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:26,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:26,242 INFO L87 Difference]: Start difference. First operand 3143 states and 4847 transitions. Second operand 4 states. [2019-11-15 19:45:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:26,589 INFO L93 Difference]: Finished difference Result 6526 states and 10054 transitions. [2019-11-15 19:45:26,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:26,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-11-15 19:45:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:26,592 INFO L225 Difference]: With dead ends: 6526 [2019-11-15 19:45:26,592 INFO L226 Difference]: Without dead ends: 3402 [2019-11-15 19:45:26,595 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-11-15 19:45:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3290. [2019-11-15 19:45:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3290 states. [2019-11-15 19:45:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 5092 transitions. [2019-11-15 19:45:26,691 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 5092 transitions. Word has length 233 [2019-11-15 19:45:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:26,691 INFO L462 AbstractCegarLoop]: Abstraction has 3290 states and 5092 transitions. [2019-11-15 19:45:26,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 5092 transitions. [2019-11-15 19:45:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-15 19:45:26,695 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:26,695 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:26,695 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:26,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:26,695 INFO L82 PathProgramCache]: Analyzing trace with hash -947297747, now seen corresponding path program 1 times [2019-11-15 19:45:26,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:26,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950076610] [2019-11-15 19:45:26,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:26,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:26,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-15 19:45:26,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950076610] [2019-11-15 19:45:26,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:26,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:26,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162595857] [2019-11-15 19:45:26,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:26,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:26,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:26,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:26,848 INFO L87 Difference]: Start difference. First operand 3290 states and 5092 transitions. Second operand 4 states. [2019-11-15 19:45:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:27,246 INFO L93 Difference]: Finished difference Result 7002 states and 10814 transitions. [2019-11-15 19:45:27,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:27,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2019-11-15 19:45:27,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:27,250 INFO L225 Difference]: With dead ends: 7002 [2019-11-15 19:45:27,250 INFO L226 Difference]: Without dead ends: 3731 [2019-11-15 19:45:27,251 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3731 states. [2019-11-15 19:45:27,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3731 to 3185. [2019-11-15 19:45:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3185 states. [2019-11-15 19:45:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 4945 transitions. [2019-11-15 19:45:27,318 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 4945 transitions. Word has length 234 [2019-11-15 19:45:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:27,318 INFO L462 AbstractCegarLoop]: Abstraction has 3185 states and 4945 transitions. [2019-11-15 19:45:27,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 4945 transitions. [2019-11-15 19:45:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-15 19:45:27,320 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:27,320 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:27,321 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:27,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:27,321 INFO L82 PathProgramCache]: Analyzing trace with hash 404984215, now seen corresponding path program 1 times [2019-11-15 19:45:27,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:27,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081103652] [2019-11-15 19:45:27,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:27,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:27,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-11-15 19:45:27,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081103652] [2019-11-15 19:45:27,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:27,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:27,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175477173] [2019-11-15 19:45:27,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:27,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:27,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:27,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:27,432 INFO L87 Difference]: Start difference. First operand 3185 states and 4945 transitions. Second operand 4 states. [2019-11-15 19:45:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:28,060 INFO L93 Difference]: Finished difference Result 6967 states and 10779 transitions. [2019-11-15 19:45:28,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:28,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2019-11-15 19:45:28,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:28,064 INFO L225 Difference]: With dead ends: 6967 [2019-11-15 19:45:28,064 INFO L226 Difference]: Without dead ends: 3801 [2019-11-15 19:45:28,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:28,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3801 states. [2019-11-15 19:45:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3801 to 3290. [2019-11-15 19:45:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3290 states. [2019-11-15 19:45:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 5113 transitions. [2019-11-15 19:45:28,165 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 5113 transitions. Word has length 234 [2019-11-15 19:45:28,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:28,165 INFO L462 AbstractCegarLoop]: Abstraction has 3290 states and 5113 transitions. [2019-11-15 19:45:28,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 5113 transitions. [2019-11-15 19:45:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-15 19:45:28,168 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:28,168 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:28,169 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:28,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1409890985, now seen corresponding path program 1 times [2019-11-15 19:45:28,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:28,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368012501] [2019-11-15 19:45:28,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:28,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:28,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2019-11-15 19:45:28,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368012501] [2019-11-15 19:45:28,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:28,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:28,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371654924] [2019-11-15 19:45:28,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:28,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:28,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:28,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:28,284 INFO L87 Difference]: Start difference. First operand 3290 states and 5113 transitions. Second operand 4 states. [2019-11-15 19:45:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:28,690 INFO L93 Difference]: Finished difference Result 7177 states and 11115 transitions. [2019-11-15 19:45:28,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:28,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 234 [2019-11-15 19:45:28,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:28,693 INFO L225 Difference]: With dead ends: 7177 [2019-11-15 19:45:28,694 INFO L226 Difference]: Without dead ends: 3906 [2019-11-15 19:45:28,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-11-15 19:45:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3290. [2019-11-15 19:45:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3290 states. [2019-11-15 19:45:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 5113 transitions. [2019-11-15 19:45:28,779 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 5113 transitions. Word has length 234 [2019-11-15 19:45:28,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:28,779 INFO L462 AbstractCegarLoop]: Abstraction has 3290 states and 5113 transitions. [2019-11-15 19:45:28,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:28,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 5113 transitions. [2019-11-15 19:45:28,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-11-15 19:45:28,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:28,782 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:28,782 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:28,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:28,783 INFO L82 PathProgramCache]: Analyzing trace with hash -898417988, now seen corresponding path program 1 times [2019-11-15 19:45:28,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:28,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570106885] [2019-11-15 19:45:28,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:28,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:28,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2019-11-15 19:45:28,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570106885] [2019-11-15 19:45:28,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:28,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:28,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802622883] [2019-11-15 19:45:28,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:28,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:28,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:28,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:28,906 INFO L87 Difference]: Start difference. First operand 3290 states and 5113 transitions. Second operand 4 states. [2019-11-15 19:45:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:29,431 INFO L93 Difference]: Finished difference Result 7207 states and 11159 transitions. [2019-11-15 19:45:29,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:29,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-11-15 19:45:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:29,436 INFO L225 Difference]: With dead ends: 7207 [2019-11-15 19:45:29,436 INFO L226 Difference]: Without dead ends: 3936 [2019-11-15 19:45:29,438 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2019-11-15 19:45:29,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 3493. [2019-11-15 19:45:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3493 states. [2019-11-15 19:45:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 3493 states and 5456 transitions. [2019-11-15 19:45:29,547 INFO L78 Accepts]: Start accepts. Automaton has 3493 states and 5456 transitions. Word has length 236 [2019-11-15 19:45:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:29,547 INFO L462 AbstractCegarLoop]: Abstraction has 3493 states and 5456 transitions. [2019-11-15 19:45:29,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3493 states and 5456 transitions. [2019-11-15 19:45:29,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-15 19:45:29,551 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:29,551 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:29,552 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:29,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:29,552 INFO L82 PathProgramCache]: Analyzing trace with hash -487267334, now seen corresponding path program 1 times [2019-11-15 19:45:29,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:29,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248650482] [2019-11-15 19:45:29,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:29,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:29,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 225 proven. 44 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-11-15 19:45:29,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248650482] [2019-11-15 19:45:29,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255975227] [2019-11-15 19:45:29,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:29,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 19:45:29,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:45:29,942 INFO L375 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 20 treesize of output 8 [2019-11-15 19:45:29,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:29,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:29,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:29,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:45:29,964 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:45:29,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 19:45:29,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:29,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:29,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:29,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 19:45:30,015 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:45:30,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:45:30,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:30,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:30,020 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:30,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:45:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 225 proven. 44 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-11-15 19:45:30,068 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:45:30,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 19:45:30,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732097030] [2019-11-15 19:45:30,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 19:45:30,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:30,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 19:45:30,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:45:30,070 INFO L87 Difference]: Start difference. First operand 3493 states and 5456 transitions. Second operand 8 states. [2019-11-15 19:45:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:30,947 INFO L93 Difference]: Finished difference Result 7226 states and 11210 transitions. [2019-11-15 19:45:30,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:45:30,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 239 [2019-11-15 19:45:30,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:30,952 INFO L225 Difference]: With dead ends: 7226 [2019-11-15 19:45:30,952 INFO L226 Difference]: Without dead ends: 3752 [2019-11-15 19:45:30,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:45:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-11-15 19:45:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 3493. [2019-11-15 19:45:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3493 states. [2019-11-15 19:45:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3493 states to 3493 states and 5407 transitions. [2019-11-15 19:45:31,036 INFO L78 Accepts]: Start accepts. Automaton has 3493 states and 5407 transitions. Word has length 239 [2019-11-15 19:45:31,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:31,036 INFO L462 AbstractCegarLoop]: Abstraction has 3493 states and 5407 transitions. [2019-11-15 19:45:31,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 19:45:31,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3493 states and 5407 transitions. [2019-11-15 19:45:31,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-15 19:45:31,040 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:31,040 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:31,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:31,245 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:31,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:31,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1502456604, now seen corresponding path program 1 times [2019-11-15 19:45:31,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:31,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995440463] [2019-11-15 19:45:31,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:31,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:31,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 291 proven. 6 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-11-15 19:45:31,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995440463] [2019-11-15 19:45:31,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064323601] [2019-11-15 19:45:31,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:31,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 19:45:31,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:45:31,613 INFO L375 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 20 treesize of output 8 [2019-11-15 19:45:31,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:31,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:31,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:31,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:45:31,632 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:45:31,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 19:45:31,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:31,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:31,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:31,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 19:45:31,663 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:45:31,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:45:31,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:31,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:31,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:31,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:45:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 291 proven. 6 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-11-15 19:45:31,738 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:45:31,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 19:45:31,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743201056] [2019-11-15 19:45:31,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 19:45:31,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:31,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 19:45:31,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:45:31,740 INFO L87 Difference]: Start difference. First operand 3493 states and 5407 transitions. Second operand 8 states. [2019-11-15 19:45:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:32,904 INFO L93 Difference]: Finished difference Result 7949 states and 12211 transitions. [2019-11-15 19:45:32,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:45:32,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2019-11-15 19:45:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:32,907 INFO L225 Difference]: With dead ends: 7949 [2019-11-15 19:45:32,907 INFO L226 Difference]: Without dead ends: 4475 [2019-11-15 19:45:32,909 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:45:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2019-11-15 19:45:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 3752. [2019-11-15 19:45:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3752 states. [2019-11-15 19:45:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3752 states to 3752 states and 5841 transitions. [2019-11-15 19:45:32,992 INFO L78 Accepts]: Start accepts. Automaton has 3752 states and 5841 transitions. Word has length 240 [2019-11-15 19:45:32,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:32,992 INFO L462 AbstractCegarLoop]: Abstraction has 3752 states and 5841 transitions. [2019-11-15 19:45:32,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 19:45:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3752 states and 5841 transitions. [2019-11-15 19:45:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-15 19:45:32,995 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:32,995 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:33,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:33,196 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:33,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:33,196 INFO L82 PathProgramCache]: Analyzing trace with hash -317741013, now seen corresponding path program 1 times [2019-11-15 19:45:33,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:33,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827366139] [2019-11-15 19:45:33,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:33,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:33,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 230 proven. 41 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-11-15 19:45:33,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827366139] [2019-11-15 19:45:33,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659094329] [2019-11-15 19:45:33,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:33,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 19:45:33,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:45:33,526 INFO L375 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 20 treesize of output 8 [2019-11-15 19:45:33,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:33,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:33,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:33,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:45:33,542 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:45:33,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 19:45:33,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:33,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:33,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:33,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 19:45:33,562 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:45:33,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:45:33,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:33,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:33,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:33,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:45:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 230 proven. 41 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-11-15 19:45:33,602 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:45:33,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 19:45:33,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805164780] [2019-11-15 19:45:33,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 19:45:33,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:33,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 19:45:33,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:45:33,603 INFO L87 Difference]: Start difference. First operand 3752 states and 5841 transitions. Second operand 8 states. [2019-11-15 19:45:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:34,456 INFO L93 Difference]: Finished difference Result 7744 states and 11980 transitions. [2019-11-15 19:45:34,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:45:34,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2019-11-15 19:45:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:34,459 INFO L225 Difference]: With dead ends: 7744 [2019-11-15 19:45:34,459 INFO L226 Difference]: Without dead ends: 4011 [2019-11-15 19:45:34,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:45:34,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4011 states. [2019-11-15 19:45:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4011 to 3752. [2019-11-15 19:45:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3752 states. [2019-11-15 19:45:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3752 states to 3752 states and 5785 transitions. [2019-11-15 19:45:34,615 INFO L78 Accepts]: Start accepts. Automaton has 3752 states and 5785 transitions. Word has length 240 [2019-11-15 19:45:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:34,615 INFO L462 AbstractCegarLoop]: Abstraction has 3752 states and 5785 transitions. [2019-11-15 19:45:34,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 19:45:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3752 states and 5785 transitions. [2019-11-15 19:45:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-15 19:45:34,617 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:34,617 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:34,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:34,818 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:34,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:34,818 INFO L82 PathProgramCache]: Analyzing trace with hash 845118702, now seen corresponding path program 1 times [2019-11-15 19:45:34,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:34,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329737714] [2019-11-15 19:45:34,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:34,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:34,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 294 proven. 5 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-15 19:45:34,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329737714] [2019-11-15 19:45:34,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856507041] [2019-11-15 19:45:34,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:35,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 19:45:35,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:45:35,197 INFO L375 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 20 treesize of output 8 [2019-11-15 19:45:35,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:35,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:35,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:35,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:45:35,215 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:45:35,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 19:45:35,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:35,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:35,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:35,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 19:45:35,244 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:45:35,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:45:35,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:35,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:35,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:35,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:45:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 294 proven. 5 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-15 19:45:35,323 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:45:35,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 19:45:35,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461936821] [2019-11-15 19:45:35,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 19:45:35,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:35,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 19:45:35,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:45:35,325 INFO L87 Difference]: Start difference. First operand 3752 states and 5785 transitions. Second operand 8 states. [2019-11-15 19:45:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:36,231 INFO L93 Difference]: Finished difference Result 8194 states and 12498 transitions. [2019-11-15 19:45:36,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:45:36,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2019-11-15 19:45:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:36,235 INFO L225 Difference]: With dead ends: 8194 [2019-11-15 19:45:36,235 INFO L226 Difference]: Without dead ends: 4461 [2019-11-15 19:45:36,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:45:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4461 states. [2019-11-15 19:45:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4461 to 3752. [2019-11-15 19:45:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3752 states. [2019-11-15 19:45:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3752 states to 3752 states and 5771 transitions. [2019-11-15 19:45:36,329 INFO L78 Accepts]: Start accepts. Automaton has 3752 states and 5771 transitions. Word has length 241 [2019-11-15 19:45:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:36,329 INFO L462 AbstractCegarLoop]: Abstraction has 3752 states and 5771 transitions. [2019-11-15 19:45:36,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 19:45:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3752 states and 5771 transitions. [2019-11-15 19:45:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-15 19:45:36,331 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:36,332 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:36,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:36,534 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash -445759201, now seen corresponding path program 1 times [2019-11-15 19:45:36,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:36,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155927891] [2019-11-15 19:45:36,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:36,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:36,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 235 proven. 38 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-11-15 19:45:36,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155927891] [2019-11-15 19:45:36,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244064539] [2019-11-15 19:45:36,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:36,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 19:45:36,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:45:36,866 INFO L375 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 20 treesize of output 8 [2019-11-15 19:45:36,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:36,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:36,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:36,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:45:36,882 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:45:36,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 19:45:36,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:36,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:36,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:36,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 19:45:36,902 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:45:36,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:45:36,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:36,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:36,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:36,905 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:45:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 235 proven. 38 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-11-15 19:45:36,948 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:45:36,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 19:45:36,949 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041971009] [2019-11-15 19:45:36,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 19:45:36,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:36,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 19:45:36,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:45:36,950 INFO L87 Difference]: Start difference. First operand 3752 states and 5771 transitions. Second operand 8 states. [2019-11-15 19:45:37,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:37,681 INFO L93 Difference]: Finished difference Result 7744 states and 11840 transitions. [2019-11-15 19:45:37,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:45:37,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2019-11-15 19:45:37,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:37,685 INFO L225 Difference]: With dead ends: 7744 [2019-11-15 19:45:37,685 INFO L226 Difference]: Without dead ends: 4011 [2019-11-15 19:45:37,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:45:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4011 states. [2019-11-15 19:45:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4011 to 3752. [2019-11-15 19:45:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3752 states. [2019-11-15 19:45:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3752 states to 3752 states and 5715 transitions. [2019-11-15 19:45:37,775 INFO L78 Accepts]: Start accepts. Automaton has 3752 states and 5715 transitions. Word has length 241 [2019-11-15 19:45:37,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:37,776 INFO L462 AbstractCegarLoop]: Abstraction has 3752 states and 5715 transitions. [2019-11-15 19:45:37,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 19:45:37,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3752 states and 5715 transitions. [2019-11-15 19:45:37,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-11-15 19:45:37,778 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:37,778 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:37,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:37,979 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:37,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:37,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1207722576, now seen corresponding path program 1 times [2019-11-15 19:45:37,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:37,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431744303] [2019-11-15 19:45:37,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:37,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:37,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 240 proven. 35 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2019-11-15 19:45:38,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431744303] [2019-11-15 19:45:38,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897326634] [2019-11-15 19:45:38,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:38,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 19:45:38,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:45:38,312 INFO L375 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 20 treesize of output 8 [2019-11-15 19:45:38,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:38,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:38,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:38,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:45:38,328 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:45:38,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 19:45:38,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:38,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:38,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:38,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 19:45:38,346 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:45:38,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:45:38,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:38,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:38,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:38,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:45:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 240 proven. 35 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2019-11-15 19:45:38,388 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:45:38,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 19:45:38,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567651819] [2019-11-15 19:45:38,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 19:45:38,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:38,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 19:45:38,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:45:38,390 INFO L87 Difference]: Start difference. First operand 3752 states and 5715 transitions. Second operand 8 states. [2019-11-15 19:45:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:39,197 INFO L93 Difference]: Finished difference Result 7604 states and 11560 transitions. [2019-11-15 19:45:39,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:45:39,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-11-15 19:45:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:39,199 INFO L225 Difference]: With dead ends: 7604 [2019-11-15 19:45:39,200 INFO L226 Difference]: Without dead ends: 3871 [2019-11-15 19:45:39,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:45:39,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2019-11-15 19:45:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3647. [2019-11-15 19:45:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3647 states. [2019-11-15 19:45:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 5519 transitions. [2019-11-15 19:45:39,281 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 5519 transitions. Word has length 242 [2019-11-15 19:45:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:39,282 INFO L462 AbstractCegarLoop]: Abstraction has 3647 states and 5519 transitions. [2019-11-15 19:45:39,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 19:45:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 5519 transitions. [2019-11-15 19:45:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-15 19:45:39,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:39,284 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:39,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:39,485 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1179260651, now seen corresponding path program 1 times [2019-11-15 19:45:39,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:39,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438932576] [2019-11-15 19:45:39,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:39,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:39,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-15 19:45:39,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438932576] [2019-11-15 19:45:39,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:39,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:39,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963941643] [2019-11-15 19:45:39,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:39,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:39,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:39,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:39,593 INFO L87 Difference]: Start difference. First operand 3647 states and 5519 transitions. Second operand 4 states. [2019-11-15 19:45:39,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:39,977 INFO L93 Difference]: Finished difference Result 7793 states and 11759 transitions. [2019-11-15 19:45:39,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:39,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-15 19:45:39,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:39,980 INFO L225 Difference]: With dead ends: 7793 [2019-11-15 19:45:39,980 INFO L226 Difference]: Without dead ends: 4165 [2019-11-15 19:45:39,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4165 states. [2019-11-15 19:45:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4165 to 3836. [2019-11-15 19:45:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3836 states. [2019-11-15 19:45:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 5813 transitions. [2019-11-15 19:45:40,065 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 5813 transitions. Word has length 243 [2019-11-15 19:45:40,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:40,066 INFO L462 AbstractCegarLoop]: Abstraction has 3836 states and 5813 transitions. [2019-11-15 19:45:40,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 5813 transitions. [2019-11-15 19:45:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-11-15 19:45:40,068 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:40,068 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:40,068 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:40,068 INFO L82 PathProgramCache]: Analyzing trace with hash 456392564, now seen corresponding path program 1 times [2019-11-15 19:45:40,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:40,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420887875] [2019-11-15 19:45:40,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:40,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:40,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 592 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-11-15 19:45:40,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420887875] [2019-11-15 19:45:40,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:40,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:40,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451318490] [2019-11-15 19:45:40,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:40,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:40,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:40,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:40,154 INFO L87 Difference]: Start difference. First operand 3836 states and 5813 transitions. Second operand 4 states. [2019-11-15 19:45:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:40,535 INFO L93 Difference]: Finished difference Result 7926 states and 11962 transitions. [2019-11-15 19:45:40,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:40,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-11-15 19:45:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:40,540 INFO L225 Difference]: With dead ends: 7926 [2019-11-15 19:45:40,540 INFO L226 Difference]: Without dead ends: 4109 [2019-11-15 19:45:40,542 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2019-11-15 19:45:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 3836. [2019-11-15 19:45:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3836 states. [2019-11-15 19:45:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 5806 transitions. [2019-11-15 19:45:40,629 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 5806 transitions. Word has length 243 [2019-11-15 19:45:40,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:40,629 INFO L462 AbstractCegarLoop]: Abstraction has 3836 states and 5806 transitions. [2019-11-15 19:45:40,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 5806 transitions. [2019-11-15 19:45:40,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-15 19:45:40,632 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:40,632 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:40,632 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:40,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1098932981, now seen corresponding path program 1 times [2019-11-15 19:45:40,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:40,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636164495] [2019-11-15 19:45:40,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:40,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:40,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-11-15 19:45:40,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636164495] [2019-11-15 19:45:40,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:40,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:40,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618443904] [2019-11-15 19:45:40,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:40,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:40,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:40,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:40,716 INFO L87 Difference]: Start difference. First operand 3836 states and 5806 transitions. Second operand 4 states. [2019-11-15 19:45:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:41,075 INFO L93 Difference]: Finished difference Result 7912 states and 11934 transitions. [2019-11-15 19:45:41,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:41,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-11-15 19:45:41,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:41,078 INFO L225 Difference]: With dead ends: 7912 [2019-11-15 19:45:41,078 INFO L226 Difference]: Without dead ends: 4095 [2019-11-15 19:45:41,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2019-11-15 19:45:41,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 3836. [2019-11-15 19:45:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3836 states. [2019-11-15 19:45:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 5799 transitions. [2019-11-15 19:45:41,164 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 5799 transitions. Word has length 244 [2019-11-15 19:45:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:41,165 INFO L462 AbstractCegarLoop]: Abstraction has 3836 states and 5799 transitions. [2019-11-15 19:45:41,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:41,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 5799 transitions. [2019-11-15 19:45:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-15 19:45:41,167 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:41,167 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:41,167 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:41,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:41,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1741030722, now seen corresponding path program 1 times [2019-11-15 19:45:41,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:41,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007785281] [2019-11-15 19:45:41,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:41,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:41,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-15 19:45:41,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007785281] [2019-11-15 19:45:41,259 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:41,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:41,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750322588] [2019-11-15 19:45:41,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:41,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:41,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:41,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:41,260 INFO L87 Difference]: Start difference. First operand 3836 states and 5799 transitions. Second operand 4 states. [2019-11-15 19:45:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:41,645 INFO L93 Difference]: Finished difference Result 8171 states and 12319 transitions. [2019-11-15 19:45:41,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:41,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-11-15 19:45:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:41,648 INFO L225 Difference]: With dead ends: 8171 [2019-11-15 19:45:41,648 INFO L226 Difference]: Without dead ends: 4354 [2019-11-15 19:45:41,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2019-11-15 19:45:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 3836. [2019-11-15 19:45:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3836 states. [2019-11-15 19:45:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 5799 transitions. [2019-11-15 19:45:41,735 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 5799 transitions. Word has length 244 [2019-11-15 19:45:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:41,735 INFO L462 AbstractCegarLoop]: Abstraction has 3836 states and 5799 transitions. [2019-11-15 19:45:41,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 5799 transitions. [2019-11-15 19:45:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-15 19:45:41,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:41,738 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:41,738 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:41,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:41,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1018162635, now seen corresponding path program 1 times [2019-11-15 19:45:41,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:41,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448101016] [2019-11-15 19:45:41,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:41,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:41,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-15 19:45:41,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448101016] [2019-11-15 19:45:41,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:41,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:41,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629514073] [2019-11-15 19:45:41,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:41,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:41,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:41,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:41,859 INFO L87 Difference]: Start difference. First operand 3836 states and 5799 transitions. Second operand 4 states. [2019-11-15 19:45:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:42,291 INFO L93 Difference]: Finished difference Result 8150 states and 12284 transitions. [2019-11-15 19:45:42,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:42,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-11-15 19:45:42,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:42,294 INFO L225 Difference]: With dead ends: 8150 [2019-11-15 19:45:42,294 INFO L226 Difference]: Without dead ends: 4333 [2019-11-15 19:45:42,295 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4333 states. [2019-11-15 19:45:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4333 to 3955. [2019-11-15 19:45:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3955 states. [2019-11-15 19:45:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 5967 transitions. [2019-11-15 19:45:42,382 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 5967 transitions. Word has length 244 [2019-11-15 19:45:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:42,382 INFO L462 AbstractCegarLoop]: Abstraction has 3955 states and 5967 transitions. [2019-11-15 19:45:42,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 5967 transitions. [2019-11-15 19:45:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-11-15 19:45:42,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:42,385 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:42,385 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:42,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:42,386 INFO L82 PathProgramCache]: Analyzing trace with hash 23329162, now seen corresponding path program 1 times [2019-11-15 19:45:42,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:42,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693266135] [2019-11-15 19:45:42,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:42,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:42,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-15 19:45:42,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693266135] [2019-11-15 19:45:42,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:42,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:45:42,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436882844] [2019-11-15 19:45:42,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:45:42,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:42,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:45:42,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:45:42,527 INFO L87 Difference]: Start difference. First operand 3955 states and 5967 transitions. Second operand 5 states. [2019-11-15 19:45:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:43,059 INFO L93 Difference]: Finished difference Result 8374 states and 12624 transitions. [2019-11-15 19:45:43,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 19:45:43,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 245 [2019-11-15 19:45:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:43,064 INFO L225 Difference]: With dead ends: 8374 [2019-11-15 19:45:43,064 INFO L226 Difference]: Without dead ends: 4438 [2019-11-15 19:45:43,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-15 19:45:43,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4438 states. [2019-11-15 19:45:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4438 to 4200. [2019-11-15 19:45:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4200 states. [2019-11-15 19:45:43,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4200 states to 4200 states and 6352 transitions. [2019-11-15 19:45:43,157 INFO L78 Accepts]: Start accepts. Automaton has 4200 states and 6352 transitions. Word has length 245 [2019-11-15 19:45:43,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:43,157 INFO L462 AbstractCegarLoop]: Abstraction has 4200 states and 6352 transitions. [2019-11-15 19:45:43,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:45:43,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4200 states and 6352 transitions. [2019-11-15 19:45:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-11-15 19:45:43,160 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:43,160 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:43,160 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:43,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:43,160 INFO L82 PathProgramCache]: Analyzing trace with hash 119002350, now seen corresponding path program 1 times [2019-11-15 19:45:43,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:43,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742324664] [2019-11-15 19:45:43,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:43,161 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:43,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 372 proven. 68 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 19:45:43,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742324664] [2019-11-15 19:45:43,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248051726] [2019-11-15 19:45:43,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:43,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 19:45:43,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:45:43,697 INFO L375 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 20 treesize of output 8 [2019-11-15 19:45:43,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:43,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:43,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:43,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:45:43,718 INFO L375 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-15 19:45:43,718 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:43,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:43,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:43,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 19:45:43,742 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.base_158|], 2=[|v_#memory_int_188|]} [2019-11-15 19:45:43,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-15 19:45:43,746 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:43,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:43,755 INFO L375 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 25 treesize of output 13 [2019-11-15 19:45:43,755 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:43,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:43,785 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:43,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-15 19:45:43,786 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:43,810 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-15 19:45:43,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:43,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:43,815 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-15 19:45:43,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:43,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:43,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:43,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 19:45:43,873 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:43,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:43,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:43,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-15 19:45:43,906 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:43,970 INFO L567 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-11-15 19:45:43,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 19:45:43,971 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-15 19:45:44,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:44,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:44,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:45:44,019 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:44,022 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:45:44,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:45:44,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:44,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:44,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 19:45:44,028 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-11-15 19:45:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 368 proven. 20 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-15 19:45:44,175 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:45:44,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-15 19:45:44,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003996084] [2019-11-15 19:45:44,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 19:45:44,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:44,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 19:45:44,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-15 19:45:44,176 INFO L87 Difference]: Start difference. First operand 4200 states and 6352 transitions. Second operand 15 states. [2019-11-15 19:45:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:47,275 INFO L93 Difference]: Finished difference Result 10349 states and 15463 transitions. [2019-11-15 19:45:47,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 19:45:47,276 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 249 [2019-11-15 19:45:47,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:47,280 INFO L225 Difference]: With dead ends: 10349 [2019-11-15 19:45:47,280 INFO L226 Difference]: Without dead ends: 6168 [2019-11-15 19:45:47,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 247 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-11-15 19:45:47,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6168 states. [2019-11-15 19:45:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6168 to 4550. [2019-11-15 19:45:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4550 states. [2019-11-15 19:45:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 6898 transitions. [2019-11-15 19:45:47,394 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 6898 transitions. Word has length 249 [2019-11-15 19:45:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:47,394 INFO L462 AbstractCegarLoop]: Abstraction has 4550 states and 6898 transitions. [2019-11-15 19:45:47,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 19:45:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 6898 transitions. [2019-11-15 19:45:47,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-15 19:45:47,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:47,397 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:47,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:47,598 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:47,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:47,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1721578264, now seen corresponding path program 1 times [2019-11-15 19:45:47,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:47,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695532491] [2019-11-15 19:45:47,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:47,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:47,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-11-15 19:45:47,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695532491] [2019-11-15 19:45:47,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:47,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 19:45:47,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774018503] [2019-11-15 19:45:47,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:45:47,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:47,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:45:47,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:45:47,876 INFO L87 Difference]: Start difference. First operand 4550 states and 6898 transitions. Second operand 7 states. [2019-11-15 19:45:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:49,058 INFO L93 Difference]: Finished difference Result 11115 states and 16701 transitions. [2019-11-15 19:45:49,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:45:49,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 250 [2019-11-15 19:45:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:49,063 INFO L225 Difference]: With dead ends: 11115 [2019-11-15 19:45:49,063 INFO L226 Difference]: Without dead ends: 6584 [2019-11-15 19:45:49,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:45:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6584 states. [2019-11-15 19:45:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6584 to 4550. [2019-11-15 19:45:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4550 states. [2019-11-15 19:45:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 6891 transitions. [2019-11-15 19:45:49,194 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 6891 transitions. Word has length 250 [2019-11-15 19:45:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:49,194 INFO L462 AbstractCegarLoop]: Abstraction has 4550 states and 6891 transitions. [2019-11-15 19:45:49,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:45:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 6891 transitions. [2019-11-15 19:45:49,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-15 19:45:49,198 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:49,198 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:49,198 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:49,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:49,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1014981658, now seen corresponding path program 1 times [2019-11-15 19:45:49,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:49,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679420679] [2019-11-15 19:45:49,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:49,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:49,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-15 19:45:49,446 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679420679] [2019-11-15 19:45:49,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:49,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 19:45:49,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386185297] [2019-11-15 19:45:49,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:45:49,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:49,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:45:49,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:45:49,448 INFO L87 Difference]: Start difference. First operand 4550 states and 6891 transitions. Second operand 7 states. [2019-11-15 19:45:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:50,902 INFO L93 Difference]: Finished difference Result 10896 states and 16369 transitions. [2019-11-15 19:45:50,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:45:50,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 250 [2019-11-15 19:45:50,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:50,909 INFO L225 Difference]: With dead ends: 10896 [2019-11-15 19:45:50,909 INFO L226 Difference]: Without dead ends: 6365 [2019-11-15 19:45:50,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:45:50,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6365 states. [2019-11-15 19:45:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6365 to 4725. [2019-11-15 19:45:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-15 19:45:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 7164 transitions. [2019-11-15 19:45:51,054 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 7164 transitions. Word has length 250 [2019-11-15 19:45:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:51,055 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 7164 transitions. [2019-11-15 19:45:51,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:45:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 7164 transitions. [2019-11-15 19:45:51,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-11-15 19:45:51,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:51,058 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:51,058 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:51,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:51,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1602122378, now seen corresponding path program 1 times [2019-11-15 19:45:51,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:51,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934745029] [2019-11-15 19:45:51,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:51,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:51,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-11-15 19:45:51,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934745029] [2019-11-15 19:45:51,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:51,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:51,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524541578] [2019-11-15 19:45:51,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:51,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:51,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:51,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:51,147 INFO L87 Difference]: Start difference. First operand 4725 states and 7164 transitions. Second operand 4 states. [2019-11-15 19:45:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:51,696 INFO L93 Difference]: Finished difference Result 9522 states and 14443 transitions. [2019-11-15 19:45:51,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:51,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2019-11-15 19:45:51,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:51,701 INFO L225 Difference]: With dead ends: 9522 [2019-11-15 19:45:51,701 INFO L226 Difference]: Without dead ends: 4816 [2019-11-15 19:45:51,704 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-11-15 19:45:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4725. [2019-11-15 19:45:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-15 19:45:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 7157 transitions. [2019-11-15 19:45:51,840 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 7157 transitions. Word has length 253 [2019-11-15 19:45:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:51,840 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 7157 transitions. [2019-11-15 19:45:51,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 7157 transitions. [2019-11-15 19:45:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-15 19:45:51,843 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:51,843 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:51,843 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:51,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1690541322, now seen corresponding path program 1 times [2019-11-15 19:45:51,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:51,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937992172] [2019-11-15 19:45:51,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:51,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:51,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-11-15 19:45:51,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937992172] [2019-11-15 19:45:51,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:51,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:51,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635104406] [2019-11-15 19:45:51,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:51,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:51,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:51,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:51,932 INFO L87 Difference]: Start difference. First operand 4725 states and 7157 transitions. Second operand 4 states. [2019-11-15 19:45:52,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:52,355 INFO L93 Difference]: Finished difference Result 9522 states and 14429 transitions. [2019-11-15 19:45:52,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:52,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-11-15 19:45:52,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:52,360 INFO L225 Difference]: With dead ends: 9522 [2019-11-15 19:45:52,360 INFO L226 Difference]: Without dead ends: 4816 [2019-11-15 19:45:52,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-11-15 19:45:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4725. [2019-11-15 19:45:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-15 19:45:52,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 7150 transitions. [2019-11-15 19:45:52,578 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 7150 transitions. Word has length 254 [2019-11-15 19:45:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:52,578 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 7150 transitions. [2019-11-15 19:45:52,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 7150 transitions. [2019-11-15 19:45:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-15 19:45:52,581 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:52,582 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:52,582 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:52,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:52,582 INFO L82 PathProgramCache]: Analyzing trace with hash 709157585, now seen corresponding path program 1 times [2019-11-15 19:45:52,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:52,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192278522] [2019-11-15 19:45:52,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:52,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:52,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-11-15 19:45:52,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192278522] [2019-11-15 19:45:52,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:52,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:52,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502564921] [2019-11-15 19:45:52,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:52,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:52,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:52,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:52,686 INFO L87 Difference]: Start difference. First operand 4725 states and 7150 transitions. Second operand 4 states. [2019-11-15 19:45:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:53,089 INFO L93 Difference]: Finished difference Result 9501 states and 14390 transitions. [2019-11-15 19:45:53,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:53,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-11-15 19:45:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:53,093 INFO L225 Difference]: With dead ends: 9501 [2019-11-15 19:45:53,093 INFO L226 Difference]: Without dead ends: 4795 [2019-11-15 19:45:53,095 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2019-11-15 19:45:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 4725. [2019-11-15 19:45:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-15 19:45:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 7143 transitions. [2019-11-15 19:45:53,220 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 7143 transitions. Word has length 255 [2019-11-15 19:45:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:53,220 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 7143 transitions. [2019-11-15 19:45:53,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 7143 transitions. [2019-11-15 19:45:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-15 19:45:53,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:53,223 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:53,223 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:53,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash 895063216, now seen corresponding path program 1 times [2019-11-15 19:45:53,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:53,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924003793] [2019-11-15 19:45:53,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:53,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:53,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 19:45:53,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924003793] [2019-11-15 19:45:53,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:53,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:53,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888638147] [2019-11-15 19:45:53,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:53,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:53,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:53,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:53,320 INFO L87 Difference]: Start difference. First operand 4725 states and 7143 transitions. Second operand 4 states. [2019-11-15 19:45:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:53,799 INFO L93 Difference]: Finished difference Result 9620 states and 14521 transitions. [2019-11-15 19:45:53,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:53,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-11-15 19:45:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:53,804 INFO L225 Difference]: With dead ends: 9620 [2019-11-15 19:45:53,804 INFO L226 Difference]: Without dead ends: 4914 [2019-11-15 19:45:53,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4914 states. [2019-11-15 19:45:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4914 to 4725. [2019-11-15 19:45:53,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-15 19:45:53,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 7136 transitions. [2019-11-15 19:45:53,934 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 7136 transitions. Word has length 261 [2019-11-15 19:45:53,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:53,934 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 7136 transitions. [2019-11-15 19:45:53,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 7136 transitions. [2019-11-15 19:45:53,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-15 19:45:53,937 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:53,937 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:53,937 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:53,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:53,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1482474339, now seen corresponding path program 1 times [2019-11-15 19:45:53,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:53,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168935543] [2019-11-15 19:45:53,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:53,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:53,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 19:45:54,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168935543] [2019-11-15 19:45:54,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:54,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:54,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706699370] [2019-11-15 19:45:54,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:54,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:54,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:54,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:54,028 INFO L87 Difference]: Start difference. First operand 4725 states and 7136 transitions. Second operand 4 states. [2019-11-15 19:45:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:54,429 INFO L93 Difference]: Finished difference Result 9592 states and 14468 transitions. [2019-11-15 19:45:54,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:54,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-11-15 19:45:54,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:54,432 INFO L225 Difference]: With dead ends: 9592 [2019-11-15 19:45:54,433 INFO L226 Difference]: Without dead ends: 4886 [2019-11-15 19:45:54,434 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4886 states. [2019-11-15 19:45:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4886 to 4725. [2019-11-15 19:45:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-15 19:45:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 7129 transitions. [2019-11-15 19:45:54,554 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 7129 transitions. Word has length 262 [2019-11-15 19:45:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:54,554 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 7129 transitions. [2019-11-15 19:45:54,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 7129 transitions. [2019-11-15 19:45:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-11-15 19:45:54,557 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:54,557 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:54,557 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:54,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:54,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1784855437, now seen corresponding path program 1 times [2019-11-15 19:45:54,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:54,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701267440] [2019-11-15 19:45:54,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:54,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:54,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 19:45:54,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701267440] [2019-11-15 19:45:54,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:54,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:54,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239687003] [2019-11-15 19:45:54,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:54,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:54,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:54,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:54,699 INFO L87 Difference]: Start difference. First operand 4725 states and 7129 transitions. Second operand 4 states. [2019-11-15 19:45:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:55,254 INFO L93 Difference]: Finished difference Result 9669 states and 14556 transitions. [2019-11-15 19:45:55,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:55,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-11-15 19:45:55,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:55,258 INFO L225 Difference]: With dead ends: 9669 [2019-11-15 19:45:55,258 INFO L226 Difference]: Without dead ends: 4963 [2019-11-15 19:45:55,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4963 states. [2019-11-15 19:45:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4963 to 4725. [2019-11-15 19:45:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-15 19:45:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 7115 transitions. [2019-11-15 19:45:55,384 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 7115 transitions. Word has length 267 [2019-11-15 19:45:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:55,385 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 7115 transitions. [2019-11-15 19:45:55,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 7115 transitions. [2019-11-15 19:45:55,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-15 19:45:55,387 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:55,387 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:55,388 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:55,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:55,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1339393338, now seen corresponding path program 1 times [2019-11-15 19:45:55,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:55,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803565219] [2019-11-15 19:45:55,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:55,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:55,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 19:45:55,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803565219] [2019-11-15 19:45:55,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:45:55,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:45:55,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493146931] [2019-11-15 19:45:55,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:45:55,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:55,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:45:55,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:45:55,518 INFO L87 Difference]: Start difference. First operand 4725 states and 7115 transitions. Second operand 4 states. [2019-11-15 19:45:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:56,070 INFO L93 Difference]: Finished difference Result 9641 states and 14489 transitions. [2019-11-15 19:45:56,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:45:56,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-11-15 19:45:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:56,074 INFO L225 Difference]: With dead ends: 9641 [2019-11-15 19:45:56,074 INFO L226 Difference]: Without dead ends: 4935 [2019-11-15 19:45:56,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:45:56,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2019-11-15 19:45:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 4725. [2019-11-15 19:45:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-15 19:45:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 7101 transitions. [2019-11-15 19:45:56,204 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 7101 transitions. Word has length 268 [2019-11-15 19:45:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:56,204 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 7101 transitions. [2019-11-15 19:45:56,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:45:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 7101 transitions. [2019-11-15 19:45:56,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-11-15 19:45:56,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:56,207 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:56,207 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:45:56,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1637994647, now seen corresponding path program 1 times [2019-11-15 19:45:56,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:56,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321629900] [2019-11-15 19:45:56,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:56,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:56,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 426 proven. 34 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-11-15 19:45:56,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321629900] [2019-11-15 19:45:56,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247009342] [2019-11-15 19:45:56,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:56,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-15 19:45:56,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:45:56,685 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:56,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-11-15 19:45:56,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:56,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:56,728 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_163|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_160|]} [2019-11-15 19:45:56,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:56,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:56,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:56,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:56,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:56,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:56,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 19:45:56,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:56,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:56,784 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:56,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:56,849 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 19:45:56,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 46 [2019-11-15 19:45:56,850 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:56,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:56,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:56,866 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:106, output treesize:79 [2019-11-15 19:45:56,912 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:45:56,912 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 52 [2019-11-15 19:45:56,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:56,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:56,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:56,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2019-11-15 19:45:56,959 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:45:56,959 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 52 [2019-11-15 19:45:56,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:56,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:56,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:56,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2019-11-15 19:45:56,971 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_166|]} [2019-11-15 19:45:56,973 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:56,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,034 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 19:45:57,034 INFO L375 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 103 treesize of output 61 [2019-11-15 19:45:57,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,047 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2019-11-15 19:45:57,103 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:45:57,103 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 52 [2019-11-15 19:45:57,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2019-11-15 19:45:57,150 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:45:57,150 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 52 [2019-11-15 19:45:57,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2019-11-15 19:45:57,168 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_159|], 20=[|v_#memory_$Pointer$.base_169|]} [2019-11-15 19:45:57,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:57,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-15 19:45:57,176 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:57,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,339 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-11-15 19:45:57,340 INFO L341 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-11-15 19:45:57,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 226 [2019-11-15 19:45:57,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:45:57,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:45:57,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:45:57,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:45:57,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:45:57,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:45:57,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:45:57,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:57,377 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 19:45:57,603 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 39 [2019-11-15 19:45:57,603 INFO L567 ElimStorePlain]: treesize reduction 3414, result has 3.1 percent of original size [2019-11-15 19:45:57,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:57,604 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:106 [2019-11-15 19:45:57,661 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 30=[|v_#memory_$Pointer$.base_170|]} [2019-11-15 19:45:57,663 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:57,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,862 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2019-11-15 19:45:57,862 INFO L341 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-11-15 19:45:57,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 130 treesize of output 150 [2019-11-15 19:45:57,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:45:57,864 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,908 INFO L567 ElimStorePlain]: treesize reduction 69, result has 62.5 percent of original size [2019-11-15 19:45:57,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:57,908 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:144, output treesize:106 [2019-11-15 19:45:57,944 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_190|], 30=[|v_#memory_$Pointer$.base_171|]} [2019-11-15 19:45:57,951 INFO L375 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-15 19:45:57,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:57,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:57,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:57,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:57,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:57,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:58,110 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-11-15 19:45:58,110 INFO L341 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2019-11-15 19:45:58,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 125 treesize of output 215 [2019-11-15 19:45:58,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,118 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:58,197 INFO L567 ElimStorePlain]: treesize reduction 1044, result has 9.9 percent of original size [2019-11-15 19:45:58,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:58,198 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:138, output treesize:115 [2019-11-15 19:45:58,231 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 2=[|v_#memory_int_191|], 20=[|v_#memory_$Pointer$.base_172|]} [2019-11-15 19:45:58,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-15 19:45:58,234 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:58,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:58,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-11-15 19:45:58,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:58,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:58,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:58,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:58,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:58,371 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:58,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 121 treesize of output 155 [2019-11-15 19:45:58,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:58,420 INFO L496 ElimStorePlain]: Start of recursive call 4: 14 dim-0 vars, End of recursive call: 14 dim-0 vars, and 7 xjuncts. [2019-11-15 19:45:58,624 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 99 [2019-11-15 19:45:58,624 INFO L567 ElimStorePlain]: treesize reduction 400, result has 29.2 percent of original size [2019-11-15 19:45:58,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 14 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:58,626 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:146, output treesize:109 [2019-11-15 19:45:58,692 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:45:58,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-15 19:45:58,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:58,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:58,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:58,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-11-15 19:45:58,738 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:45:58,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-11-15 19:45:58,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:58,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:58,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:58,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-15 19:45:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 428 proven. 62 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-15 19:45:59,074 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:45:59,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-11-15 19:45:59,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100356002] [2019-11-15 19:45:59,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 19:45:59,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:59,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 19:45:59,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-11-15 19:45:59,075 INFO L87 Difference]: Start difference. First operand 4725 states and 7101 transitions. Second operand 13 states. [2019-11-15 19:46:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:03,407 INFO L93 Difference]: Finished difference Result 13443 states and 19896 transitions. [2019-11-15 19:46:03,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 19:46:03,408 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 271 [2019-11-15 19:46:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:03,412 INFO L225 Difference]: With dead ends: 13443 [2019-11-15 19:46:03,412 INFO L226 Difference]: Without dead ends: 8716 [2019-11-15 19:46:03,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2019-11-15 19:46:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8716 states. [2019-11-15 19:46:03,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8716 to 4753. [2019-11-15 19:46:03,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4753 states. [2019-11-15 19:46:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4753 states to 4753 states and 7129 transitions. [2019-11-15 19:46:03,565 INFO L78 Accepts]: Start accepts. Automaton has 4753 states and 7129 transitions. Word has length 271 [2019-11-15 19:46:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:03,565 INFO L462 AbstractCegarLoop]: Abstraction has 4753 states and 7129 transitions. [2019-11-15 19:46:03,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 19:46:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4753 states and 7129 transitions. [2019-11-15 19:46:03,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-15 19:46:03,568 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:03,568 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:03,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:03,769 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:03,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:03,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2073521936, now seen corresponding path program 1 times [2019-11-15 19:46:03,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:03,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347502686] [2019-11-15 19:46:03,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:03,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:03,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 169 proven. 9 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2019-11-15 19:46:03,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347502686] [2019-11-15 19:46:03,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487126215] [2019-11-15 19:46:03,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:04,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 19:46:04,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:46:04,193 INFO L375 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 20 treesize of output 8 [2019-11-15 19:46:04,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:04,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:04,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:04,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:46:04,200 INFO L375 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-15 19:46:04,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:04,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:04,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:04,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 19:46:04,212 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_161|, |v_#memory_$Pointer$.base_173|], 2=[|v_#memory_int_194|]} [2019-11-15 19:46:04,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-15 19:46:04,215 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:04,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:04,222 INFO L375 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 25 treesize of output 13 [2019-11-15 19:46:04,223 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:04,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:04,250 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:04,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-15 19:46:04,251 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:04,292 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-15 19:46:04,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:04,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:04,293 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-15 19:46:04,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:04,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:04,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:04,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 19:46:04,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:04,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:04,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:04,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-15 19:46:04,345 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:04,383 INFO L567 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-11-15 19:46:04,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 19:46:04,384 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-15 19:46:04,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:04,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:04,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:46:04,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:04,413 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:46:04,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:46:04,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:04,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:04,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 19:46:04,416 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-11-15 19:46:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 169 proven. 9 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2019-11-15 19:46:04,480 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:46:04,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2019-11-15 19:46:04,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012226817] [2019-11-15 19:46:04,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 19:46:04,481 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:04,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 19:46:04,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-15 19:46:04,481 INFO L87 Difference]: Start difference. First operand 4753 states and 7129 transitions. Second operand 11 states. [2019-11-15 19:46:06,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:06,346 INFO L93 Difference]: Finished difference Result 10254 states and 15236 transitions. [2019-11-15 19:46:06,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 19:46:06,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 274 [2019-11-15 19:46:06,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:06,351 INFO L225 Difference]: With dead ends: 10254 [2019-11-15 19:46:06,351 INFO L226 Difference]: Without dead ends: 5520 [2019-11-15 19:46:06,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2019-11-15 19:46:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5520 states. [2019-11-15 19:46:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5520 to 4550. [2019-11-15 19:46:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4550 states. [2019-11-15 19:46:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 6779 transitions. [2019-11-15 19:46:06,501 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 6779 transitions. Word has length 274 [2019-11-15 19:46:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:06,502 INFO L462 AbstractCegarLoop]: Abstraction has 4550 states and 6779 transitions. [2019-11-15 19:46:06,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 19:46:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 6779 transitions. [2019-11-15 19:46:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-11-15 19:46:06,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:06,504 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:06,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:06,705 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:06,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:06,705 INFO L82 PathProgramCache]: Analyzing trace with hash 136639706, now seen corresponding path program 1 times [2019-11-15 19:46:06,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:06,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553907918] [2019-11-15 19:46:06,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:06,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:06,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-11-15 19:46:06,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553907918] [2019-11-15 19:46:06,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:46:06,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:46:06,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782435409] [2019-11-15 19:46:06,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:46:06,821 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:06,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:46:06,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:46:06,821 INFO L87 Difference]: Start difference. First operand 4550 states and 6779 transitions. Second operand 4 states. [2019-11-15 19:46:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:07,477 INFO L93 Difference]: Finished difference Result 9375 states and 13922 transitions. [2019-11-15 19:46:07,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:46:07,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 280 [2019-11-15 19:46:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:07,482 INFO L225 Difference]: With dead ends: 9375 [2019-11-15 19:46:07,482 INFO L226 Difference]: Without dead ends: 4844 [2019-11-15 19:46:07,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:46:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4844 states. [2019-11-15 19:46:07,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4844 to 4550. [2019-11-15 19:46:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4550 states. [2019-11-15 19:46:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 6772 transitions. [2019-11-15 19:46:07,671 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 6772 transitions. Word has length 280 [2019-11-15 19:46:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:07,671 INFO L462 AbstractCegarLoop]: Abstraction has 4550 states and 6772 transitions. [2019-11-15 19:46:07,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:46:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 6772 transitions. [2019-11-15 19:46:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-15 19:46:07,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:07,674 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:07,674 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:07,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:07,674 INFO L82 PathProgramCache]: Analyzing trace with hash 802343563, now seen corresponding path program 1 times [2019-11-15 19:46:07,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:07,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327609414] [2019-11-15 19:46:07,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:07,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:07,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 347 proven. 1 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2019-11-15 19:46:07,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327609414] [2019-11-15 19:46:07,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129908699] [2019-11-15 19:46:07,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:08,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 19:46:08,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:46:08,029 INFO L375 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 20 treesize of output 8 [2019-11-15 19:46:08,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:08,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:08,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:08,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:46:08,035 INFO L375 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-15 19:46:08,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:08,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:08,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:08,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 19:46:08,061 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:46:08,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 19:46:08,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:08,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:08,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:08,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 19:46:08,092 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:46:08,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:46:08,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:08,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:08,097 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:08,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:46:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 347 proven. 1 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2019-11-15 19:46:08,166 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:46:08,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2019-11-15 19:46:08,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723617497] [2019-11-15 19:46:08,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 19:46:08,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:08,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 19:46:08,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 19:46:08,167 INFO L87 Difference]: Start difference. First operand 4550 states and 6772 transitions. Second operand 9 states. [2019-11-15 19:46:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:09,235 INFO L93 Difference]: Finished difference Result 9487 states and 14071 transitions. [2019-11-15 19:46:09,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 19:46:09,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2019-11-15 19:46:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:09,239 INFO L225 Difference]: With dead ends: 9487 [2019-11-15 19:46:09,239 INFO L226 Difference]: Without dead ends: 4956 [2019-11-15 19:46:09,241 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 19:46:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2019-11-15 19:46:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4529. [2019-11-15 19:46:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4529 states. [2019-11-15 19:46:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4529 states to 4529 states and 6681 transitions. [2019-11-15 19:46:09,386 INFO L78 Accepts]: Start accepts. Automaton has 4529 states and 6681 transitions. Word has length 281 [2019-11-15 19:46:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:09,387 INFO L462 AbstractCegarLoop]: Abstraction has 4529 states and 6681 transitions. [2019-11-15 19:46:09,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 19:46:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4529 states and 6681 transitions. [2019-11-15 19:46:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-15 19:46:09,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:09,389 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:09,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:09,590 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:09,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:09,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1893845787, now seen corresponding path program 1 times [2019-11-15 19:46:09,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:09,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816570115] [2019-11-15 19:46:09,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:09,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:09,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-11-15 19:46:09,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816570115] [2019-11-15 19:46:09,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:46:09,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:46:09,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286065349] [2019-11-15 19:46:09,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:46:09,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:09,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:46:09,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:46:09,701 INFO L87 Difference]: Start difference. First operand 4529 states and 6681 transitions. Second operand 4 states. [2019-11-15 19:46:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:10,126 INFO L93 Difference]: Finished difference Result 9319 states and 13708 transitions. [2019-11-15 19:46:10,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:46:10,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2019-11-15 19:46:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:10,129 INFO L225 Difference]: With dead ends: 9319 [2019-11-15 19:46:10,129 INFO L226 Difference]: Without dead ends: 4809 [2019-11-15 19:46:10,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:46:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2019-11-15 19:46:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4536. [2019-11-15 19:46:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4536 states. [2019-11-15 19:46:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6688 transitions. [2019-11-15 19:46:10,276 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6688 transitions. Word has length 281 [2019-11-15 19:46:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:10,277 INFO L462 AbstractCegarLoop]: Abstraction has 4536 states and 6688 transitions. [2019-11-15 19:46:10,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:46:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6688 transitions. [2019-11-15 19:46:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-11-15 19:46:10,280 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:10,280 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:10,280 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:10,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:10,281 INFO L82 PathProgramCache]: Analyzing trace with hash 876415707, now seen corresponding path program 1 times [2019-11-15 19:46:10,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:10,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616535049] [2019-11-15 19:46:10,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:10,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:10,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2019-11-15 19:46:10,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616535049] [2019-11-15 19:46:10,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:46:10,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:46:10,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805359832] [2019-11-15 19:46:10,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:46:10,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:10,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:46:10,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:46:10,367 INFO L87 Difference]: Start difference. First operand 4536 states and 6688 transitions. Second operand 4 states. [2019-11-15 19:46:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:10,828 INFO L93 Difference]: Finished difference Result 9319 states and 13691 transitions. [2019-11-15 19:46:10,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:46:10,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 285 [2019-11-15 19:46:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:10,832 INFO L225 Difference]: With dead ends: 9319 [2019-11-15 19:46:10,832 INFO L226 Difference]: Without dead ends: 4802 [2019-11-15 19:46:10,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:46:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states. [2019-11-15 19:46:10,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 4536. [2019-11-15 19:46:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4536 states. [2019-11-15 19:46:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6681 transitions. [2019-11-15 19:46:10,980 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6681 transitions. Word has length 285 [2019-11-15 19:46:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:10,981 INFO L462 AbstractCegarLoop]: Abstraction has 4536 states and 6681 transitions. [2019-11-15 19:46:10,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:46:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6681 transitions. [2019-11-15 19:46:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-11-15 19:46:10,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:10,983 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:10,983 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:10,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:10,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1875163048, now seen corresponding path program 1 times [2019-11-15 19:46:10,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:10,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366486171] [2019-11-15 19:46:10,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:10,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:10,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 458 proven. 13 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2019-11-15 19:46:11,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366486171] [2019-11-15 19:46:11,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856607462] [2019-11-15 19:46:11,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:11,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 19:46:11,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:46:11,297 INFO L375 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 20 treesize of output 8 [2019-11-15 19:46:11,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:11,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:11,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:11,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:46:11,313 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:46:11,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 19:46:11,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:11,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:11,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:11,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 19:46:11,339 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:46:11,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:46:11,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:11,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:11,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:11,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:46:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 458 proven. 13 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2019-11-15 19:46:11,431 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:46:11,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 19:46:11,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770817631] [2019-11-15 19:46:11,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 19:46:11,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:11,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 19:46:11,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:46:11,435 INFO L87 Difference]: Start difference. First operand 4536 states and 6681 transitions. Second operand 8 states. [2019-11-15 19:46:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:12,389 INFO L93 Difference]: Finished difference Result 9615 states and 14104 transitions. [2019-11-15 19:46:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:46:12,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 285 [2019-11-15 19:46:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:12,393 INFO L225 Difference]: With dead ends: 9615 [2019-11-15 19:46:12,393 INFO L226 Difference]: Without dead ends: 5098 [2019-11-15 19:46:12,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:46:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2019-11-15 19:46:12,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 4536. [2019-11-15 19:46:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4536 states. [2019-11-15 19:46:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6618 transitions. [2019-11-15 19:46:12,573 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6618 transitions. Word has length 285 [2019-11-15 19:46:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:12,573 INFO L462 AbstractCegarLoop]: Abstraction has 4536 states and 6618 transitions. [2019-11-15 19:46:12,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 19:46:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6618 transitions. [2019-11-15 19:46:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-15 19:46:12,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:12,578 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:12,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:12,779 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:12,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:12,779 INFO L82 PathProgramCache]: Analyzing trace with hash -768851230, now seen corresponding path program 1 times [2019-11-15 19:46:12,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:12,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228989819] [2019-11-15 19:46:12,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:12,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:12,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2019-11-15 19:46:12,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228989819] [2019-11-15 19:46:12,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:46:12,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:46:12,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047529132] [2019-11-15 19:46:12,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:46:12,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:12,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:46:12,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:46:12,922 INFO L87 Difference]: Start difference. First operand 4536 states and 6618 transitions. Second operand 4 states. [2019-11-15 19:46:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:13,347 INFO L93 Difference]: Finished difference Result 9305 states and 13537 transitions. [2019-11-15 19:46:13,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:46:13,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2019-11-15 19:46:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:13,351 INFO L225 Difference]: With dead ends: 9305 [2019-11-15 19:46:13,351 INFO L226 Difference]: Without dead ends: 4788 [2019-11-15 19:46:13,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:46:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4788 states. [2019-11-15 19:46:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4788 to 4536. [2019-11-15 19:46:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4536 states. [2019-11-15 19:46:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6611 transitions. [2019-11-15 19:46:13,501 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6611 transitions. Word has length 286 [2019-11-15 19:46:13,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:13,501 INFO L462 AbstractCegarLoop]: Abstraction has 4536 states and 6611 transitions. [2019-11-15 19:46:13,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:46:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6611 transitions. [2019-11-15 19:46:13,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-15 19:46:13,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:13,504 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:13,504 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:13,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:13,505 INFO L82 PathProgramCache]: Analyzing trace with hash -877265845, now seen corresponding path program 1 times [2019-11-15 19:46:13,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:13,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644847298] [2019-11-15 19:46:13,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:13,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:13,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 462 proven. 12 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-15 19:46:13,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644847298] [2019-11-15 19:46:13,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000471254] [2019-11-15 19:46:13,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:13,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 19:46:13,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:46:13,834 INFO L375 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 20 treesize of output 8 [2019-11-15 19:46:13,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:13,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:13,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:13,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:46:13,849 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:46:13,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 19:46:13,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:13,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:13,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:13,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 19:46:13,877 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:46:13,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:46:13,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:13,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:13,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:13,879 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:46:13,965 INFO L134 CoverageAnalysis]: Checked inductivity of 773 backedges. 462 proven. 12 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-15 19:46:13,965 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:46:13,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 19:46:13,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788236744] [2019-11-15 19:46:13,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 19:46:13,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:13,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 19:46:13,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:46:13,967 INFO L87 Difference]: Start difference. First operand 4536 states and 6611 transitions. Second operand 8 states. [2019-11-15 19:46:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:15,150 INFO L93 Difference]: Finished difference Result 9601 states and 13943 transitions. [2019-11-15 19:46:15,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:46:15,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 286 [2019-11-15 19:46:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:15,153 INFO L225 Difference]: With dead ends: 9601 [2019-11-15 19:46:15,154 INFO L226 Difference]: Without dead ends: 5084 [2019-11-15 19:46:15,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:46:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5084 states. [2019-11-15 19:46:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5084 to 4536. [2019-11-15 19:46:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4536 states. [2019-11-15 19:46:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6548 transitions. [2019-11-15 19:46:15,307 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6548 transitions. Word has length 286 [2019-11-15 19:46:15,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:15,307 INFO L462 AbstractCegarLoop]: Abstraction has 4536 states and 6548 transitions. [2019-11-15 19:46:15,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 19:46:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6548 transitions. [2019-11-15 19:46:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-15 19:46:15,312 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:15,312 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:15,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:15,516 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:15,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:15,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1033568480, now seen corresponding path program 1 times [2019-11-15 19:46:15,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:15,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048543338] [2019-11-15 19:46:15,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:15,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:15,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2019-11-15 19:46:15,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048543338] [2019-11-15 19:46:15,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:46:15,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:46:15,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516142113] [2019-11-15 19:46:15,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:46:15,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:15,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:46:15,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:46:15,621 INFO L87 Difference]: Start difference. First operand 4536 states and 6548 transitions. Second operand 4 states. [2019-11-15 19:46:16,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:16,130 INFO L93 Difference]: Finished difference Result 9291 states and 13383 transitions. [2019-11-15 19:46:16,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:46:16,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2019-11-15 19:46:16,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:16,133 INFO L225 Difference]: With dead ends: 9291 [2019-11-15 19:46:16,134 INFO L226 Difference]: Without dead ends: 4774 [2019-11-15 19:46:16,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:46:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4774 states. [2019-11-15 19:46:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4774 to 4536. [2019-11-15 19:46:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4536 states. [2019-11-15 19:46:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6541 transitions. [2019-11-15 19:46:16,286 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6541 transitions. Word has length 294 [2019-11-15 19:46:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:16,287 INFO L462 AbstractCegarLoop]: Abstraction has 4536 states and 6541 transitions. [2019-11-15 19:46:16,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:46:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6541 transitions. [2019-11-15 19:46:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-11-15 19:46:16,290 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:16,290 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:16,290 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:16,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1429454361, now seen corresponding path program 1 times [2019-11-15 19:46:16,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:16,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800310515] [2019-11-15 19:46:16,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:16,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:16,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 493 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-11-15 19:46:16,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800310515] [2019-11-15 19:46:16,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093606353] [2019-11-15 19:46:16,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:16,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 19:46:16,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:46:16,624 INFO L375 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 20 treesize of output 8 [2019-11-15 19:46:16,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:16,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:16,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:16,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:46:16,642 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:46:16,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 19:46:16,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:16,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:16,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:16,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 19:46:16,665 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:46:16,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:46:16,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:16,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:16,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:16,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:46:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 493 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-11-15 19:46:16,734 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:46:16,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 19:46:16,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263432736] [2019-11-15 19:46:16,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 19:46:16,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:16,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 19:46:16,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:46:16,735 INFO L87 Difference]: Start difference. First operand 4536 states and 6541 transitions. Second operand 8 states. [2019-11-15 19:46:17,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:17,812 INFO L93 Difference]: Finished difference Result 9909 states and 14244 transitions. [2019-11-15 19:46:17,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:46:17,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 295 [2019-11-15 19:46:17,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:17,816 INFO L225 Difference]: With dead ends: 9909 [2019-11-15 19:46:17,816 INFO L226 Difference]: Without dead ends: 5392 [2019-11-15 19:46:17,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:46:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5392 states. [2019-11-15 19:46:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5392 to 4781. [2019-11-15 19:46:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4781 states. [2019-11-15 19:46:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4781 states to 4781 states and 6870 transitions. [2019-11-15 19:46:17,977 INFO L78 Accepts]: Start accepts. Automaton has 4781 states and 6870 transitions. Word has length 295 [2019-11-15 19:46:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:17,977 INFO L462 AbstractCegarLoop]: Abstraction has 4781 states and 6870 transitions. [2019-11-15 19:46:17,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 19:46:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4781 states and 6870 transitions. [2019-11-15 19:46:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-11-15 19:46:17,980 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:17,980 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:18,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:18,181 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:18,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:18,181 INFO L82 PathProgramCache]: Analyzing trace with hash 484406111, now seen corresponding path program 1 times [2019-11-15 19:46:18,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:18,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740581639] [2019-11-15 19:46:18,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:18,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:18,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2019-11-15 19:46:18,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740581639] [2019-11-15 19:46:18,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:46:18,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:46:18,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538999] [2019-11-15 19:46:18,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:46:18,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:18,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:46:18,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:46:18,270 INFO L87 Difference]: Start difference. First operand 4781 states and 6870 transitions. Second operand 4 states. [2019-11-15 19:46:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:18,679 INFO L93 Difference]: Finished difference Result 9746 states and 13974 transitions. [2019-11-15 19:46:18,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:46:18,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 295 [2019-11-15 19:46:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:18,682 INFO L225 Difference]: With dead ends: 9746 [2019-11-15 19:46:18,683 INFO L226 Difference]: Without dead ends: 4984 [2019-11-15 19:46:18,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:46:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2019-11-15 19:46:18,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 4781. [2019-11-15 19:46:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4781 states. [2019-11-15 19:46:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4781 states to 4781 states and 6863 transitions. [2019-11-15 19:46:18,845 INFO L78 Accepts]: Start accepts. Automaton has 4781 states and 6863 transitions. Word has length 295 [2019-11-15 19:46:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:18,845 INFO L462 AbstractCegarLoop]: Abstraction has 4781 states and 6863 transitions. [2019-11-15 19:46:18,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:46:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 4781 states and 6863 transitions. [2019-11-15 19:46:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-11-15 19:46:18,849 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:18,849 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:18,849 INFO L410 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:18,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:18,850 INFO L82 PathProgramCache]: Analyzing trace with hash -436762379, now seen corresponding path program 1 times [2019-11-15 19:46:18,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:18,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451482308] [2019-11-15 19:46:18,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:18,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:18,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 497 proven. 7 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 19:46:18,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451482308] [2019-11-15 19:46:18,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94575559] [2019-11-15 19:46:18,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:19,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 19:46:19,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:46:19,216 INFO L375 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 20 treesize of output 8 [2019-11-15 19:46:19,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:19,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:19,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:19,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-15 19:46:19,231 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 19:46:19,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 19:46:19,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:19,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:19,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:19,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-15 19:46:19,263 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:46:19,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:46:19,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:19,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:19,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:19,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-15 19:46:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 497 proven. 7 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 19:46:19,338 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:46:19,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-15 19:46:19,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227455250] [2019-11-15 19:46:19,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 19:46:19,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:19,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 19:46:19,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:46:19,339 INFO L87 Difference]: Start difference. First operand 4781 states and 6863 transitions. Second operand 8 states. [2019-11-15 19:46:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:20,386 INFO L93 Difference]: Finished difference Result 10140 states and 14496 transitions. [2019-11-15 19:46:20,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:46:20,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 296 [2019-11-15 19:46:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:20,390 INFO L225 Difference]: With dead ends: 10140 [2019-11-15 19:46:20,390 INFO L226 Difference]: Without dead ends: 5364 [2019-11-15 19:46:20,392 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:46:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5364 states. [2019-11-15 19:46:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5364 to 4767. [2019-11-15 19:46:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4767 states. [2019-11-15 19:46:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4767 states to 4767 states and 6807 transitions. [2019-11-15 19:46:20,554 INFO L78 Accepts]: Start accepts. Automaton has 4767 states and 6807 transitions. Word has length 296 [2019-11-15 19:46:20,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:20,554 INFO L462 AbstractCegarLoop]: Abstraction has 4767 states and 6807 transitions. [2019-11-15 19:46:20,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 19:46:20,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4767 states and 6807 transitions. [2019-11-15 19:46:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-11-15 19:46:20,557 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:20,557 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:20,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:20,758 INFO L410 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:20,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1478341516, now seen corresponding path program 1 times [2019-11-15 19:46:20,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:20,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078004355] [2019-11-15 19:46:20,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:20,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:20,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 531 proven. 59 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-11-15 19:46:20,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078004355] [2019-11-15 19:46:20,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208189986] [2019-11-15 19:46:20,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:21,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 19:46:21,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:46:21,165 INFO L375 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-15 19:46:21,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:21,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:21,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:21,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 19:46:21,180 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|, |v_#memory_$Pointer$.base_174|], 2=[|v_#memory_int_203|]} [2019-11-15 19:46:21,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-15 19:46:21,183 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:21,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:21,190 INFO L375 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 25 treesize of output 13 [2019-11-15 19:46:21,190 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:21,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:21,214 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:21,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-15 19:46:21,215 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:21,236 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-15 19:46:21,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:21,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:21,237 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-15 19:46:21,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:21,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:21,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:21,306 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:21,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-15 19:46:21,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:21,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:21,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 19:46:21,318 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:21,358 INFO L567 ElimStorePlain]: treesize reduction 34, result has 63.8 percent of original size [2019-11-15 19:46:21,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 19:46:21,359 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-15 19:46:21,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:21,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:21,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:46:21,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:21,401 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:46:21,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-15 19:46:21,401 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:21,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:21,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 19:46:21,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:7 [2019-11-15 19:46:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-11-15 19:46:21,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:46:21,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2019-11-15 19:46:21,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959779592] [2019-11-15 19:46:21,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:46:21,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:21,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:46:21,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:46:21,520 INFO L87 Difference]: Start difference. First operand 4767 states and 6807 transitions. Second operand 6 states. [2019-11-15 19:46:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:22,786 INFO L93 Difference]: Finished difference Result 9853 states and 14006 transitions. [2019-11-15 19:46:22,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 19:46:22,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 301 [2019-11-15 19:46:22,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:22,790 INFO L225 Difference]: With dead ends: 9853 [2019-11-15 19:46:22,791 INFO L226 Difference]: Without dead ends: 5105 [2019-11-15 19:46:22,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 19:46:22,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2019-11-15 19:46:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 4767. [2019-11-15 19:46:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4767 states. [2019-11-15 19:46:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4767 states to 4767 states and 6793 transitions. [2019-11-15 19:46:22,959 INFO L78 Accepts]: Start accepts. Automaton has 4767 states and 6793 transitions. Word has length 301 [2019-11-15 19:46:22,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:22,960 INFO L462 AbstractCegarLoop]: Abstraction has 4767 states and 6793 transitions. [2019-11-15 19:46:22,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:46:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4767 states and 6793 transitions. [2019-11-15 19:46:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-11-15 19:46:22,963 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:22,964 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:23,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:23,164 INFO L410 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:23,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:23,164 INFO L82 PathProgramCache]: Analyzing trace with hash 2084116298, now seen corresponding path program 1 times [2019-11-15 19:46:23,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:23,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33046214] [2019-11-15 19:46:23,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:23,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:23,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 540 proven. 18 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-11-15 19:46:23,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33046214] [2019-11-15 19:46:23,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595460682] [2019-11-15 19:46:23,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:23,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 19:46:23,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:46:23,614 INFO L375 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-15 19:46:23,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:23,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:23,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:23,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 19:46:23,631 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_175|, |v_#memory_$Pointer$.offset_163|], 6=[|v_#memory_int_206|]} [2019-11-15 19:46:23,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-15 19:46:23,634 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:23,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:23,643 INFO L375 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 13 [2019-11-15 19:46:23,643 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:23,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:23,701 INFO L341 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-11-15 19:46:23,701 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 102 [2019-11-15 19:46:23,701 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:23,734 INFO L567 ElimStorePlain]: treesize reduction 44, result has 54.2 percent of original size [2019-11-15 19:46:23,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:23,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:23,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:23,736 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:50, output treesize:52 [2019-11-15 19:46:23,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:23,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:23,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:23,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:23,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:23,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:23,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:23,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-15 19:46:23,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:23,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:23,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:23,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:23,813 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:23,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 112 [2019-11-15 19:46:23,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:23,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:23,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:23,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:23,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-15 19:46:23,822 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:23,878 INFO L567 ElimStorePlain]: treesize reduction 46, result has 69.7 percent of original size [2019-11-15 19:46:23,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-15 19:46:23,878 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:106, output treesize:85 [2019-11-15 19:46:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-11-15 19:46:24,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:46:24,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2019-11-15 19:46:24,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621118176] [2019-11-15 19:46:24,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:46:24,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:24,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:46:24,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-15 19:46:24,036 INFO L87 Difference]: Start difference. First operand 4767 states and 6793 transitions. Second operand 6 states. [2019-11-15 19:46:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:25,189 INFO L93 Difference]: Finished difference Result 9753 states and 13862 transitions. [2019-11-15 19:46:25,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:46:25,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 301 [2019-11-15 19:46:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:25,192 INFO L225 Difference]: With dead ends: 9753 [2019-11-15 19:46:25,192 INFO L226 Difference]: Without dead ends: 5005 [2019-11-15 19:46:25,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 299 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-11-15 19:46:25,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5005 states. [2019-11-15 19:46:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5005 to 4767. [2019-11-15 19:46:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4767 states. [2019-11-15 19:46:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4767 states to 4767 states and 6786 transitions. [2019-11-15 19:46:25,361 INFO L78 Accepts]: Start accepts. Automaton has 4767 states and 6786 transitions. Word has length 301 [2019-11-15 19:46:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:25,362 INFO L462 AbstractCegarLoop]: Abstraction has 4767 states and 6786 transitions. [2019-11-15 19:46:25,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:46:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4767 states and 6786 transitions. [2019-11-15 19:46:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-11-15 19:46:25,364 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:25,365 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:25,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:25,565 INFO L410 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:25,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:25,565 INFO L82 PathProgramCache]: Analyzing trace with hash 919231635, now seen corresponding path program 1 times [2019-11-15 19:46:25,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:25,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757666420] [2019-11-15 19:46:25,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:25,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:25,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 997 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-11-15 19:46:25,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757666420] [2019-11-15 19:46:25,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:46:25,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:46:25,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138812233] [2019-11-15 19:46:25,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:46:25,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:25,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:46:25,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:46:25,673 INFO L87 Difference]: Start difference. First operand 4767 states and 6786 transitions. Second operand 4 states. [2019-11-15 19:46:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:26,137 INFO L93 Difference]: Finished difference Result 9760 states and 13848 transitions. [2019-11-15 19:46:26,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:46:26,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-11-15 19:46:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:26,141 INFO L225 Difference]: With dead ends: 9760 [2019-11-15 19:46:26,141 INFO L226 Difference]: Without dead ends: 5012 [2019-11-15 19:46:26,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:46:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5012 states. [2019-11-15 19:46:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5012 to 4767. [2019-11-15 19:46:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4767 states. [2019-11-15 19:46:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4767 states to 4767 states and 6779 transitions. [2019-11-15 19:46:26,307 INFO L78 Accepts]: Start accepts. Automaton has 4767 states and 6779 transitions. Word has length 302 [2019-11-15 19:46:26,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:26,307 INFO L462 AbstractCegarLoop]: Abstraction has 4767 states and 6779 transitions. [2019-11-15 19:46:26,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:46:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4767 states and 6779 transitions. [2019-11-15 19:46:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-11-15 19:46:26,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:26,310 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:26,310 INFO L410 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:26,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:26,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1547739665, now seen corresponding path program 1 times [2019-11-15 19:46:26,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:26,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366527052] [2019-11-15 19:46:26,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:26,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:26,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 425 proven. 363 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-15 19:46:27,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366527052] [2019-11-15 19:46:27,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129431372] [2019-11-15 19:46:27,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:27,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-15 19:46:27,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:46:27,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:27,705 INFO L375 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 27 treesize of output 31 [2019-11-15 19:46:27,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:27,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:27,746 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_183|], 2=[|v_#memory_$Pointer$.base_177|, |v_#memory_$Pointer$.base_176|]} [2019-11-15 19:46:27,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:27,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:27,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:27,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:27,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:27,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:27,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 19:46:27,780 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:27,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:27,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:27,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:27,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:27,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:27,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:27,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:27,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:46:27,812 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:27,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:27,868 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:27,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:46:27,869 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:27,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:27,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:27,882 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-15 19:46:27,921 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:27,921 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:46:27,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:27,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:27,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:27,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:46:27,954 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:27,954 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:46:27,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:27,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:27,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:27,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:46:27,972 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_178|], 12=[|v_#memory_$Pointer$.base_186|]} [2019-11-15 19:46:27,974 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:27,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:28,033 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 19:46:28,034 INFO L375 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 19:46:28,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:28,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:28,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:28,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 19:46:28,069 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:28,070 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:46:28,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:28,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:28,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:28,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:46:28,102 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:28,102 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:46:28,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:28,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:28,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:28,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:46:28,116 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_179|], 12=[|v_#memory_$Pointer$.base_189|]} [2019-11-15 19:46:28,118 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:28,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:28,181 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 19:46:28,181 INFO L375 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 19:46:28,181 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:28,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:28,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:28,190 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 19:46:28,193 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_166|], 12=[|v_#memory_$Pointer$.base_190|]} [2019-11-15 19:46:28,195 INFO L375 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 49 treesize of output 37 [2019-11-15 19:46:28,195 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:28,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:28,285 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-15 19:46:28,285 INFO L375 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 90 treesize of output 182 [2019-11-15 19:46:28,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:28,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:28,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:28,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:28,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,297 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-15 19:46:28,363 INFO L567 ElimStorePlain]: treesize reduction 893, result has 5.6 percent of original size [2019-11-15 19:46:28,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:28,363 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-15 19:46:28,366 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_180|], 12=[|v_#memory_$Pointer$.base_191|]} [2019-11-15 19:46:28,368 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:28,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:28,447 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 19:46:28,448 INFO L375 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 19:46:28,448 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:28,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:28,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:28,459 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 19:46:28,464 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_167|], 12=[|v_#memory_$Pointer$.base_192|]} [2019-11-15 19:46:28,467 INFO L375 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 49 treesize of output 37 [2019-11-15 19:46:28,467 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:28,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:28,604 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-15 19:46:28,605 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-15 19:46:28,605 INFO L375 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 90 treesize of output 182 [2019-11-15 19:46:28,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:28,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:28,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:28,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:28,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:28,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:28,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:28,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:28,620 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 15 xjuncts. [2019-11-15 19:46:28,814 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 23 [2019-11-15 19:46:28,814 INFO L567 ElimStorePlain]: treesize reduction 2570, result has 2.1 percent of original size [2019-11-15 19:46:28,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:28,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-15 19:46:28,818 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_208|], 2=[|v_#memory_$Pointer$.offset_164|, |v_#memory_$Pointer$.offset_165|, |v_#memory_$Pointer$.base_181|], 6=[|v_#memory_$Pointer$.base_182|], 12=[|v_#memory_$Pointer$.base_193|]} [2019-11-15 19:46:28,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:28,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:28,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-11-15 19:46:28,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:28,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:28,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:28,925 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-11-15 19:46:28,926 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:29,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:29,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,012 INFO L375 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 90 treesize of output 62 [2019-11-15 19:46:29,013 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:29,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:29,061 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:29,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:29,090 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:29,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:29,121 INFO L375 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 0 case distinctions, treesize of input 214 treesize of output 162 [2019-11-15 19:46:29,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 119 [2019-11-15 19:46:29,134 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:29,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:29,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,300 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-11-15 19:46:29,300 INFO L341 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-11-15 19:46:29,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 179 [2019-11-15 19:46:29,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:29,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:29,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:29,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:29,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:29,304 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:29,352 INFO L567 ElimStorePlain]: treesize reduction 24, result has 81.4 percent of original size [2019-11-15 19:46:29,353 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:29,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:29,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:29,374 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-11-15 19:46:29,418 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_168|], 6=[|v_#memory_$Pointer$.base_194|], 12=[|v_#memory_int_209|]} [2019-11-15 19:46:29,424 INFO L375 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 53 treesize of output 41 [2019-11-15 19:46:29,425 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:29,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:29,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:29,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2019-11-15 19:46:29,463 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:29,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:29,489 INFO L341 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-11-15 19:46:29,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:46:29,490 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:29,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:29,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:29,498 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:32 [2019-11-15 19:46:29,571 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:46:29,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-11-15 19:46:29,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:29,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:29,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:29,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-15 19:46:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 881 backedges. 536 proven. 118 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-11-15 19:46:30,117 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:46:30,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2019-11-15 19:46:30,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578542862] [2019-11-15 19:46:30,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 19:46:30,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:30,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 19:46:30,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-11-15 19:46:30,118 INFO L87 Difference]: Start difference. First operand 4767 states and 6779 transitions. Second operand 14 states. [2019-11-15 19:46:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:33,788 INFO L93 Difference]: Finished difference Result 20478 states and 29158 transitions. [2019-11-15 19:46:33,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 19:46:33,789 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 302 [2019-11-15 19:46:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:33,799 INFO L225 Difference]: With dead ends: 20478 [2019-11-15 19:46:33,799 INFO L226 Difference]: Without dead ends: 15730 [2019-11-15 19:46:33,803 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 303 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2019-11-15 19:46:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15730 states. [2019-11-15 19:46:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15730 to 14252. [2019-11-15 19:46:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14252 states. [2019-11-15 19:46:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14252 states to 14252 states and 20501 transitions. [2019-11-15 19:46:34,362 INFO L78 Accepts]: Start accepts. Automaton has 14252 states and 20501 transitions. Word has length 302 [2019-11-15 19:46:34,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:34,362 INFO L462 AbstractCegarLoop]: Abstraction has 14252 states and 20501 transitions. [2019-11-15 19:46:34,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 19:46:34,362 INFO L276 IsEmpty]: Start isEmpty. Operand 14252 states and 20501 transitions. [2019-11-15 19:46:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-11-15 19:46:34,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:34,374 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:34,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:34,575 INFO L410 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:34,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:34,575 INFO L82 PathProgramCache]: Analyzing trace with hash 757667439, now seen corresponding path program 1 times [2019-11-15 19:46:34,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:34,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334310200] [2019-11-15 19:46:34,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:34,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:34,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 437 proven. 209 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-11-15 19:46:34,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334310200] [2019-11-15 19:46:34,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960965498] [2019-11-15 19:46:34,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:35,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-15 19:46:35,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:46:35,259 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,259 INFO L375 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 27 treesize of output 31 [2019-11-15 19:46:35,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,292 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_202|], 2=[|v_#memory_$Pointer$.base_196|, |v_#memory_$Pointer$.base_195|]} [2019-11-15 19:46:35,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:35,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:35,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:35,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:35,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:35,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:35,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 19:46:35,318 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:35,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:35,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:35,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:35,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:35,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:35,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:46:35,349 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,388 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:35,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:46:35,388 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,399 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-15 19:46:35,437 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:35,437 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:46:35,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:46:35,470 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:35,470 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:46:35,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:46:35,479 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_197|], 12=[|v_#memory_$Pointer$.base_205|]} [2019-11-15 19:46:35,480 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:35,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,534 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 19:46:35,534 INFO L375 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 19:46:35,534 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,543 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 19:46:35,569 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:35,570 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:46:35,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:46:35,605 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:35,605 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:46:35,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:46:35,616 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_198|], 12=[|v_#memory_$Pointer$.base_208|]} [2019-11-15 19:46:35,618 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:35,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,673 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 19:46:35,673 INFO L375 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 19:46:35,674 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,682 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 19:46:35,697 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_171|], 12=[|v_#memory_$Pointer$.base_209|]} [2019-11-15 19:46:35,702 INFO L375 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 49 treesize of output 37 [2019-11-15 19:46:35,702 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:35,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,843 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-15 19:46:35,844 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-15 19:46:35,844 INFO L375 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 90 treesize of output 182 [2019-11-15 19:46:35,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:35,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:35,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:35,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:35,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:35,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:35,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:35,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:35,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 15 xjuncts. [2019-11-15 19:46:35,995 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2019-11-15 19:46:35,995 INFO L567 ElimStorePlain]: treesize reduction 2544, result has 2.0 percent of original size [2019-11-15 19:46:35,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,996 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-15 19:46:35,997 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_199|], 12=[|v_#memory_$Pointer$.base_210|]} [2019-11-15 19:46:36,000 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:36,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,053 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 19:46:36,053 INFO L375 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 19:46:36,053 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,061 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 19:46:36,064 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_172|], 12=[|v_#memory_$Pointer$.base_211|]} [2019-11-15 19:46:36,067 INFO L375 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 49 treesize of output 37 [2019-11-15 19:46:36,067 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:36,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,157 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-15 19:46:36,157 INFO L375 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 90 treesize of output 182 [2019-11-15 19:46:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:36,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:36,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:36,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,164 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,231 INFO L567 ElimStorePlain]: treesize reduction 737, result has 6.8 percent of original size [2019-11-15 19:46:36,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,232 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-15 19:46:36,234 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_210|], 2=[|v_#memory_$Pointer$.base_200|, |v_#memory_$Pointer$.offset_169|, |v_#memory_$Pointer$.offset_170|], 6=[|v_#memory_$Pointer$.base_201|], 12=[|v_#memory_$Pointer$.base_212|]} [2019-11-15 19:46:36,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,243 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-11-15 19:46:36,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,291 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:36,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,339 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 118 [2019-11-15 19:46:36,339 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,376 INFO L375 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 116 treesize of output 88 [2019-11-15 19:46:36,377 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,406 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:36,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,432 INFO L375 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 0 case distinctions, treesize of input 214 treesize of output 162 [2019-11-15 19:46:36,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 119 [2019-11-15 19:46:36,448 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,567 INFO L341 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-11-15 19:46:36,568 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 179 [2019-11-15 19:46:36,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:36,570 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,609 INFO L567 ElimStorePlain]: treesize reduction 146, result has 41.8 percent of original size [2019-11-15 19:46:36,609 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,626 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-11-15 19:46:36,655 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_173|], 6=[|v_#memory_$Pointer$.base_213|], 12=[|v_#memory_int_211|]} [2019-11-15 19:46:36,658 INFO L375 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 53 treesize of output 41 [2019-11-15 19:46:36,658 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:36,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:36,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2019-11-15 19:46:36,678 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:36,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,696 INFO L341 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-11-15 19:46:36,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:46:36,696 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:36,703 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:38 [2019-11-15 19:46:36,749 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:46:36,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 13 [2019-11-15 19:46:36,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2019-11-15 19:46:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 537 proven. 118 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-11-15 19:46:37,160 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:46:37,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-15 19:46:37,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901801319] [2019-11-15 19:46:37,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 19:46:37,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:37,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 19:46:37,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:46:37,162 INFO L87 Difference]: Start difference. First operand 14252 states and 20501 transitions. Second operand 10 states. [2019-11-15 19:46:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:39,755 INFO L93 Difference]: Finished difference Result 36233 states and 51766 transitions. [2019-11-15 19:46:39,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:46:39,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 303 [2019-11-15 19:46:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:39,771 INFO L225 Difference]: With dead ends: 36233 [2019-11-15 19:46:39,771 INFO L226 Difference]: Without dead ends: 22000 [2019-11-15 19:46:39,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-11-15 19:46:39,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22000 states. [2019-11-15 19:46:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22000 to 14126. [2019-11-15 19:46:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-11-15 19:46:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 20249 transitions. [2019-11-15 19:46:40,429 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 20249 transitions. Word has length 303 [2019-11-15 19:46:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:40,430 INFO L462 AbstractCegarLoop]: Abstraction has 14126 states and 20249 transitions. [2019-11-15 19:46:40,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 19:46:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 20249 transitions. [2019-11-15 19:46:40,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-15 19:46:40,438 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:40,438 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 7, 7, 7, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:40,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:40,639 INFO L410 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:40,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:40,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1259184462, now seen corresponding path program 1 times [2019-11-15 19:46:40,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:40,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8112453] [2019-11-15 19:46:40,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:40,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:40,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-11-15 19:46:40,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8112453] [2019-11-15 19:46:40,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:46:40,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:46:40,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746924751] [2019-11-15 19:46:40,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:46:40,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:40,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:46:40,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:46:40,756 INFO L87 Difference]: Start difference. First operand 14126 states and 20249 transitions. Second operand 4 states. [2019-11-15 19:46:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:41,762 INFO L93 Difference]: Finished difference Result 28632 states and 41006 transitions. [2019-11-15 19:46:41,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:46:41,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-11-15 19:46:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:41,773 INFO L225 Difference]: With dead ends: 28632 [2019-11-15 19:46:41,773 INFO L226 Difference]: Without dead ends: 14525 [2019-11-15 19:46:41,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:46:41,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14525 states. [2019-11-15 19:46:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14525 to 14126. [2019-11-15 19:46:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-11-15 19:46:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 20228 transitions. [2019-11-15 19:46:42,298 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 20228 transitions. Word has length 304 [2019-11-15 19:46:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:42,298 INFO L462 AbstractCegarLoop]: Abstraction has 14126 states and 20228 transitions. [2019-11-15 19:46:42,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:46:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 20228 transitions. [2019-11-15 19:46:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-11-15 19:46:42,308 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:42,308 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:42,308 INFO L410 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:42,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:42,309 INFO L82 PathProgramCache]: Analyzing trace with hash -759892914, now seen corresponding path program 1 times [2019-11-15 19:46:42,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:42,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466547185] [2019-11-15 19:46:42,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:42,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:42,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 557 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-11-15 19:46:42,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466547185] [2019-11-15 19:46:42,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:46:42,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:46:42,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132637728] [2019-11-15 19:46:42,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:46:42,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:42,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:46:42,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:46:42,444 INFO L87 Difference]: Start difference. First operand 14126 states and 20228 transitions. Second operand 4 states. [2019-11-15 19:46:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:43,424 INFO L93 Difference]: Finished difference Result 28674 states and 40967 transitions. [2019-11-15 19:46:43,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:46:43,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-11-15 19:46:43,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:43,436 INFO L225 Difference]: With dead ends: 28674 [2019-11-15 19:46:43,436 INFO L226 Difference]: Without dead ends: 14567 [2019-11-15 19:46:43,443 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:46:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14567 states. [2019-11-15 19:46:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14567 to 14126. [2019-11-15 19:46:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-11-15 19:46:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 20207 transitions. [2019-11-15 19:46:43,967 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 20207 transitions. Word has length 306 [2019-11-15 19:46:43,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:43,968 INFO L462 AbstractCegarLoop]: Abstraction has 14126 states and 20207 transitions. [2019-11-15 19:46:43,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:46:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 20207 transitions. [2019-11-15 19:46:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-15 19:46:43,977 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:43,977 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:43,977 INFO L410 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:46:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1929799126, now seen corresponding path program 1 times [2019-11-15 19:46:43,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:43,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132911234] [2019-11-15 19:46:43,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:43,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:43,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:44,490 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-11-15 19:46:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 470 proven. 301 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-15 19:46:44,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132911234] [2019-11-15 19:46:44,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396965922] [2019-11-15 19:46:44,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:45,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 19:46:45,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:46:45,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:45,100 INFO L375 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 27 treesize of output 31 [2019-11-15 19:46:45,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:45,141 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_218|], 2=[|v_#memory_$Pointer$.base_215|, |v_#memory_$Pointer$.base_214|]} [2019-11-15 19:46:45,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:45,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:45,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:45,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:45,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:45,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:45,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 19:46:45,165 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:45,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:45,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:45,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:45,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:45,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:45,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:45,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:46:45,198 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:45,238 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:45,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:46:45,238 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:45,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,250 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-15 19:46:45,311 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:45,312 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:46:45,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:45,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,321 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:46:45,358 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:45,358 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:46:45,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:45,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:46:45,369 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_216|], 12=[|v_#memory_$Pointer$.base_221|]} [2019-11-15 19:46:45,370 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:45,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:45,423 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 19:46:45,423 INFO L375 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 19:46:45,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:45,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,432 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 19:46:45,458 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:45,458 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:46:45,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:45,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:46:45,517 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:46:45,517 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:46:45,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:45,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:46:45,534 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_174|], 20=[|v_#memory_$Pointer$.base_224|]} [2019-11-15 19:46:45,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:45,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-15 19:46:45,538 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:45,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:45,697 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-11-15 19:46:45,697 INFO L341 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-11-15 19:46:45,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-15 19:46:45,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:45,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:45,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:45,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:45,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:45,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:45,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:45,745 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:45,923 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 34 [2019-11-15 19:46:45,923 INFO L567 ElimStorePlain]: treesize reduction 5754, result has 1.4 percent of original size [2019-11-15 19:46:45,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:45,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:80 [2019-11-15 19:46:45,953 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_217|], 30=[|v_#memory_$Pointer$.base_225|]} [2019-11-15 19:46:45,954 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:45,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:46,117 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2019-11-15 19:46:46,117 INFO L341 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-11-15 19:46:46,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2019-11-15 19:46:46,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,119 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:46,146 INFO L567 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-11-15 19:46:46,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:46,147 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-11-15 19:46:46,283 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 52 [2019-11-15 19:46:46,284 INFO L341 Elim1Store]: treesize reduction 284, result has 23.2 percent of original size [2019-11-15 19:46:46,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 111 [2019-11-15 19:46:46,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:46,306 INFO L567 ElimStorePlain]: treesize reduction 35, result has 69.6 percent of original size [2019-11-15 19:46:46,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:46,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:80 [2019-11-15 19:46:46,309 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_212|], 2=[|v_#memory_$Pointer$.offset_175|], 30=[|v_#memory_$Pointer$.base_227|]} [2019-11-15 19:46:46,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 21 [2019-11-15 19:46:46,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:46,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:46,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-11-15 19:46:46,341 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:46,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:46,657 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-11-15 19:46:46,657 INFO L341 Elim1Store]: treesize reduction 36, result has 92.4 percent of original size [2019-11-15 19:46:46,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 150 treesize of output 507 [2019-11-15 19:46:46,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:46,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:46,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:47,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:47,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2019-11-15 19:46:48,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:48,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:48,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:49,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:49,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:49,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:49,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:49,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:49,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:46:49,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:49,154 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 38 xjuncts. [2019-11-15 19:46:58,869 WARN L191 SmtUtils]: Spent 9.71 s on a formula simplification. DAG size of input: 1129 DAG size of output: 49 [2019-11-15 19:46:58,869 INFO L567 ElimStorePlain]: treesize reduction 556393, result has 0.0 percent of original size [2019-11-15 19:46:58,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 19:46:58,871 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:209, output treesize:176 [2019-11-15 19:46:58,947 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_176|, |v_#memory_int_213|], 12=[|v_#memory_$Pointer$.base_228|]} [2019-11-15 19:46:58,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:58,951 INFO L375 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 41 treesize of output 25 [2019-11-15 19:46:58,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:58,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:58,970 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2019-11-15 19:46:58,970 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:58,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:58,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:58,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:58,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:58,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:58,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:58,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:58,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 59 [2019-11-15 19:46:58,994 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:59,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:59,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:59,006 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:125, output treesize:83 [2019-11-15 19:46:59,043 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_177|, |#memory_$Pointer$.base|], 6=[|v_#memory_int_214|], 12=[|v_#memory_$Pointer$.base_229|]} [2019-11-15 19:46:59,047 INFO L375 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 53 treesize of output 41 [2019-11-15 19:46:59,047 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:59,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:59,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:59,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:59,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:59,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2019-11-15 19:46:59,087 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:59,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:59,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:59,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:59,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:59,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 32 [2019-11-15 19:46:59,105 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:59,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:59,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:59,113 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:133, output treesize:38 [2019-11-15 19:46:59,160 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:46:59,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 13 [2019-11-15 19:46:59,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:59,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:59,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:59,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2019-11-15 19:46:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 589 proven. 154 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-15 19:46:59,751 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:46:59,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-11-15 19:46:59,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606081471] [2019-11-15 19:46:59,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 19:46:59,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:59,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 19:46:59,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-15 19:46:59,752 INFO L87 Difference]: Start difference. First operand 14126 states and 20207 transitions. Second operand 19 states. [2019-11-15 19:47:09,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:47:09,416 INFO L93 Difference]: Finished difference Result 54408 states and 76383 transitions. [2019-11-15 19:47:09,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 19:47:09,417 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 307 [2019-11-15 19:47:09,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:47:09,442 INFO L225 Difference]: With dead ends: 54408 [2019-11-15 19:47:09,442 INFO L226 Difference]: Without dead ends: 40301 [2019-11-15 19:47:09,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=517, Invalid=1739, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 19:47:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40301 states. [2019-11-15 19:47:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40301 to 14126. [2019-11-15 19:47:10,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-11-15 19:47:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 20207 transitions. [2019-11-15 19:47:10,112 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 20207 transitions. Word has length 307 [2019-11-15 19:47:10,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:47:10,113 INFO L462 AbstractCegarLoop]: Abstraction has 14126 states and 20207 transitions. [2019-11-15 19:47:10,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 19:47:10,113 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 20207 transitions. [2019-11-15 19:47:10,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-15 19:47:10,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:47:10,122 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:47:10,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:47:10,322 INFO L410 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:47:10,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:47:10,323 INFO L82 PathProgramCache]: Analyzing trace with hash 910899252, now seen corresponding path program 1 times [2019-11-15 19:47:10,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:47:10,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287504863] [2019-11-15 19:47:10,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:47:10,323 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:47:10,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:47:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:47:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 473 proven. 269 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-15 19:47:10,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287504863] [2019-11-15 19:47:10,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372524815] [2019-11-15 19:47:10,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:47:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:47:11,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 19:47:11,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:47:11,287 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:11,287 INFO L375 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 27 treesize of output 31 [2019-11-15 19:47:11,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:11,337 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_234|], 2=[|v_#memory_$Pointer$.base_231|, |v_#memory_$Pointer$.base_230|]} [2019-11-15 19:47:11,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:11,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:11,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:11,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:11,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:11,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:11,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 19:47:11,385 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:11,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:11,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:11,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:11,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:11,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:11,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:11,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:47:11,438 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:11,499 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:47:11,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:47:11,499 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:11,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,517 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-15 19:47:11,574 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:47:11,575 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:47:11,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:11,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:47:11,623 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:47:11,623 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:47:11,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:11,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:47:11,634 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_232|], 12=[|v_#memory_$Pointer$.base_237|]} [2019-11-15 19:47:11,636 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:11,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:11,708 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 19:47:11,708 INFO L375 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 19:47:11,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:11,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,717 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 19:47:11,750 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:47:11,750 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:47:11,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:11,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,757 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:47:11,781 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:47:11,782 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:47:11,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:11,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:11,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:47:11,797 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_178|], 20=[|v_#memory_$Pointer$.base_240|]} [2019-11-15 19:47:11,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:11,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-15 19:47:11,802 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:11,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:11,957 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-11-15 19:47:11,958 INFO L341 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-11-15 19:47:11,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-15 19:47:11,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:11,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:11,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,040 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 24 xjuncts. [2019-11-15 19:47:12,353 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 34 [2019-11-15 19:47:12,353 INFO L567 ElimStorePlain]: treesize reduction 12963, result has 0.6 percent of original size [2019-11-15 19:47:12,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:12,353 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:80 [2019-11-15 19:47:12,378 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_233|], 30=[|v_#memory_$Pointer$.base_241|]} [2019-11-15 19:47:12,380 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:12,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:12,543 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2019-11-15 19:47:12,544 INFO L341 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-11-15 19:47:12,544 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2019-11-15 19:47:12,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:12,545 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:12,573 INFO L567 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-11-15 19:47:12,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:12,574 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-11-15 19:47:12,674 INFO L341 Elim1Store]: treesize reduction 284, result has 23.2 percent of original size [2019-11-15 19:47:12,674 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 99 treesize of output 111 [2019-11-15 19:47:12,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:12,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:12,697 INFO L567 ElimStorePlain]: treesize reduction 35, result has 69.6 percent of original size [2019-11-15 19:47:12,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:12,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:80 [2019-11-15 19:47:12,699 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_215|], 2=[|v_#memory_$Pointer$.offset_179|], 30=[|v_#memory_$Pointer$.base_243|]} [2019-11-15 19:47:12,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 21 [2019-11-15 19:47:12,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:12,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:12,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-11-15 19:47:12,726 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:12,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:13,044 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 112 [2019-11-15 19:47:13,044 INFO L341 Elim1Store]: treesize reduction 36, result has 92.4 percent of original size [2019-11-15 19:47:13,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 150 treesize of output 507 [2019-11-15 19:47:13,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:13,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:13,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:14,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:14,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:47:15,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:15,598 INFO L496 ElimStorePlain]: Start of recursive call 4: 108 dim-0 vars, End of recursive call: 108 dim-0 vars, and 214 xjuncts. [2019-11-15 19:47:44,814 WARN L191 SmtUtils]: Spent 29.21 s on a formula simplification. DAG size of input: 2627 DAG size of output: 49 [2019-11-15 19:47:44,814 INFO L567 ElimStorePlain]: treesize reduction 462805, result has 0.0 percent of original size [2019-11-15 19:47:44,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 19:47:44,814 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:209, output treesize:176 [2019-11-15 19:47:44,863 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_180|, |v_#memory_int_216|], 12=[|v_#memory_$Pointer$.base_244|]} [2019-11-15 19:47:44,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:44,868 INFO L375 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 41 treesize of output 25 [2019-11-15 19:47:44,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:44,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:44,893 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2019-11-15 19:47:44,893 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:44,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:44,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:44,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:44,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:44,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:44,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:44,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:44,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 59 [2019-11-15 19:47:44,915 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:44,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:44,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:44,936 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:125, output treesize:83 [2019-11-15 19:47:44,967 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |v_#memory_$Pointer$.offset_181|], 6=[|v_#memory_int_217|], 12=[|v_#memory_$Pointer$.base_245|]} [2019-11-15 19:47:44,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:44,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:44,985 INFO L375 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 53 treesize of output 41 [2019-11-15 19:47:44,985 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:44,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:45,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:45,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2019-11-15 19:47:45,002 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:45,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:45,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:45,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:45,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:45,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 26 [2019-11-15 19:47:45,019 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:45,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:45,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:45,026 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:133, output treesize:32 [2019-11-15 19:47:45,070 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 19:47:45,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-11-15 19:47:45,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:45,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:45,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:45,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-15 19:47:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 590 proven. 155 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-11-15 19:47:45,637 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:47:45,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-15 19:47:45,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909653539] [2019-11-15 19:47:45,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 19:47:45,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:47:45,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 19:47:45,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-11-15 19:47:45,638 INFO L87 Difference]: Start difference. First operand 14126 states and 20207 transitions. Second operand 16 states. [2019-11-15 19:47:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:47:51,672 INFO L93 Difference]: Finished difference Result 45264 states and 63859 transitions. [2019-11-15 19:47:51,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 19:47:51,673 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 308 [2019-11-15 19:47:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:47:51,696 INFO L225 Difference]: With dead ends: 45264 [2019-11-15 19:47:51,696 INFO L226 Difference]: Without dead ends: 31157 [2019-11-15 19:47:51,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=624, Unknown=0, NotChecked=0, Total=870 [2019-11-15 19:47:51,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31157 states. [2019-11-15 19:47:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31157 to 14413. [2019-11-15 19:47:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14413 states. [2019-11-15 19:47:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14413 states to 14413 states and 20732 transitions. [2019-11-15 19:47:52,372 INFO L78 Accepts]: Start accepts. Automaton has 14413 states and 20732 transitions. Word has length 308 [2019-11-15 19:47:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:47:52,373 INFO L462 AbstractCegarLoop]: Abstraction has 14413 states and 20732 transitions. [2019-11-15 19:47:52,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 19:47:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 14413 states and 20732 transitions. [2019-11-15 19:47:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-15 19:47:52,382 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:47:52,382 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:47:52,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:47:52,582 INFO L410 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:47:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:47:52,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2068431542, now seen corresponding path program 1 times [2019-11-15 19:47:52,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:47:52,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047522854] [2019-11-15 19:47:52,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:47:52,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:47:52,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:47:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:47:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 500 proven. 64 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-15 19:47:52,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047522854] [2019-11-15 19:47:52,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274273486] [2019-11-15 19:47:52,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:47:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:47:53,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-15 19:47:53,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:47:53,233 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,233 INFO L375 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 27 treesize of output 31 [2019-11-15 19:47:53,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,266 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_249|], 2=[|v_#memory_$Pointer$.base_247|, |v_#memory_$Pointer$.base_246|]} [2019-11-15 19:47:53,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,290 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 19:47:53,290 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:47:53,322 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,361 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:47:53,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:47:53,362 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,372 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-15 19:47:53,410 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:47:53,410 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:47:53,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:47:53,443 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 19:47:53,443 INFO L375 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:47:53,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 19:47:53,451 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_248|], 12=[|v_#memory_$Pointer$.base_252|]} [2019-11-15 19:47:53,453 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:53,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,507 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 19:47:53,507 INFO L375 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 19:47:53,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,516 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 19:47:53,535 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_218|], 12=[|v_#memory_$Pointer$.base_253|]} [2019-11-15 19:47:53,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,539 INFO L375 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 24 treesize of output 23 [2019-11-15 19:47:53,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:47:53,560 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,570 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,570 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:72 [2019-11-15 19:47:53,590 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_219|], 12=[|v_#memory_$Pointer$.base_254|]} [2019-11-15 19:47:53,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,595 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-11-15 19:47:53,595 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:47:53,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,640 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:81 [2019-11-15 19:47:53,673 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_182|], 6=[|v_#memory_$Pointer$.base_255|], 12=[|v_#memory_int_220|]} [2019-11-15 19:47:53,680 INFO L375 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 49 treesize of output 37 [2019-11-15 19:47:53,681 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:53,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:53,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 36 [2019-11-15 19:47:53,721 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:53,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,743 INFO L341 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-11-15 19:47:53,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 38 [2019-11-15 19:47:53,743 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,752 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:29 [2019-11-15 19:47:53,802 INFO L341 Elim1Store]: treesize reduction 120, result has 13.7 percent of original size [2019-11-15 19:47:53,802 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 38 [2019-11-15 19:47:53,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:29 [2019-11-15 19:47:53,838 INFO L375 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 43 treesize of output 35 [2019-11-15 19:47:53,841 INFO L341 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-11-15 19:47:53,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2019-11-15 19:47:53,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:53,842 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 19:47:53,849 INFO L567 ElimStorePlain]: treesize reduction 21, result has 16.0 percent of original size [2019-11-15 19:47:53,850 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:53,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:53,851 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:4 [2019-11-15 19:47:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 500 proven. 64 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-15 19:47:54,232 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:47:54,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2019-11-15 19:47:54,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778577744] [2019-11-15 19:47:54,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 19:47:54,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:47:54,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 19:47:54,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 19:47:54,234 INFO L87 Difference]: Start difference. First operand 14413 states and 20732 transitions. Second operand 13 states. [2019-11-15 19:47:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:47:56,668 INFO L93 Difference]: Finished difference Result 29253 states and 41963 transitions. [2019-11-15 19:47:56,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 19:47:56,669 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 308 [2019-11-15 19:47:56,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:47:56,678 INFO L225 Difference]: With dead ends: 29253 [2019-11-15 19:47:56,679 INFO L226 Difference]: Without dead ends: 14859 [2019-11-15 19:47:56,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 306 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2019-11-15 19:47:56,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14859 states. [2019-11-15 19:47:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14859 to 14211. [2019-11-15 19:47:57,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14211 states. [2019-11-15 19:47:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14211 states to 14211 states and 20429 transitions. [2019-11-15 19:47:57,280 INFO L78 Accepts]: Start accepts. Automaton has 14211 states and 20429 transitions. Word has length 308 [2019-11-15 19:47:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:47:57,280 INFO L462 AbstractCegarLoop]: Abstraction has 14211 states and 20429 transitions. [2019-11-15 19:47:57,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 19:47:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 14211 states and 20429 transitions. [2019-11-15 19:47:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-15 19:47:57,288 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:47:57,289 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:47:57,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:47:57,489 INFO L410 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:47:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:47:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash 266051475, now seen corresponding path program 1 times [2019-11-15 19:47:57,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:47:57,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115095093] [2019-11-15 19:47:57,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:47:57,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:47:57,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:47:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:47:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-11-15 19:47:57,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115095093] [2019-11-15 19:47:57,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:47:57,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:47:57,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120394471] [2019-11-15 19:47:57,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:47:57,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:47:57,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:47:57,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:47:57,598 INFO L87 Difference]: Start difference. First operand 14211 states and 20429 transitions. Second operand 4 states. [2019-11-15 19:47:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:47:58,604 INFO L93 Difference]: Finished difference Result 28647 states and 41114 transitions. [2019-11-15 19:47:58,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:47:58,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-11-15 19:47:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:47:58,614 INFO L225 Difference]: With dead ends: 28647 [2019-11-15 19:47:58,615 INFO L226 Difference]: Without dead ends: 14484 [2019-11-15 19:47:58,621 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:47:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14484 states. [2019-11-15 19:47:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14484 to 14211. [2019-11-15 19:47:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14211 states. [2019-11-15 19:47:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14211 states to 14211 states and 20408 transitions. [2019-11-15 19:47:59,210 INFO L78 Accepts]: Start accepts. Automaton has 14211 states and 20408 transitions. Word has length 310 [2019-11-15 19:47:59,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:47:59,210 INFO L462 AbstractCegarLoop]: Abstraction has 14211 states and 20408 transitions. [2019-11-15 19:47:59,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:47:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 14211 states and 20408 transitions. [2019-11-15 19:47:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-11-15 19:47:59,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:47:59,219 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:47:59,219 INFO L410 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:47:59,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:47:59,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1463031450, now seen corresponding path program 1 times [2019-11-15 19:47:59,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:47:59,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450673583] [2019-11-15 19:47:59,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:47:59,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:47:59,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:47:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:47:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 994 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-11-15 19:47:59,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450673583] [2019-11-15 19:47:59,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:47:59,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:47:59,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730664528] [2019-11-15 19:47:59,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:47:59,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:47:59,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:47:59,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:47:59,339 INFO L87 Difference]: Start difference. First operand 14211 states and 20408 transitions. Second operand 4 states. [2019-11-15 19:48:00,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:00,233 INFO L93 Difference]: Finished difference Result 28605 states and 41030 transitions. [2019-11-15 19:48:00,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:48:00,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2019-11-15 19:48:00,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:00,243 INFO L225 Difference]: With dead ends: 28605 [2019-11-15 19:48:00,243 INFO L226 Difference]: Without dead ends: 14442 [2019-11-15 19:48:00,250 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:48:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14442 states. [2019-11-15 19:48:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14442 to 14211. [2019-11-15 19:48:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14211 states. [2019-11-15 19:48:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14211 states to 14211 states and 20387 transitions. [2019-11-15 19:48:00,842 INFO L78 Accepts]: Start accepts. Automaton has 14211 states and 20387 transitions. Word has length 311 [2019-11-15 19:48:00,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:00,843 INFO L462 AbstractCegarLoop]: Abstraction has 14211 states and 20387 transitions. [2019-11-15 19:48:00,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:48:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 14211 states and 20387 transitions. [2019-11-15 19:48:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-11-15 19:48:00,852 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:00,852 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:00,852 INFO L410 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:00,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:00,852 INFO L82 PathProgramCache]: Analyzing trace with hash -393545609, now seen corresponding path program 1 times [2019-11-15 19:48:00,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:48:00,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171443736] [2019-11-15 19:48:00,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:48:00,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:48:00,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:48:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 590 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-11-15 19:48:00,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171443736] [2019-11-15 19:48:00,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:48:00,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:48:00,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788367147] [2019-11-15 19:48:00,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:48:00,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:48:00,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:48:00,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:48:00,979 INFO L87 Difference]: Start difference. First operand 14211 states and 20387 transitions. Second operand 4 states. [2019-11-15 19:48:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:02,513 INFO L93 Difference]: Finished difference Result 28871 states and 41319 transitions. [2019-11-15 19:48:02,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:48:02,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-11-15 19:48:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:02,523 INFO L225 Difference]: With dead ends: 28871 [2019-11-15 19:48:02,523 INFO L226 Difference]: Without dead ends: 14708 [2019-11-15 19:48:02,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:48:02,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14708 states. [2019-11-15 19:48:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14708 to 14211. [2019-11-15 19:48:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14211 states. [2019-11-15 19:48:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14211 states to 14211 states and 20366 transitions. [2019-11-15 19:48:03,122 INFO L78 Accepts]: Start accepts. Automaton has 14211 states and 20366 transitions. Word has length 314 [2019-11-15 19:48:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:03,122 INFO L462 AbstractCegarLoop]: Abstraction has 14211 states and 20366 transitions. [2019-11-15 19:48:03,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:48:03,122 INFO L276 IsEmpty]: Start isEmpty. Operand 14211 states and 20366 transitions. [2019-11-15 19:48:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-11-15 19:48:03,131 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:03,131 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:03,131 INFO L410 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:03,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:03,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1731364102, now seen corresponding path program 1 times [2019-11-15 19:48:03,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:48:03,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901639262] [2019-11-15 19:48:03,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:48:03,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:48:03,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:48:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 596 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-11-15 19:48:03,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901639262] [2019-11-15 19:48:03,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:48:03,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:48:03,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121291020] [2019-11-15 19:48:03,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:48:03,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:48:03,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:48:03,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:48:03,221 INFO L87 Difference]: Start difference. First operand 14211 states and 20366 transitions. Second operand 4 states. [2019-11-15 19:48:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:04,118 INFO L93 Difference]: Finished difference Result 28787 states and 41174 transitions. [2019-11-15 19:48:04,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:48:04,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2019-11-15 19:48:04,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:04,128 INFO L225 Difference]: With dead ends: 28787 [2019-11-15 19:48:04,128 INFO L226 Difference]: Without dead ends: 14624 [2019-11-15 19:48:04,134 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 19:48:04,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14624 states. [2019-11-15 19:48:04,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14624 to 14211. [2019-11-15 19:48:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14211 states. [2019-11-15 19:48:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14211 states to 14211 states and 20345 transitions. [2019-11-15 19:48:04,750 INFO L78 Accepts]: Start accepts. Automaton has 14211 states and 20345 transitions. Word has length 315 [2019-11-15 19:48:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:04,750 INFO L462 AbstractCegarLoop]: Abstraction has 14211 states and 20345 transitions. [2019-11-15 19:48:04,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:48:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 14211 states and 20345 transitions. [2019-11-15 19:48:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-11-15 19:48:04,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:04,759 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:04,759 INFO L410 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:04,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:04,759 INFO L82 PathProgramCache]: Analyzing trace with hash 918641200, now seen corresponding path program 1 times [2019-11-15 19:48:04,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:48:04,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602753600] [2019-11-15 19:48:04,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:48:04,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:48:04,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:48:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-11-15 19:48:04,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602753600] [2019-11-15 19:48:04,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:48:04,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:48:04,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492080429] [2019-11-15 19:48:04,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:48:04,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:48:04,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:48:04,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:48:04,956 INFO L87 Difference]: Start difference. First operand 14211 states and 20345 transitions. Second operand 6 states. [2019-11-15 19:48:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:06,662 INFO L93 Difference]: Finished difference Result 30252 states and 43103 transitions. [2019-11-15 19:48:06,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:48:06,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 316 [2019-11-15 19:48:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:06,674 INFO L225 Difference]: With dead ends: 30252 [2019-11-15 19:48:06,674 INFO L226 Difference]: Without dead ends: 16089 [2019-11-15 19:48:06,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:48:06,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16089 states. [2019-11-15 19:48:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16089 to 14211. [2019-11-15 19:48:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14211 states. [2019-11-15 19:48:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14211 states to 14211 states and 20289 transitions. [2019-11-15 19:48:07,288 INFO L78 Accepts]: Start accepts. Automaton has 14211 states and 20289 transitions. Word has length 316 [2019-11-15 19:48:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:07,288 INFO L462 AbstractCegarLoop]: Abstraction has 14211 states and 20289 transitions. [2019-11-15 19:48:07,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:48:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 14211 states and 20289 transitions. [2019-11-15 19:48:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-11-15 19:48:07,297 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:07,297 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:07,297 INFO L410 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:07,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:07,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1186400138, now seen corresponding path program 1 times [2019-11-15 19:48:07,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:48:07,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458024377] [2019-11-15 19:48:07,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:48:07,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:48:07,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:48:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 939 backedges. 583 proven. 85 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-11-15 19:48:07,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458024377] [2019-11-15 19:48:07,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901108096] [2019-11-15 19:48:07,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:48:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:07,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 1062 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 19:48:07,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:48:07,893 INFO L375 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-15 19:48:07,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:07,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:07,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:07,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 19:48:08,146 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_183|], 2=[|v_#memory_$Pointer$.base_257|, |v_#memory_int_224|]} [2019-11-15 19:48:08,149 INFO L375 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 81 treesize of output 63 [2019-11-15 19:48:08,149 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:48:08,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:08,178 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:08,178 INFO L375 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 63 treesize of output 81 [2019-11-15 19:48:08,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:48:08,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-15 19:48:08,217 INFO L567 ElimStorePlain]: treesize reduction 129, result has 30.6 percent of original size [2019-11-15 19:48:08,240 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:08,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 133 [2019-11-15 19:48:08,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:48:08,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:08,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:48:08,453 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) 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.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 19:48:08,457 INFO L168 Benchmark]: Toolchain (without parser) took 210645.64 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 938.0 MB in the beginning and 4.6 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-11-15 19:48:08,457 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:48:08,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 19:48:08,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:48:08,458 INFO L168 Benchmark]: Boogie Preprocessor took 131.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:48:08,458 INFO L168 Benchmark]: RCFGBuilder took 1172.02 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: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. [2019-11-15 19:48:08,458 INFO L168 Benchmark]: TraceAbstraction took 208490.40 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-11-15 19:48:08,459 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 746.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 131.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1172.02 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: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 208490.40 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 19:48:10,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:48:10,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:48:10,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:48:10,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:48:10,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:48:10,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:48:10,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:48:10,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:48:10,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:48:10,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:48:10,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:48:10,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:48:10,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:48:10,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:48:10,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:48:10,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:48:10,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:48:10,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:48:10,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:48:10,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:48:10,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:48:10,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:48:10,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:48:10,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:48:10,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:48:10,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:48:10,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:48:10,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:48:10,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:48:10,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:48:10,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:48:10,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:48:10,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:48:10,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:48:10,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:48:10,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:48:10,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:48:10,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:48:10,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:48:10,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:48:10,549 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 19:48:10,584 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:48:10,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:48:10,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:48:10,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:48:10,586 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:48:10,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:48:10,586 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:48:10,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:48:10,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:48:10,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 19:48:10,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 19:48:10,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 19:48:10,588 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 19:48:10,588 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 19:48:10,588 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:48:10,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 19:48:10,589 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:48:10,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 19:48:10,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:48:10,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:48:10,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 19:48:10,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 19:48:10,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:48:10,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:48:10,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 19:48:10,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 19:48:10,591 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 19:48:10,591 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 19:48:10,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 19:48:10,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 19:48:10,592 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b080422d226ffd628438a4bd0a3f8daac94fceb [2019-11-15 19:48:10,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:48:10,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:48:10,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:48:10,658 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:48:10,659 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:48:10,659 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-1.c [2019-11-15 19:48:10,707 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/data/66a2ba5c7/d4cf06c4010e44a2a1026da0b1be7a6f/FLAG7ae693241 [2019-11-15 19:48:11,258 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:48:11,259 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-1.c [2019-11-15 19:48:11,281 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/data/66a2ba5c7/d4cf06c4010e44a2a1026da0b1be7a6f/FLAG7ae693241 [2019-11-15 19:48:11,725 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/data/66a2ba5c7/d4cf06c4010e44a2a1026da0b1be7a6f [2019-11-15 19:48:11,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:48:11,730 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 19:48:11,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:48:11,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:48:11,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:48:11,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:48:11" (1/1) ... [2019-11-15 19:48:11,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0caeff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:48:11, skipping insertion in model container [2019-11-15 19:48:11,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:48:11" (1/1) ... [2019-11-15 19:48:11,744 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:48:11,819 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:48:12,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:48:12,351 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:48:12,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:48:12,530 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:48:12,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:48:12 WrapperNode [2019-11-15 19:48:12,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:48:12,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 19:48:12,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 19:48:12,531 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 19:48:12,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:48:12" (1/1) ... [2019-11-15 19:48:12,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:48:12" (1/1) ... [2019-11-15 19:48:12,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 19:48:12,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:48:12,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:48:12,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:48:12,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:48:12" (1/1) ... [2019-11-15 19:48:12,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:48:12" (1/1) ... [2019-11-15 19:48:12,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:48:12" (1/1) ... [2019-11-15 19:48:12,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:48:12" (1/1) ... [2019-11-15 19:48:12,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:48:12" (1/1) ... [2019-11-15 19:48:12,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:48:12" (1/1) ... [2019-11-15 19:48:12,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:48:12" (1/1) ... [2019-11-15 19:48:12,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:48:12,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:48:12,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:48:12,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:48:12,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:48:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/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-15 19:48:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 19:48:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 19:48:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 19:48:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 19:48:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 19:48:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:48:12,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:48:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 19:48:13,056 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 19:48:15,476 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 19:48:15,477 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 19:48:15,478 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:48:15,478 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 19:48:15,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:48:15 BoogieIcfgContainer [2019-11-15 19:48:15,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:48:15,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 19:48:15,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 19:48:15,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 19:48:15,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 07:48:11" (1/3) ... [2019-11-15 19:48:15,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495dc375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:48:15, skipping insertion in model container [2019-11-15 19:48:15,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:48:12" (2/3) ... [2019-11-15 19:48:15,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495dc375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:48:15, skipping insertion in model container [2019-11-15 19:48:15,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:48:15" (3/3) ... [2019-11-15 19:48:15,487 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-1.c [2019-11-15 19:48:15,496 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 19:48:15,503 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 19:48:15,513 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 19:48:15,533 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 19:48:15,534 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 19:48:15,534 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 19:48:15,534 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:48:15,534 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:48:15,535 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 19:48:15,535 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:48:15,535 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 19:48:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 19:48:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 19:48:15,559 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:15,560 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:15,562 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:15,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:15,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-11-15 19:48:15,577 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:48:15,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1774536151] [2019-11-15 19:48:15,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:15,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:48:15,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:48:15,832 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-15 19:48:15,832 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:48:15,859 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-15 19:48:15,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1774536151] [2019-11-15 19:48:15,860 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:48:15,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 19:48:15,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722318683] [2019-11-15 19:48:15,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:48:15,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:48:15,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:48:15,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:48:15,880 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-15 19:48:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:16,081 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-11-15 19:48:16,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:48:16,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 19:48:16,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:16,099 INFO L225 Difference]: With dead ends: 564 [2019-11-15 19:48:16,099 INFO L226 Difference]: Without dead ends: 385 [2019-11-15 19:48:16,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 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-15 19:48:16,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-15 19:48:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-11-15 19:48:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-15 19:48:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-11-15 19:48:16,169 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-11-15 19:48:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:16,170 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-11-15 19:48:16,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:48:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-11-15 19:48:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 19:48:16,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:16,175 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:16,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:16,377 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:16,378 INFO L82 PathProgramCache]: Analyzing trace with hash -718881007, now seen corresponding path program 1 times [2019-11-15 19:48:16,378 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:48:16,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1070499260] [2019-11-15 19:48:16,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:16,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:48:16,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:48:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:48:16,614 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:48:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:48:16,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1070499260] [2019-11-15 19:48:16,636 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:48:16,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 19:48:16,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834841621] [2019-11-15 19:48:16,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:48:16,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:48:16,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:48:16,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:48:16,639 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-11-15 19:48:17,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:17,000 INFO L93 Difference]: Finished difference Result 880 states and 1354 transitions. [2019-11-15 19:48:17,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:48:17,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 19:48:17,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:17,006 INFO L225 Difference]: With dead ends: 880 [2019-11-15 19:48:17,006 INFO L226 Difference]: Without dead ends: 629 [2019-11-15 19:48:17,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 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-15 19:48:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-11-15 19:48:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2019-11-15 19:48:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-15 19:48:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 953 transitions. [2019-11-15 19:48:17,049 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 953 transitions. Word has length 58 [2019-11-15 19:48:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:17,051 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 953 transitions. [2019-11-15 19:48:17,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:48:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 953 transitions. [2019-11-15 19:48:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-15 19:48:17,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:17,060 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:17,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:17,262 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:17,263 INFO L82 PathProgramCache]: Analyzing trace with hash -222873622, now seen corresponding path program 1 times [2019-11-15 19:48:17,264 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:48:17,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [405382716] [2019-11-15 19:48:17,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:17,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:48:17,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:48:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:48:17,570 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:48:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 19:48:17,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [405382716] [2019-11-15 19:48:17,592 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:48:17,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 19:48:17,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363319695] [2019-11-15 19:48:17,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:48:17,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:48:17,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:48:17,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:48:17,594 INFO L87 Difference]: Start difference. First operand 627 states and 953 transitions. Second operand 3 states. [2019-11-15 19:48:18,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:18,057 INFO L93 Difference]: Finished difference Result 1242 states and 1897 transitions. [2019-11-15 19:48:18,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:48:18,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-15 19:48:18,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:18,062 INFO L225 Difference]: With dead ends: 1242 [2019-11-15 19:48:18,063 INFO L226 Difference]: Without dead ends: 747 [2019-11-15 19:48:18,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 231 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-15 19:48:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-15 19:48:18,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2019-11-15 19:48:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-15 19:48:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1133 transitions. [2019-11-15 19:48:18,095 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1133 transitions. Word has length 117 [2019-11-15 19:48:18,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:18,096 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1133 transitions. [2019-11-15 19:48:18,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:48:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1133 transitions. [2019-11-15 19:48:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-15 19:48:18,106 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:18,107 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:18,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:18,309 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:18,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:18,309 INFO L82 PathProgramCache]: Analyzing trace with hash 369635549, now seen corresponding path program 1 times [2019-11-15 19:48:18,310 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:48:18,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [125052756] [2019-11-15 19:48:18,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:18,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:48:18,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:48:18,603 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 19:48:18,603 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:48:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 19:48:18,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [125052756] [2019-11-15 19:48:18,639 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:48:18,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 19:48:18,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825184369] [2019-11-15 19:48:18,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:48:18,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:48:18,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:48:18,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:48:18,641 INFO L87 Difference]: Start difference. First operand 747 states and 1133 transitions. Second operand 4 states. [2019-11-15 19:48:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:19,081 INFO L93 Difference]: Finished difference Result 1609 states and 2454 transitions. [2019-11-15 19:48:19,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:48:19,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-15 19:48:19,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:19,087 INFO L225 Difference]: With dead ends: 1609 [2019-11-15 19:48:19,088 INFO L226 Difference]: Without dead ends: 994 [2019-11-15 19:48:19,089 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 278 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-15 19:48:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-15 19:48:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2019-11-15 19:48:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-11-15 19:48:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1505 transitions. [2019-11-15 19:48:19,127 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1505 transitions. Word has length 141 [2019-11-15 19:48:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:19,128 INFO L462 AbstractCegarLoop]: Abstraction has 994 states and 1505 transitions. [2019-11-15 19:48:19,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:48:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1505 transitions. [2019-11-15 19:48:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-15 19:48:19,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:19,132 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:19,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:19,334 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:19,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:19,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1494342672, now seen corresponding path program 1 times [2019-11-15 19:48:19,336 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:48:19,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1328691279] [2019-11-15 19:48:19,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:19,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:48:19,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:48:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 19:48:19,658 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:48:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 19:48:19,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1328691279] [2019-11-15 19:48:19,699 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:48:19,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 19:48:19,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361182048] [2019-11-15 19:48:19,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:48:19,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:48:19,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:48:19,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:48:19,702 INFO L87 Difference]: Start difference. First operand 994 states and 1505 transitions. Second operand 4 states. [2019-11-15 19:48:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:20,310 INFO L93 Difference]: Finished difference Result 2100 states and 3192 transitions. [2019-11-15 19:48:20,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:48:20,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-15 19:48:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:20,319 INFO L225 Difference]: With dead ends: 2100 [2019-11-15 19:48:20,319 INFO L226 Difference]: Without dead ends: 1238 [2019-11-15 19:48:20,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 322 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-15 19:48:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-11-15 19:48:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1238. [2019-11-15 19:48:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1238 states. [2019-11-15 19:48:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1871 transitions. [2019-11-15 19:48:20,388 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1871 transitions. Word has length 163 [2019-11-15 19:48:20,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:20,389 INFO L462 AbstractCegarLoop]: Abstraction has 1238 states and 1871 transitions. [2019-11-15 19:48:20,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:48:20,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1871 transitions. [2019-11-15 19:48:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-15 19:48:20,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:20,393 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:20,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:20,606 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:20,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:20,606 INFO L82 PathProgramCache]: Analyzing trace with hash -329499811, now seen corresponding path program 1 times [2019-11-15 19:48:20,607 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:48:20,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [777898926] [2019-11-15 19:48:20,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:21,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:48:21,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:48:21,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:21,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2019-11-15 19:48:21,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:21,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:21,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:21,952 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 19:48:22,005 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:22,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 19:48:22,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:22,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:22,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:22,009 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 19:48:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 19:48:22,084 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:48:22,117 INFO L375 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 20 treesize of output 18 [2019-11-15 19:48:22,122 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:22,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:22,123 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:22,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:22,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:22,124 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 19:48:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 19:48:22,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [777898926] [2019-11-15 19:48:22,159 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:48:22,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 19:48:22,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618989541] [2019-11-15 19:48:22,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:48:22,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:48:22,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:48:22,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:48:22,161 INFO L87 Difference]: Start difference. First operand 1238 states and 1871 transitions. Second operand 7 states. [2019-11-15 19:48:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:33,767 INFO L93 Difference]: Finished difference Result 4634 states and 7049 transitions. [2019-11-15 19:48:33,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:48:33,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-11-15 19:48:33,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:33,787 INFO L225 Difference]: With dead ends: 4634 [2019-11-15 19:48:33,788 INFO L226 Difference]: Without dead ends: 3404 [2019-11-15 19:48:33,790 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:48:33,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2019-11-15 19:48:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 1666. [2019-11-15 19:48:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1666 states. [2019-11-15 19:48:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2649 transitions. [2019-11-15 19:48:33,873 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2649 transitions. Word has length 170 [2019-11-15 19:48:33,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:33,873 INFO L462 AbstractCegarLoop]: Abstraction has 1666 states and 2649 transitions. [2019-11-15 19:48:33,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:48:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2649 transitions. [2019-11-15 19:48:33,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-15 19:48:33,877 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:33,877 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:34,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:34,083 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:34,084 INFO L82 PathProgramCache]: Analyzing trace with hash 449764481, now seen corresponding path program 1 times [2019-11-15 19:48:34,084 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:48:34,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1358402943] [2019-11-15 19:48:34,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:35,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:48:35,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:48:35,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:35,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2019-11-15 19:48:35,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:35,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:35,353 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:35,353 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 19:48:35,385 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:35,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 19:48:35,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:35,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:35,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:35,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 19:48:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 19:48:35,477 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:48:35,523 INFO L375 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 20 treesize of output 18 [2019-11-15 19:48:35,530 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:35,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:35,531 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:35,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:35,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:35,532 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 19:48:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 19:48:35,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1358402943] [2019-11-15 19:48:35,595 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:48:35,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 19:48:35,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369245105] [2019-11-15 19:48:35,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:48:35,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:48:35,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:48:35,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:48:35,597 INFO L87 Difference]: Start difference. First operand 1666 states and 2649 transitions. Second operand 7 states. [2019-11-15 19:48:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:44,151 INFO L93 Difference]: Finished difference Result 5462 states and 8567 transitions. [2019-11-15 19:48:44,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:48:44,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-11-15 19:48:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:44,176 INFO L225 Difference]: With dead ends: 5462 [2019-11-15 19:48:44,176 INFO L226 Difference]: Without dead ends: 3804 [2019-11-15 19:48:44,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:48:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3804 states. [2019-11-15 19:48:44,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3804 to 2086. [2019-11-15 19:48:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2086 states. [2019-11-15 19:48:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 3429 transitions. [2019-11-15 19:48:44,267 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 3429 transitions. Word has length 171 [2019-11-15 19:48:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:44,268 INFO L462 AbstractCegarLoop]: Abstraction has 2086 states and 3429 transitions. [2019-11-15 19:48:44,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:48:44,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 3429 transitions. [2019-11-15 19:48:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-15 19:48:44,272 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:44,273 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:44,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:44,484 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:44,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:44,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1020234554, now seen corresponding path program 1 times [2019-11-15 19:48:44,485 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:48:44,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1599301077] [2019-11-15 19:48:44,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:46,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:48:46,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:48:46,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:46,232 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2019-11-15 19:48:46,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:46,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:46,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:46,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 19:48:46,272 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:46,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 19:48:46,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:46,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:46,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:46,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 19:48:46,340 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 107 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 19:48:46,340 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:48:46,377 INFO L375 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 22 treesize of output 20 [2019-11-15 19:48:46,380 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:46,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:46,382 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:46,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:46,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:46,383 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 19:48:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 19:48:46,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1599301077] [2019-11-15 19:48:46,415 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:48:46,415 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 19:48:46,415 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111031205] [2019-11-15 19:48:46,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:48:46,416 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:48:46,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:48:46,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:48:46,417 INFO L87 Difference]: Start difference. First operand 2086 states and 3429 transitions. Second operand 4 states. [2019-11-15 19:48:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:50,355 INFO L93 Difference]: Finished difference Result 5307 states and 8584 transitions. [2019-11-15 19:48:50,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:48:50,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-15 19:48:50,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:50,369 INFO L225 Difference]: With dead ends: 5307 [2019-11-15 19:48:50,369 INFO L226 Difference]: Without dead ends: 3229 [2019-11-15 19:48:50,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:48:50,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2019-11-15 19:48:50,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 2366. [2019-11-15 19:48:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2366 states. [2019-11-15 19:48:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3919 transitions. [2019-11-15 19:48:50,462 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3919 transitions. Word has length 192 [2019-11-15 19:48:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:50,463 INFO L462 AbstractCegarLoop]: Abstraction has 2366 states and 3919 transitions. [2019-11-15 19:48:50,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:48:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3919 transitions. [2019-11-15 19:48:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 19:48:50,468 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:50,468 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:50,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:50,684 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:50,685 INFO L82 PathProgramCache]: Analyzing trace with hash 826137891, now seen corresponding path program 1 times [2019-11-15 19:48:50,685 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:48:50,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1641092373] [2019-11-15 19:48:50,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:52,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:48:52,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:48:52,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:52,415 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2019-11-15 19:48:52,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:52,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:52,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:52,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 19:48:52,450 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:52,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 19:48:52,451 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:52,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:52,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:52,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 19:48:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 19:48:52,520 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:48:52,552 INFO L375 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 22 treesize of output 20 [2019-11-15 19:48:52,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:52,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:52,555 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:52,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:52,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:52,556 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 19:48:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 19:48:52,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1641092373] [2019-11-15 19:48:52,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:48:52,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 19:48:52,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179613226] [2019-11-15 19:48:52,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:48:52,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:48:52,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:48:52,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:48:52,586 INFO L87 Difference]: Start difference. First operand 2366 states and 3919 transitions. Second operand 4 states. [2019-11-15 19:48:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:56,285 INFO L93 Difference]: Finished difference Result 5447 states and 8794 transitions. [2019-11-15 19:48:56,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:48:56,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-15 19:48:56,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:56,299 INFO L225 Difference]: With dead ends: 5447 [2019-11-15 19:48:56,299 INFO L226 Difference]: Without dead ends: 3089 [2019-11-15 19:48:56,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:48:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2019-11-15 19:48:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 2366. [2019-11-15 19:48:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2366 states. [2019-11-15 19:48:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3899 transitions. [2019-11-15 19:48:56,395 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3899 transitions. Word has length 193 [2019-11-15 19:48:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:56,396 INFO L462 AbstractCegarLoop]: Abstraction has 2366 states and 3899 transitions. [2019-11-15 19:48:56,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:48:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3899 transitions. [2019-11-15 19:48:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-15 19:48:56,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:56,403 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:56,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:56,620 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:48:56,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:56,620 INFO L82 PathProgramCache]: Analyzing trace with hash 250171646, now seen corresponding path program 1 times [2019-11-15 19:48:56,621 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:48:56,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [209365108] [2019-11-15 19:48:56,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:48:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:59,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:48:59,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:48:59,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:59,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2019-11-15 19:48:59,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:59,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:59,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:59,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 19:48:59,527 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:59,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 19:48:59,528 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:59,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:59,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:59,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 19:48:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 238 proven. 2 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 19:48:59,583 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:48:59,608 INFO L375 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 22 treesize of output 20 [2019-11-15 19:48:59,609 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:59,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:59,610 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:59,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:59,612 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:59,612 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 19:48:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 19:48:59,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [209365108] [2019-11-15 19:48:59,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:48:59,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 19:48:59,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126555978] [2019-11-15 19:48:59,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:48:59,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:48:59,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:48:59,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:48:59,647 INFO L87 Difference]: Start difference. First operand 2366 states and 3899 transitions. Second operand 4 states. [2019-11-15 19:49:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:49:02,779 INFO L93 Difference]: Finished difference Result 5867 states and 9504 transitions. [2019-11-15 19:49:02,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:49:02,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-11-15 19:49:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:49:02,800 INFO L225 Difference]: With dead ends: 5867 [2019-11-15 19:49:02,800 INFO L226 Difference]: Without dead ends: 3509 [2019-11-15 19:49:02,803 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:49:02,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3509 states. [2019-11-15 19:49:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3509 to 2626. [2019-11-15 19:49:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2626 states. [2019-11-15 19:49:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4339 transitions. [2019-11-15 19:49:02,915 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 4339 transitions. Word has length 220 [2019-11-15 19:49:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:49:02,916 INFO L462 AbstractCegarLoop]: Abstraction has 2626 states and 4339 transitions. [2019-11-15 19:49:02,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:49:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 4339 transitions. [2019-11-15 19:49:02,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-15 19:49:02,923 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:49:02,923 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:49:03,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:49:03,143 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:49:03,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:49:03,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1164741435, now seen corresponding path program 1 times [2019-11-15 19:49:03,143 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:49:03,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1709906042] [2019-11-15 19:49:03,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:49:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:49:06,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:49:06,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:49:06,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:06,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2019-11-15 19:49:06,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:06,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:06,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:06,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 19:49:06,103 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:06,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 19:49:06,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:06,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:06,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:06,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 19:49:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 241 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 19:49:06,160 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:49:06,183 INFO L375 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 22 treesize of output 20 [2019-11-15 19:49:06,188 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:06,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:06,189 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:06,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:06,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:06,190 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 19:49:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 19:49:06,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1709906042] [2019-11-15 19:49:06,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:49:06,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 19:49:06,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050343909] [2019-11-15 19:49:06,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:49:06,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:49:06,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:49:06,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:49:06,253 INFO L87 Difference]: Start difference. First operand 2626 states and 4339 transitions. Second operand 4 states. [2019-11-15 19:49:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:49:10,310 INFO L93 Difference]: Finished difference Result 5967 states and 9634 transitions. [2019-11-15 19:49:10,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:49:10,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-11-15 19:49:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:49:10,330 INFO L225 Difference]: With dead ends: 5967 [2019-11-15 19:49:10,331 INFO L226 Difference]: Without dead ends: 3349 [2019-11-15 19:49:10,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:49:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2019-11-15 19:49:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 2626. [2019-11-15 19:49:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2626 states. [2019-11-15 19:49:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4309 transitions. [2019-11-15 19:49:10,434 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 4309 transitions. Word has length 221 [2019-11-15 19:49:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:49:10,434 INFO L462 AbstractCegarLoop]: Abstraction has 2626 states and 4309 transitions. [2019-11-15 19:49:10,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:49:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 4309 transitions. [2019-11-15 19:49:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-11-15 19:49:10,440 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:49:10,441 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:49:10,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:49:10,651 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:49:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:49:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash 441873348, now seen corresponding path program 1 times [2019-11-15 19:49:10,653 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:49:10,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1543130432] [2019-11-15 19:49:10,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:49:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:49:14,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:49:14,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:49:14,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:14,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2019-11-15 19:49:14,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:14,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:14,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:14,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 19:49:14,249 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:14,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 19:49:14,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:14,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:14,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:14,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 19:49:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 319 proven. 3 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 19:49:14,312 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:49:14,341 INFO L375 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 20 treesize of output 18 [2019-11-15 19:49:14,343 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:14,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:14,344 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:14,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:14,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:14,345 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 19:49:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 19:49:14,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1543130432] [2019-11-15 19:49:14,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:49:14,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 19:49:14,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945443245] [2019-11-15 19:49:14,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:49:14,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:49:14,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:49:14,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:49:14,382 INFO L87 Difference]: Start difference. First operand 2626 states and 4309 transitions. Second operand 4 states. [2019-11-15 19:49:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:49:17,742 INFO L93 Difference]: Finished difference Result 6345 states and 10231 transitions. [2019-11-15 19:49:17,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:49:17,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-11-15 19:49:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:49:17,756 INFO L225 Difference]: With dead ends: 6345 [2019-11-15 19:49:17,756 INFO L226 Difference]: Without dead ends: 3727 [2019-11-15 19:49:17,760 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:49:17,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2019-11-15 19:49:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 2824. [2019-11-15 19:49:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-11-15 19:49:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 4620 transitions. [2019-11-15 19:49:17,917 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 4620 transitions. Word has length 221 [2019-11-15 19:49:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:49:17,917 INFO L462 AbstractCegarLoop]: Abstraction has 2824 states and 4620 transitions. [2019-11-15 19:49:17,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:49:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 4620 transitions. [2019-11-15 19:49:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-15 19:49:17,926 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:49:17,926 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:49:18,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:49:18,143 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:49:18,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:49:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash -816446747, now seen corresponding path program 1 times [2019-11-15 19:49:18,144 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:49:18,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1648981109] [2019-11-15 19:49:18,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:49:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:49:21,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:49:21,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:49:21,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:21,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2019-11-15 19:49:21,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:21,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:21,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:21,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 19:49:21,573 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:21,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 19:49:21,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:21,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:21,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:21,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 19:49:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 325 proven. 2 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 19:49:21,631 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:49:21,656 INFO L375 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 20 treesize of output 18 [2019-11-15 19:49:21,658 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:21,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:21,659 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:21,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:21,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:21,660 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 19:49:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 19:49:21,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1648981109] [2019-11-15 19:49:21,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:49:21,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 19:49:21,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472133864] [2019-11-15 19:49:21,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:49:21,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:49:21,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:49:21,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:49:21,691 INFO L87 Difference]: Start difference. First operand 2824 states and 4620 transitions. Second operand 4 states. [2019-11-15 19:49:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:49:24,924 INFO L93 Difference]: Finished difference Result 6359 states and 10191 transitions. [2019-11-15 19:49:24,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:49:24,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2019-11-15 19:49:24,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:49:24,935 INFO L225 Difference]: With dead ends: 6359 [2019-11-15 19:49:24,936 INFO L226 Difference]: Without dead ends: 3543 [2019-11-15 19:49:24,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:49:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2019-11-15 19:49:25,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 2824. [2019-11-15 19:49:25,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-11-15 19:49:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 4580 transitions. [2019-11-15 19:49:25,039 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 4580 transitions. Word has length 222 [2019-11-15 19:49:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:49:25,040 INFO L462 AbstractCegarLoop]: Abstraction has 2824 states and 4580 transitions. [2019-11-15 19:49:25,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:49:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 4580 transitions. [2019-11-15 19:49:25,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-15 19:49:25,044 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:49:25,045 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:49:25,256 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:49:25,256 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:49:25,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:49:25,257 INFO L82 PathProgramCache]: Analyzing trace with hash 872087279, now seen corresponding path program 1 times [2019-11-15 19:49:25,257 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:49:25,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1996754346] [2019-11-15 19:49:25,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:49:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:49:28,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 19:49:28,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:49:28,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:28,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2019-11-15 19:49:28,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:28,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:28,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:28,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 19:49:28,383 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:28,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 19:49:28,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:28,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:28,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:28,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 19:49:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-11-15 19:49:28,494 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:49:28,513 INFO L375 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 20 treesize of output 18 [2019-11-15 19:49:28,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:28,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:28,516 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:28,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:28,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:28,516 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 19:49:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-11-15 19:49:28,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1996754346] [2019-11-15 19:49:28,547 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:49:28,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 19:49:28,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508601408] [2019-11-15 19:49:28,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:49:28,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 19:49:28,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:49:28,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:49:28,548 INFO L87 Difference]: Start difference. First operand 2824 states and 4580 transitions. Second operand 7 states. [2019-11-15 19:49:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:49:40,308 INFO L93 Difference]: Finished difference Result 7296 states and 11522 transitions. [2019-11-15 19:49:40,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:49:40,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2019-11-15 19:49:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:49:40,317 INFO L225 Difference]: With dead ends: 7296 [2019-11-15 19:49:40,317 INFO L226 Difference]: Without dead ends: 4480 [2019-11-15 19:49:40,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:49:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4480 states. [2019-11-15 19:49:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4480 to 3144. [2019-11-15 19:49:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2019-11-15 19:49:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 5090 transitions. [2019-11-15 19:49:40,431 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 5090 transitions. Word has length 228 [2019-11-15 19:49:40,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:49:40,432 INFO L462 AbstractCegarLoop]: Abstraction has 3144 states and 5090 transitions. [2019-11-15 19:49:40,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:49:40,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 5090 transitions. [2019-11-15 19:49:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-15 19:49:40,437 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:49:40,437 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:49:40,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:49:40,648 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:49:40,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:49:40,648 INFO L82 PathProgramCache]: Analyzing trace with hash -440204604, now seen corresponding path program 1 times [2019-11-15 19:49:40,649 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:49:40,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1065970621] [2019-11-15 19:49:40,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd29819e-4307-4a0b-863a-51f182e010b9/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:49:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:49:41,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-15 19:49:41,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:49:44,145 INFO L235 Elim1Store]: Index analysis took 215 ms [2019-11-15 19:49:44,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:44,150 INFO L375 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 27 treesize of output 31 [2019-11-15 19:49:44,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:46,460 WARN L191 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-15 19:49:46,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:46,463 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_218|, |v_#memory_$Pointer$.base_218|], 2=[|v_#memory_$Pointer$.offset_214|, |v_#memory_$Pointer$.offset_215|, |v_#memory_$Pointer$.base_215|, |v_#memory_$Pointer$.base_214|]} [2019-11-15 19:49:46,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:46,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:46,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:46,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:46,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:46,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:47,071 INFO L235 Elim1Store]: Index analysis took 502 ms [2019-11-15 19:49:47,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 19:49:47,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:49,223 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 19:49:49,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:49,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:49,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:49,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:49,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:49,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:49,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:49,644 INFO L235 Elim1Store]: Index analysis took 352 ms [2019-11-15 19:49:50,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 19:49:50,057 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:50,929 WARN L191 SmtUtils]: Spent 871.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 19:49:50,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:50,943 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:51,441 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-15 19:49:51,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:51,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-15 19:49:51,533 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:51,787 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-15 19:49:51,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:51,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:49:51,817 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:51,923 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-15 19:49:51,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:51,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:51,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-15 19:49:51,942 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:52,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,013 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:170, output treesize:65 [2019-11-15 19:49:52,040 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_219|], 12=[|v_#memory_$Pointer$.base_219|]} [2019-11-15 19:49:52,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,066 INFO L375 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 29 treesize of output 13 [2019-11-15 19:49:52,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:52,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:49:52,132 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:52,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,172 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 19:49:52,179 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_220|], 12=[|v_#memory_$Pointer$.base_220|]} [2019-11-15 19:49:52,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,191 INFO L375 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 29 treesize of output 13 [2019-11-15 19:49:52,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:52,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:49:52,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:52,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,268 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 19:49:52,273 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_216|, |v_#memory_$Pointer$.base_216|, |v_#memory_$Pointer$.offset_221|], 12=[|v_#memory_$Pointer$.base_221|]} [2019-11-15 19:49:52,283 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:52,512 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-15 19:49:52,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:52,518 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:52,627 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 19:49:52,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:52,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-11-15 19:49:52,659 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,771 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-15 19:49:52,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:52,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 19:49:52,801 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:52,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,840 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:141, output treesize:65 [2019-11-15 19:49:52,852 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_222|], 12=[|v_#memory_$Pointer$.base_222|]} [2019-11-15 19:49:52,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,865 INFO L375 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 29 treesize of output 13 [2019-11-15 19:49:52,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:52,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:49:52,923 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:52,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,947 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 19:49:52,950 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_223|], 12=[|v_#memory_$Pointer$.base_223|]} [2019-11-15 19:49:52,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:52,959 INFO L375 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 29 treesize of output 13 [2019-11-15 19:49:52,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:52,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:53,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:53,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:53,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:53,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:53,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:53,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:53,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 19:49:53,007 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:53,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:53,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:53,024 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:65 [2019-11-15 19:49:53,037 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_224|], 20=[|v_#memory_$Pointer$.base_224|]} [2019-11-15 19:49:53,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:53,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 95 [2019-11-15 19:49:53,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:53,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:53,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:53,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:53,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:53,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:53,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:53,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:53,371 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-11-15 19:49:53,371 INFO L341 Elim1Store]: treesize reduction 40, result has 81.2 percent of original size [2019-11-15 19:49:53,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 125 treesize of output 229 [2019-11-15 19:49:53,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:53,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:53,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:53,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:53,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:53,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:53,381 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:53,508 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-11-15 19:49:53,508 INFO L567 ElimStorePlain]: treesize reduction 180, result has 38.4 percent of original size [2019-11-15 19:49:53,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:53,509 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:127 [2019-11-15 19:49:53,557 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_217|, |v_#memory_$Pointer$.base_217|], 20=[|v_#memory_$Pointer$.offset_225|], 30=[|v_#memory_$Pointer$.base_225|]} [2019-11-15 19:49:53,571 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:53,877 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 19:49:53,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:53,887 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:54,119 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 19:49:54,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:54,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,178 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2019-11-15 19:49:54,179 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:54,348 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 19:49:54,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:54,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,630 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-15 19:49:54,630 INFO L341 Elim1Store]: treesize reduction 57, result has 75.0 percent of original size [2019-11-15 19:49:54,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 139 treesize of output 258 [2019-11-15 19:49:54,632 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:54,743 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-11-15 19:49:54,743 INFO L567 ElimStorePlain]: treesize reduction 225, result has 39.2 percent of original size [2019-11-15 19:49:54,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:54,743 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:203, output treesize:127 [2019-11-15 19:49:54,755 INFO L392 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.offset_226|], 30=[|v_#memory_$Pointer$.base_226|]} [2019-11-15 19:49:54,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2019-11-15 19:49:54,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:54,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:54,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:54,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,057 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-11-15 19:49:55,057 INFO L341 Elim1Store]: treesize reduction 40, result has 75.0 percent of original size [2019-11-15 19:49:55,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 134 treesize of output 198 [2019-11-15 19:49:55,059 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:55,146 INFO L567 ElimStorePlain]: treesize reduction 156, result has 44.9 percent of original size [2019-11-15 19:49:55,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:55,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:165, output treesize:127 [2019-11-15 19:49:55,150 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_243|], 20=[|v_#memory_$Pointer$.offset_227|], 30=[|v_#memory_$Pointer$.base_227|]} [2019-11-15 19:49:55,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 21 [2019-11-15 19:49:55,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:55,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:55,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,283 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:55,284 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 197 [2019-11-15 19:49:55,285 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:55,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:55,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:55,463 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 161 treesize of output 250 [2019-11-15 19:49:55,464 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:55,562 INFO L567 ElimStorePlain]: treesize reduction 220, result has 38.9 percent of original size [2019-11-15 19:49:55,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:55,563 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:256, output treesize:140 [2019-11-15 19:49:55,618 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_244|], 20=[|v_#memory_$Pointer$.offset_228|], 30=[|v_#memory_$Pointer$.base_228|]} [2019-11-15 19:49:55,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-11-15 19:49:55,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:55,734 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-15 19:49:55,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:55,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,755 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 81 [2019-11-15 19:49:55,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:55,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:55,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:55,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:56,066 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-11-15 19:49:56,066 INFO L341 Elim1Store]: treesize reduction 40, result has 75.0 percent of original size [2019-11-15 19:49:56,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 147 treesize of output 205 [2019-11-15 19:49:56,068 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:56,192 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-11-15 19:49:56,193 INFO L567 ElimStorePlain]: treesize reduction 156, result has 48.9 percent of original size [2019-11-15 19:49:56,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:56,193 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:191, output treesize:149 [2019-11-15 19:49:56,269 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_229|, |v_#memory_int_245|], 20=[|v_#memory_$Pointer$.base_229|]} [2019-11-15 19:49:56,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:56,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 62 [2019-11-15 19:49:56,277 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:56,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:56,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:56,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2019-11-15 19:49:56,329 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:56,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:56,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:56,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:56,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:56,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:56,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:56,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:56,431 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:56,431 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 97 treesize of output 101 [2019-11-15 19:49:56,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:56,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:56,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:56,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:56,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:56,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:56,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:56,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:56,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:56,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:56,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:56,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:56,442 INFO L496 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:56,491 INFO L567 ElimStorePlain]: treesize reduction 48, result has 51.5 percent of original size [2019-11-15 19:49:56,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:56,491 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:180, output treesize:39 [2019-11-15 19:49:56,557 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2019-11-15 19:49:56,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:56,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:56,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:56,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:3 [2019-11-15 19:49:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 308 proven. 127 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 19:49:57,108 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 19:49:57,181 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:57,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:57,217 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:57,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:57,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:57,226 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:44 [2019-11-15 19:49:57,263 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.base_234|, |v_#memory_$Pointer$.offset_234|], 2=[|#memory_int|]} [2019-11-15 19:49:57,269 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:57,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:57,344 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:57,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:57,372 INFO L375 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 281 treesize of output 197 [2019-11-15 19:49:57,372 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:57,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:57,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:57,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:57,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:57,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:57,418 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:201, output treesize:191 [2019-11-15 19:49:57,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:57,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:57,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:57,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:57,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:57,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:57,500 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:57,510 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:57,535 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:57,555 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:57,857 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 53 [2019-11-15 19:49:57,858 INFO L567 ElimStorePlain]: treesize reduction 381, result has 38.4 percent of original size [2019-11-15 19:49:57,864 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:57,873 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:57,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:57,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-11-15 19:49:57,954 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:529, output treesize:257 [2019-11-15 19:49:58,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:58,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:59,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:01,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:01,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:01,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:01,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:01,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:01,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:01,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:01,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:01,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:01,134 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_217|, |v_#memory_$Pointer$.base_217|], 6=[|v_#memory_$Pointer$.offset_236|, |v_#memory_$Pointer$.base_236|]} [2019-11-15 19:50:01,160 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:01,196 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:01,247 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:01,267 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:03,399 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2019-11-15 19:50:03,399 INFO L567 ElimStorePlain]: treesize reduction 42, result has 93.3 percent of original size [2019-11-15 19:50:03,414 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:03,438 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:03,456 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:03,482 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:04,635 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 97 [2019-11-15 19:50:04,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:04,645 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:04,657 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:04,678 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:04,699 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:05,244 WARN L191 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2019-11-15 19:50:05,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:05,254 INFO L496 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:05,280 INFO L496 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:05,295 INFO L496 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:05,314 INFO L496 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:05,500 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 60 [2019-11-15 19:50:05,500 INFO L567 ElimStorePlain]: treesize reduction 444, result has 43.5 percent of original size [2019-11-15 19:50:05,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-11-15 19:50:05,501 INFO L221 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:689, output treesize:342 [2019-11-15 19:50:05,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:05,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:05,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:05,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:05,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:05,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:50:05,977 INFO L392 ElimStorePlain]: Different costs {21=[|v_#memory_$Pointer$.offset_238|], 41=[|v_#memory_$Pointer$.base_238|]} [2019-11-15 19:50:05,981 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:06,159 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-11-15 19:50:06,159 INFO L567 ElimStorePlain]: treesize reduction 352, result has 55.3 percent of original size [2019-11-15 19:50:06,161 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:06,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:06,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:06,205 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:637, output treesize:654 [2019-11-15 19:50:08,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:50:08,656 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) 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.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.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.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 19:50:08,661 INFO L168 Benchmark]: Toolchain (without parser) took 116931.38 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 464.0 MB). Free memory was 945.6 MB in the beginning and 980.8 MB in the end (delta: -35.2 MB). Peak memory consumption was 428.8 MB. Max. memory is 11.5 GB. [2019-11-15 19:50:08,661 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:50:08,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-15 19:50:08,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 19:50:08,662 INFO L168 Benchmark]: Boogie Preprocessor took 91.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 19:50:08,662 INFO L168 Benchmark]: RCFGBuilder took 2764.02 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: 96.4 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:50:08,663 INFO L168 Benchmark]: TraceAbstraction took 113179.32 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.6 MB). Free memory was 1.0 GB in the beginning and 980.8 MB in the end (delta: 27.4 MB). Peak memory consumption was 342.0 MB. Max. memory is 11.5 GB. [2019-11-15 19:50:08,664 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 799.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2764.02 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: 96.4 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 113179.32 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.6 MB). Free memory was 1.0 GB in the beginning and 980.8 MB in the end (delta: 27.4 MB). Peak memory consumption was 342.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...