./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i --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/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 082b1bde50b1883aaa9112842176e8bb0db36577 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 082b1bde50b1883aaa9112842176e8bb0db36577 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:15,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:15,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:15,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:15,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:15,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:15,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:15,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:15,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:15,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:15,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:15,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:15,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:15,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:15,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:15,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:15,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:15,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:15,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:15,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:15,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:15,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:15,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:15,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:15,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:15,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:15,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:15,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:15,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:15,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:15,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:15,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:15,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:15,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:15,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:15,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:15,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:15,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:15,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:15,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:15,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:15,653 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:15,665 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:15,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:15,669 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:15,669 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:15,669 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:15,670 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:15,670 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:15,670 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:15,670 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:15,670 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:15,670 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:15,671 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:15,671 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:15,671 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:15,672 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:15,672 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:15,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:15,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:15,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:15,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:15,673 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:15,673 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:15,673 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:15,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:15,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:15,674 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:15,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:15,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:15,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:15,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:15,676 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:15,676 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:15,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:15,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:15,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:15,677 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan 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 -> Taipan 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 -> 082b1bde50b1883aaa9112842176e8bb0db36577 [2019-10-22 11:23:15,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:15,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:15,717 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:15,718 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:15,718 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:15,719 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2019-10-22 11:23:15,776 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/data/9232a7327/ceb16305c18d4d359f844fb56d5129ac/FLAGfb2d48f66 [2019-10-22 11:23:16,219 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:16,220 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2019-10-22 11:23:16,234 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/data/9232a7327/ceb16305c18d4d359f844fb56d5129ac/FLAGfb2d48f66 [2019-10-22 11:23:16,737 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/data/9232a7327/ceb16305c18d4d359f844fb56d5129ac [2019-10-22 11:23:16,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:16,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:16,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:16,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:16,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:16,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:16" (1/1) ... [2019-10-22 11:23:16,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dedff11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:16, skipping insertion in model container [2019-10-22 11:23:16,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:16" (1/1) ... [2019-10-22 11:23:16,754 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:16,784 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:17,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:17,163 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:17,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:17,252 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:17,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:17 WrapperNode [2019-10-22 11:23:17,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:17,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:17,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:17,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:17,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:17" (1/1) ... [2019-10-22 11:23:17,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:17" (1/1) ... [2019-10-22 11:23:17,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:17,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:17,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:17,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:17,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:17" (1/1) ... [2019-10-22 11:23:17,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:17" (1/1) ... [2019-10-22 11:23:17,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:17" (1/1) ... [2019-10-22 11:23:17,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:17" (1/1) ... [2019-10-22 11:23:17,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:17" (1/1) ... [2019-10-22 11:23:17,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:17" (1/1) ... [2019-10-22 11:23:17,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:17" (1/1) ... [2019-10-22 11:23:17,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:17,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:17,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:17,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:17,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/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-10-22 11:23:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:23:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:23:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:23:17,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:23:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:23:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:23:17,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:17,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:17,740 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:17,740 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-10-22 11:23:17,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:17 BoogieIcfgContainer [2019-10-22 11:23:17,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:17,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:17,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:17,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:17,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:16" (1/3) ... [2019-10-22 11:23:17,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa0e9a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:17, skipping insertion in model container [2019-10-22 11:23:17,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:17" (2/3) ... [2019-10-22 11:23:17,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa0e9a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:17, skipping insertion in model container [2019-10-22 11:23:17,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:17" (3/3) ... [2019-10-22 11:23:17,754 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2019-10-22 11:23:17,766 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:17,776 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:23:17,789 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:23:17,816 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:17,823 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:17,823 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:17,823 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:17,824 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:17,824 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:17,824 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:17,824 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-10-22 11:23:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:23:17,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:17,847 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:17,849 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:17,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1935900066, now seen corresponding path program 1 times [2019-10-22 11:23:17,868 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:17,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350840422] [2019-10-22 11:23:17,868 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:17,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:17,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:17,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350840422] [2019-10-22 11:23:17,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:17,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:17,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791826195] [2019-10-22 11:23:17,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:23:17,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:17,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:23:17,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:17,999 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-10-22 11:23:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:18,011 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2019-10-22 11:23:18,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:23:18,012 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-22 11:23:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:18,021 INFO L225 Difference]: With dead ends: 41 [2019-10-22 11:23:18,022 INFO L226 Difference]: Without dead ends: 21 [2019-10-22 11:23:18,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:18,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-22 11:23:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-22 11:23:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 11:23:18,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-10-22 11:23:18,055 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2019-10-22 11:23:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:18,056 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-10-22 11:23:18,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:23:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-10-22 11:23:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:23:18,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:18,057 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:18,057 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1899961651, now seen corresponding path program 1 times [2019-10-22 11:23:18,058 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:18,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6536416] [2019-10-22 11:23:18,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:18,058 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:18,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:18,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6536416] [2019-10-22 11:23:18,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:18,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:18,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685768841] [2019-10-22 11:23:18,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:18,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:18,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:18,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:18,117 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2019-10-22 11:23:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:18,132 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-10-22 11:23:18,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:18,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 11:23:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:18,133 INFO L225 Difference]: With dead ends: 37 [2019-10-22 11:23:18,133 INFO L226 Difference]: Without dead ends: 25 [2019-10-22 11:23:18,134 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-10-22 11:23:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-22 11:23:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-10-22 11:23:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 11:23:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-22 11:23:18,141 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2019-10-22 11:23:18,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:18,141 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-22 11:23:18,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-22 11:23:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:23:18,142 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:18,142 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:18,142 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:18,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1177950341, now seen corresponding path program 1 times [2019-10-22 11:23:18,143 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:18,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506993051] [2019-10-22 11:23:18,143 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:18,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:18,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:18,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506993051] [2019-10-22 11:23:18,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225647252] [2019-10-22 11:23:18,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/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-10-22 11:23:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:18,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:23:18,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:23:18,434 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:23:18,463 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:23:18,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 8 [2019-10-22 11:23:18,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443245925] [2019-10-22 11:23:18,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:18,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:18,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:18,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:23:18,464 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-10-22 11:23:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:18,500 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-10-22 11:23:18,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:18,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 11:23:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:18,501 INFO L225 Difference]: With dead ends: 33 [2019-10-22 11:23:18,502 INFO L226 Difference]: Without dead ends: 29 [2019-10-22 11:23:18,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:18,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-22 11:23:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-22 11:23:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 11:23:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-22 11:23:18,507 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 16 [2019-10-22 11:23:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:18,507 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-22 11:23:18,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-22 11:23:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:23:18,508 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:18,508 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:18,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:23:18,709 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:18,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:18,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1694844933, now seen corresponding path program 1 times [2019-10-22 11:23:18,709 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:18,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562632210] [2019-10-22 11:23:18,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:18,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:18,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:18,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562632210] [2019-10-22 11:23:18,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:18,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:18,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474442670] [2019-10-22 11:23:18,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:18,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:18,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:18,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:18,807 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 5 states. [2019-10-22 11:23:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:18,905 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-10-22 11:23:18,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:18,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-10-22 11:23:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:18,907 INFO L225 Difference]: With dead ends: 41 [2019-10-22 11:23:18,907 INFO L226 Difference]: Without dead ends: 37 [2019-10-22 11:23:18,907 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10-22 11:23:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-22 11:23:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2019-10-22 11:23:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 11:23:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-22 11:23:18,912 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 22 [2019-10-22 11:23:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:18,913 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-22 11:23:18,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-22 11:23:18,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:23:18,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:18,917 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] [2019-10-22 11:23:18,917 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:18,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:18,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1572647421, now seen corresponding path program 1 times [2019-10-22 11:23:18,918 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:18,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943738776] [2019-10-22 11:23:18,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:18,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:18,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:19,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943738776] [2019-10-22 11:23:19,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:19,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:19,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848759838] [2019-10-22 11:23:19,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:19,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:19,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:19,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:19,251 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 5 states. [2019-10-22 11:23:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:19,373 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2019-10-22 11:23:19,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:19,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-22 11:23:19,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:19,375 INFO L225 Difference]: With dead ends: 46 [2019-10-22 11:23:19,375 INFO L226 Difference]: Without dead ends: 33 [2019-10-22 11:23:19,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:19,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-22 11:23:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-22 11:23:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 11:23:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-10-22 11:23:19,383 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 25 [2019-10-22 11:23:19,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:19,383 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-10-22 11:23:19,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-10-22 11:23:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:23:19,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:19,385 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] [2019-10-22 11:23:19,385 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:19,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:19,385 INFO L82 PathProgramCache]: Analyzing trace with hash 480509000, now seen corresponding path program 1 times [2019-10-22 11:23:19,385 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:19,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984759852] [2019-10-22 11:23:19,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:19,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:19,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:19,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 11:23:19,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984759852] [2019-10-22 11:23:19,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340033839] [2019-10-22 11:23:19,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/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-10-22 11:23:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:19,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-22 11:23:19,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:19,734 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-22 11:23:19,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-22 11:23:19,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:19,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:19,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:19,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:14 [2019-10-22 11:23:19,837 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:19,837 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 16 treesize of output 34 [2019-10-22 11:23:19,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:19,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:19,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:19,847 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-10-22 11:23:19,921 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 11 treesize of output 7 [2019-10-22 11:23:19,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:19,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:19,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:19,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-22 11:23:19,999 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:19,999 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 1 case distinctions, treesize of input 28 treesize of output 46 [2019-10-22 11:23:20,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-22 11:23:20,045 INFO L567 ElimStorePlain]: treesize reduction 25, result has 52.8 percent of original size [2019-10-22 11:23:20,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:20,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-10-22 11:23:20,172 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-10-22 11:23:20,177 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 59 treesize of output 47 [2019-10-22 11:23:20,179 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:20,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:20,231 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:20,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 60 [2019-10-22 11:23:20,232 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:20,250 INFO L567 ElimStorePlain]: treesize reduction 24, result has 27.3 percent of original size [2019-10-22 11:23:20,251 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:20,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:4 [2019-10-22 11:23:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 11:23:20,281 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:20,293 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 29 treesize of output 21 [2019-10-22 11:23:20,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:20,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:20,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:20,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-10-22 11:23:20,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:20,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 757 treesize of output 679 [2019-10-22 11:23:20,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:20,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:20,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:23:21,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,169 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:21,461 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 51 [2019-10-22 11:23:21,462 INFO L567 ElimStorePlain]: treesize reduction 598, result has 11.4 percent of original size [2019-10-22 11:23:21,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2019-10-22 11:23:21,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:121, output treesize:234 [2019-10-22 11:23:21,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 11:23:21,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1763994521] [2019-10-22 11:23:21,631 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 28 [2019-10-22 11:23:21,684 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:23:21,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:23:21,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:23:21,984 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info IMPLEMENTATION at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleHavocStatement(NonrelationalStatementProcessor.java:325) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.restoreOriginalStateVariables(PoormanCachedPostOperation.java:322) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.(CegarAbsIntRunner.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.getOrConstructRunner(IpTcStrategyModuleAbstractInterpretation.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.construct(IpTcStrategyModuleAbstractInterpretation.java:81) 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-10-22 11:23:21,988 INFO L168 Benchmark]: Toolchain (without parser) took 5246.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 939.2 MB in the beginning and 804.1 MB in the end (delta: 135.0 MB). Peak memory consumption was 349.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:21,988 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:21,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:21,989 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:21,989 INFO L168 Benchmark]: Boogie Preprocessor took 29.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:21,989 INFO L168 Benchmark]: RCFGBuilder took 418.02 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: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:21,990 INFO L168 Benchmark]: TraceAbstraction took 4242.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 804.1 MB in the end (delta: 272.8 MB). Peak memory consumption was 356.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:21,992 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 511.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 418.02 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: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4242.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 804.1 MB in the end (delta: 272.8 MB). Peak memory consumption was 356.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) 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-10-22 11:23:24,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:24,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:24,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:24,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:24,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:24,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:24,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:24,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:24,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:24,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:24,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:24,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:24,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:24,127 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:24,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:24,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:24,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:24,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:24,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:24,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:24,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:24,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:24,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:24,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:24,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:24,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:24,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:24,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:24,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:24,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:24,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:24,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:24,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:24,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:24,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:24,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:24,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:24,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:24,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:24,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:24,150 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:23:24,175 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:24,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:24,175 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:24,176 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:24,176 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:24,176 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:24,176 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:24,176 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:24,176 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:24,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:24,177 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:24,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:24,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:24,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:24,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:24,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:24,180 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:23:24,180 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:23:24,180 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:24,180 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:24,180 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:23:24,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:24,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:24,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:24,181 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:24,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:24,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:24,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:24,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:24,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:24,182 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:23:24,182 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:23:24,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:24,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:24,182 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/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan 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 -> Taipan 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 -> 082b1bde50b1883aaa9112842176e8bb0db36577 [2019-10-22 11:23:24,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:24,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:24,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:24,222 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:24,222 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:24,223 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/../../sv-benchmarks/c/list-simple/sll2c_remove_all.i [2019-10-22 11:23:24,268 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/data/a51c518cf/6730cfb486ac4464a9626144022f6168/FLAGe8c20a233 [2019-10-22 11:23:24,726 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:24,728 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/sv-benchmarks/c/list-simple/sll2c_remove_all.i [2019-10-22 11:23:24,740 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/data/a51c518cf/6730cfb486ac4464a9626144022f6168/FLAGe8c20a233 [2019-10-22 11:23:25,249 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/data/a51c518cf/6730cfb486ac4464a9626144022f6168 [2019-10-22 11:23:25,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:25,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:25,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:25,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:25,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:25,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:25" (1/1) ... [2019-10-22 11:23:25,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d881ff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25, skipping insertion in model container [2019-10-22 11:23:25,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:25" (1/1) ... [2019-10-22 11:23:25,268 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:25,307 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:25,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:25,690 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:25,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:25,786 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:25,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25 WrapperNode [2019-10-22 11:23:25,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:25,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:25,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:25,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:25,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25" (1/1) ... [2019-10-22 11:23:25,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25" (1/1) ... [2019-10-22 11:23:25,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:25,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:25,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:25,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:25,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25" (1/1) ... [2019-10-22 11:23:25,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25" (1/1) ... [2019-10-22 11:23:25,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25" (1/1) ... [2019-10-22 11:23:25,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25" (1/1) ... [2019-10-22 11:23:25,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25" (1/1) ... [2019-10-22 11:23:25,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25" (1/1) ... [2019-10-22 11:23:25,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25" (1/1) ... [2019-10-22 11:23:25,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:25,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:25,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:25,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:25,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/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-10-22 11:23:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:23:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:23:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:23:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:23:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:23:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:23:25,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:25,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:26,266 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:26,266 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-10-22 11:23:26,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:26 BoogieIcfgContainer [2019-10-22 11:23:26,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:26,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:26,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:26,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:26,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:25" (1/3) ... [2019-10-22 11:23:26,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20dd0c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:26, skipping insertion in model container [2019-10-22 11:23:26,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:25" (2/3) ... [2019-10-22 11:23:26,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20dd0c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:26, skipping insertion in model container [2019-10-22 11:23:26,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:26" (3/3) ... [2019-10-22 11:23:26,273 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all.i [2019-10-22 11:23:26,284 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:26,292 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:23:26,299 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:23:26,314 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:26,314 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:26,315 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:26,315 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:26,315 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:26,315 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:26,315 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:26,315 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-10-22 11:23:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:23:26,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:26,330 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:26,331 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:26,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:26,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1935900066, now seen corresponding path program 1 times [2019-10-22 11:23:26,342 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:26,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1950937327] [2019-10-22 11:23:26,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/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-10-22 11:23:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:26,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 11:23:26,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:26,474 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:26,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1950937327] [2019-10-22 11:23:26,480 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:26,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:23:26,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151629484] [2019-10-22 11:23:26,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:23:26,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:26,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:23:26,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:26,498 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2019-10-22 11:23:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:26,511 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2019-10-22 11:23:26,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:23:26,512 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-22 11:23:26,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:26,521 INFO L225 Difference]: With dead ends: 41 [2019-10-22 11:23:26,521 INFO L226 Difference]: Without dead ends: 21 [2019-10-22 11:23:26,524 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:26,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-22 11:23:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-22 11:23:26,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 11:23:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-10-22 11:23:26,551 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2019-10-22 11:23:26,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:26,551 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-10-22 11:23:26,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:23:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-10-22 11:23:26,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:23:26,552 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:26,552 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:26,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:26,753 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:26,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1899961651, now seen corresponding path program 1 times [2019-10-22 11:23:26,754 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:26,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2139235675] [2019-10-22 11:23:26,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/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-10-22 11:23:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:26,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 11:23:26,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:26,876 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:26,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2139235675] [2019-10-22 11:23:26,890 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:26,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:23:26,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713628854] [2019-10-22 11:23:26,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:26,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:26,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:26,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:26,893 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 4 states. [2019-10-22 11:23:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:26,926 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-10-22 11:23:26,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:26,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 11:23:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:26,928 INFO L225 Difference]: With dead ends: 37 [2019-10-22 11:23:26,928 INFO L226 Difference]: Without dead ends: 25 [2019-10-22 11:23:26,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-10-22 11:23:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-22 11:23:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-10-22 11:23:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 11:23:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-22 11:23:26,933 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2019-10-22 11:23:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:26,934 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-22 11:23:26,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-22 11:23:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:23:26,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:26,935 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:27,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:27,136 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:27,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1177950341, now seen corresponding path program 1 times [2019-10-22 11:23:27,137 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:27,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1778362711] [2019-10-22 11:23:27,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/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-10-22 11:23:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:27,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:23:27,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:23:27,285 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:23:27,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1778362711] [2019-10-22 11:23:27,304 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:27,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 11:23:27,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612313018] [2019-10-22 11:23:27,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:27,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:27,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:27,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:27,306 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-10-22 11:23:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:27,377 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2019-10-22 11:23:27,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:27,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 11:23:27,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:27,380 INFO L225 Difference]: With dead ends: 33 [2019-10-22 11:23:27,380 INFO L226 Difference]: Without dead ends: 29 [2019-10-22 11:23:27,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-22 11:23:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-22 11:23:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 11:23:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-22 11:23:27,387 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 16 [2019-10-22 11:23:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:27,387 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-22 11:23:27,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-22 11:23:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:23:27,388 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:27,388 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:27,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:27,589 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:27,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1694844933, now seen corresponding path program 1 times [2019-10-22 11:23:27,590 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:27,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [713218959] [2019-10-22 11:23:27,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/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-10-22 11:23:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:27,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 11:23:27,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:27,878 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 11 treesize of output 7 [2019-10-22 11:23:27,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:27,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:27,903 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 11 treesize of output 7 [2019-10-22 11:23:27,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:27,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:27,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:27,915 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-10-22 11:23:27,947 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 15 treesize of output 7 [2019-10-22 11:23:27,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:27,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:27,968 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 15 treesize of output 7 [2019-10-22 11:23:27,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:27,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:27,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:27,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-22 11:23:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:27,996 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:28,031 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 21 [2019-10-22 11:23:28,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-22 11:23:28,045 INFO L567 ElimStorePlain]: treesize reduction 15, result has 31.8 percent of original size [2019-10-22 11:23:28,046 INFO L464 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-10-22 11:23:28,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 11:23:28,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:7 [2019-10-22 11:23:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:28,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [713218959] [2019-10-22 11:23:28,067 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:28,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 8 [2019-10-22 11:23:28,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742582415] [2019-10-22 11:23:28,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:23:28,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:28,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:23:28,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:23:28,068 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 8 states. [2019-10-22 11:23:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:28,379 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-10-22 11:23:28,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:23:28,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-10-22 11:23:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:28,380 INFO L225 Difference]: With dead ends: 41 [2019-10-22 11:23:28,381 INFO L226 Difference]: Without dead ends: 37 [2019-10-22 11:23:28,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:23:28,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-22 11:23:28,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2019-10-22 11:23:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 11:23:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-22 11:23:28,389 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 22 [2019-10-22 11:23:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:28,389 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-22 11:23:28,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:23:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-22 11:23:28,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:23:28,391 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:28,391 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] [2019-10-22 11:23:28,591 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:28,592 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:28,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:28,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1572647421, now seen corresponding path program 1 times [2019-10-22 11:23:28,593 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:28,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1394938396] [2019-10-22 11:23:28,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a07689e-9a7a-49b6-a23d-9d0ddcfbf523/bin/utaipan/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-10-22 11:23:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:28,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 11:23:28,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:28,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:28,865 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:28,865 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 60 [2019-10-22 11:23:28,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:28,886 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:28,886 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 48 [2019-10-22 11:23:28,888 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:28,996 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-10-22 11:23:28,997 INFO L567 ElimStorePlain]: treesize reduction 20, result has 78.0 percent of original size [2019-10-22 11:23:29,020 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:29,020 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2019-10-22 11:23:29,022 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:29,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:29,223 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) 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.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.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-10-22 11:23:29,227 INFO L168 Benchmark]: Toolchain (without parser) took 3974.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 945.6 MB in the beginning and 922.8 MB in the end (delta: 22.8 MB). Peak memory consumption was 172.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:29,227 INFO L168 Benchmark]: CDTParser took 0.17 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-10-22 11:23:29,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:29,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.99 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-10-22 11:23:29,229 INFO L168 Benchmark]: Boogie Preprocessor took 28.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:29,229 INFO L168 Benchmark]: RCFGBuilder took 401.04 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: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:29,231 INFO L168 Benchmark]: TraceAbstraction took 2957.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 922.8 MB in the end (delta: 172.5 MB). Peak memory consumption was 172.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:29,233 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.17 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 534.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -186.5 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.99 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 28.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 401.04 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: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2957.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 922.8 MB in the end (delta: 172.5 MB). Peak memory consumption was 172.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...