/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:57:41,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:57:41,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:57:41,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:57:41,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:57:41,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:57:41,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:57:41,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:57:41,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:57:41,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:57:41,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:57:41,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:57:41,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:57:41,354 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:57:41,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:57:41,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:57:41,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:57:41,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:57:41,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:57:41,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:57:41,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:57:41,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:57:41,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:57:41,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:57:41,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:57:41,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:57:41,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:57:41,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:57:41,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:57:41,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:57:41,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:57:41,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:57:41,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:57:41,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:57:41,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:57:41,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:57:41,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:57:41,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:57:41,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:57:41,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:57:41,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:57:41,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 21:57:41,393 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:57:41,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:57:41,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:57:41,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:57:41,395 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:57:41,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:57:41,396 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:57:41,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:57:41,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:57:41,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:57:41,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:57:41,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:57:41,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:57:41,397 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:57:41,397 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:57:41,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:57:41,398 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:57:41,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:57:41,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:57:41,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:57:41,399 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:57:41,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:57:41,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:57:41,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:57:41,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:57:41,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:57:41,400 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:57:41,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:57:41,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:57:41,400 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:57:41,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:57:41,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:57:41,685 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:57:41,687 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:57:41,687 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:57:41,688 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2019-11-23 21:57:41,761 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065b10dbf/7fb10901b46147ed8a1ee913f70baabb/FLAG73f910107 [2019-11-23 21:57:42,312 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:57:42,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_search_value-1.i [2019-11-23 21:57:42,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065b10dbf/7fb10901b46147ed8a1ee913f70baabb/FLAG73f910107 [2019-11-23 21:57:42,609 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/065b10dbf/7fb10901b46147ed8a1ee913f70baabb [2019-11-23 21:57:42,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:57:42,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:57:42,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:57:42,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:57:42,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:57:42,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:57:42" (1/1) ... [2019-11-23 21:57:42,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@684834ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:42, skipping insertion in model container [2019-11-23 21:57:42,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:57:42" (1/1) ... [2019-11-23 21:57:42,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:57:42,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:57:43,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:57:43,197 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:57:43,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:57:43,298 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:57:43,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43 WrapperNode [2019-11-23 21:57:43,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:57:43,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:57:43,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:57:43,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:57:43,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:57:43,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:57:43,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:57:43,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:57:43,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... [2019-11-23 21:57:43,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:57:43,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:57:43,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:57:43,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:57:43,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:57:43,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 21:57:43,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 21:57:43,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-23 21:57:43,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 21:57:43,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 21:57:43,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:57:43,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:57:43,831 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:57:43,831 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-23 21:57:43,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:57:43 BoogieIcfgContainer [2019-11-23 21:57:43,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:57:43,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:57:43,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:57:43,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:57:43,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:57:42" (1/3) ... [2019-11-23 21:57:43,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b4f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:57:43, skipping insertion in model container [2019-11-23 21:57:43,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:57:43" (2/3) ... [2019-11-23 21:57:43,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b4f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:57:43, skipping insertion in model container [2019-11-23 21:57:43,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:57:43" (3/3) ... [2019-11-23 21:57:43,840 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_search_value-1.i [2019-11-23 21:57:43,849 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:57:43,857 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:57:43,868 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:57:43,887 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:57:43,887 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:57:43,888 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:57:43,888 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:57:43,888 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:57:43,888 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:57:43,888 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:57:43,889 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:57:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-23 21:57:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-23 21:57:43,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:43,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:43,907 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:43,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:43,911 INFO L82 PathProgramCache]: Analyzing trace with hash 2119917736, now seen corresponding path program 1 times [2019-11-23 21:57:43,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:43,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606281936] [2019-11-23 21:57:43,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:44,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606281936] [2019-11-23 21:57:44,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:44,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 21:57:44,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803535520] [2019-11-23 21:57:44,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-23 21:57:44,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:44,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-23 21:57:44,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-23 21:57:44,047 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-11-23 21:57:44,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:44,062 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-23 21:57:44,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-23 21:57:44,063 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-23 21:57:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:44,073 INFO L225 Difference]: With dead ends: 37 [2019-11-23 21:57:44,073 INFO L226 Difference]: Without dead ends: 18 [2019-11-23 21:57:44,076 INFO L630 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-11-23 21:57:44,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-23 21:57:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-23 21:57:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-23 21:57:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-11-23 21:57:44,111 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 9 [2019-11-23 21:57:44,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,111 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-11-23 21:57:44,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-23 21:57:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-11-23 21:57:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 21:57:44,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,112 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:44,113 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,113 INFO L82 PathProgramCache]: Analyzing trace with hash -624123943, now seen corresponding path program 1 times [2019-11-23 21:57:44,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481547886] [2019-11-23 21:57:44,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:44,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481547886] [2019-11-23 21:57:44,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:44,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:57:44,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382813548] [2019-11-23 21:57:44,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:57:44,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:57:44,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:57:44,169 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 3 states. [2019-11-23 21:57:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:44,214 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-11-23 21:57:44,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:57:44,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-23 21:57:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:44,215 INFO L225 Difference]: With dead ends: 28 [2019-11-23 21:57:44,216 INFO L226 Difference]: Without dead ends: 19 [2019-11-23 21:57:44,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:57:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-23 21:57:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-23 21:57:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-23 21:57:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-11-23 21:57:44,226 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2019-11-23 21:57:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,226 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-23 21:57:44,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:57:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-11-23 21:57:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 21:57:44,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:44,228 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash -566865641, now seen corresponding path program 1 times [2019-11-23 21:57:44,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816790418] [2019-11-23 21:57:44,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:44,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816790418] [2019-11-23 21:57:44,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:44,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:57:44,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217147974] [2019-11-23 21:57:44,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:57:44,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:44,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:57:44,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:57:44,294 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2019-11-23 21:57:44,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:44,354 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-11-23 21:57:44,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:57:44,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-23 21:57:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:44,356 INFO L225 Difference]: With dead ends: 39 [2019-11-23 21:57:44,356 INFO L226 Difference]: Without dead ends: 24 [2019-11-23 21:57:44,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:57:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-23 21:57:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-11-23 21:57:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-23 21:57:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-23 21:57:44,361 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2019-11-23 21:57:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,361 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-23 21:57:44,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:57:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-23 21:57:44,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 21:57:44,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,362 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:44,363 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1327995320, now seen corresponding path program 1 times [2019-11-23 21:57:44,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689265580] [2019-11-23 21:57:44,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:57:44,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689265580] [2019-11-23 21:57:44,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:44,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:57:44,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197594365] [2019-11-23 21:57:44,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:57:44,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:44,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:57:44,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:57:44,449 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2019-11-23 21:57:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:44,500 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-11-23 21:57:44,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:57:44,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-23 21:57:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:44,502 INFO L225 Difference]: With dead ends: 32 [2019-11-23 21:57:44,502 INFO L226 Difference]: Without dead ends: 29 [2019-11-23 21:57:44,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:57:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-23 21:57:44,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-11-23 21:57:44,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-23 21:57:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-11-23 21:57:44,508 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2019-11-23 21:57:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,509 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-11-23 21:57:44,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:57:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-11-23 21:57:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 21:57:44,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,510 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:44,511 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,511 INFO L82 PathProgramCache]: Analyzing trace with hash -713840769, now seen corresponding path program 1 times [2019-11-23 21:57:44,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073337346] [2019-11-23 21:57:44,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 21:57:44,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073337346] [2019-11-23 21:57:44,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:57:44,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:57:44,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584703963] [2019-11-23 21:57:44,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:57:44,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:44,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:57:44,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:57:44,598 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-11-23 21:57:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:44,671 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-11-23 21:57:44,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:57:44,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-23 21:57:44,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:44,673 INFO L225 Difference]: With dead ends: 33 [2019-11-23 21:57:44,673 INFO L226 Difference]: Without dead ends: 25 [2019-11-23 21:57:44,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:57:44,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-23 21:57:44,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-23 21:57:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-23 21:57:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-11-23 21:57:44,678 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 21 [2019-11-23 21:57:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,679 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-11-23 21:57:44,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:57:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-11-23 21:57:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 21:57:44,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,680 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:44,681 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:44,695 INFO L82 PathProgramCache]: Analyzing trace with hash -711993727, now seen corresponding path program 1 times [2019-11-23 21:57:44,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:44,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366579567] [2019-11-23 21:57:44,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:44,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366579567] [2019-11-23 21:57:44,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998441117] [2019-11-23 21:57:44,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:44,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 21:57:44,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:44,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:44,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:44,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-23 21:57:44,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017963125] [2019-11-23 21:57:44,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:57:44,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:44,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:57:44,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:57:44,881 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 6 states. [2019-11-23 21:57:44,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:44,963 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2019-11-23 21:57:44,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:57:44,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-23 21:57:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:44,965 INFO L225 Difference]: With dead ends: 50 [2019-11-23 21:57:44,965 INFO L226 Difference]: Without dead ends: 32 [2019-11-23 21:57:44,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:57:44,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-23 21:57:44,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-11-23 21:57:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-23 21:57:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-23 21:57:44,975 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 21 [2019-11-23 21:57:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:44,975 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-23 21:57:44,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:57:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-11-23 21:57:44,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 21:57:44,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:44,978 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:45,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:45,180 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2011045262, now seen corresponding path program 2 times [2019-11-23 21:57:45,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:45,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352376600] [2019-11-23 21:57:45,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:45,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352376600] [2019-11-23 21:57:45,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103212820] [2019-11-23 21:57:45,266 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:45,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:57:45,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:45,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-23 21:57:45,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:45,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:45,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:45,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-23 21:57:45,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356770633] [2019-11-23 21:57:45,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:57:45,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:45,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:57:45,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:57:45,366 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 7 states. [2019-11-23 21:57:45,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:45,446 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-11-23 21:57:45,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 21:57:45,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-23 21:57:45,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:45,448 INFO L225 Difference]: With dead ends: 55 [2019-11-23 21:57:45,448 INFO L226 Difference]: Without dead ends: 37 [2019-11-23 21:57:45,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:57:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-23 21:57:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-11-23 21:57:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-23 21:57:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-23 21:57:45,454 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 26 [2019-11-23 21:57:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:45,455 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-23 21:57:45,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:57:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-23 21:57:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 21:57:45,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:45,456 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:45,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:45,660 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:45,661 INFO L82 PathProgramCache]: Analyzing trace with hash 22979873, now seen corresponding path program 3 times [2019-11-23 21:57:45,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:45,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354964642] [2019-11-23 21:57:45,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:45,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354964642] [2019-11-23 21:57:45,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049124442] [2019-11-23 21:57:45,787 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:45,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-23 21:57:45,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:45,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-23 21:57:45,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:45,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:45,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:45,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-23 21:57:45,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212241687] [2019-11-23 21:57:45,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:57:45,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:45,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:57:45,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:57:45,933 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 8 states. [2019-11-23 21:57:46,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:46,038 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-11-23 21:57:46,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 21:57:46,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-11-23 21:57:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:46,042 INFO L225 Difference]: With dead ends: 60 [2019-11-23 21:57:46,043 INFO L226 Difference]: Without dead ends: 42 [2019-11-23 21:57:46,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:57:46,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-23 21:57:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-23 21:57:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-23 21:57:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-23 21:57:46,056 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 31 [2019-11-23 21:57:46,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:46,057 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-23 21:57:46,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:57:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-23 21:57:46,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 21:57:46,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:46,062 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:46,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:46,268 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:46,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:46,270 INFO L82 PathProgramCache]: Analyzing trace with hash 611006418, now seen corresponding path program 4 times [2019-11-23 21:57:46,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:46,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491005455] [2019-11-23 21:57:46,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:46,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491005455] [2019-11-23 21:57:46,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952848335] [2019-11-23 21:57:46,392 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:46,483 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 21:57:46,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:46,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-23 21:57:46,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:46,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:57:46,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:46,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:57:46,638 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:46,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:57:46,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,677 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-23 21:57:46,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,678 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-23 21:57:46,761 INFO L377 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 13 treesize of output 9 [2019-11-23 21:57:46,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:46,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:49 [2019-11-23 21:57:46,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:46,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-11-23 21:57:46,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,920 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.3 percent of original size [2019-11-23 21:57:46,950 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-23 21:57:46,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 40 [2019-11-23 21:57:46,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,998 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-11-23 21:57:46,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:46,999 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:44 [2019-11-23 21:57:47,085 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 82 [2019-11-23 21:57:47,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,150 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-11-23 21:57:47,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:47,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:99, output treesize:110 [2019-11-23 21:57:47,301 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 189 [2019-11-23 21:57:47,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,420 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-23 21:57:47,421 INFO L567 ElimStorePlain]: treesize reduction 96, result has 62.5 percent of original size [2019-11-23 21:57:47,484 INFO L343 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-11-23 21:57:47,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 95 [2019-11-23 21:57:47,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:47,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:47,496 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:47,576 INFO L567 ElimStorePlain]: treesize reduction 36, result has 66.0 percent of original size [2019-11-23 21:57:47,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:47,578 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:97 [2019-11-23 21:57:47,686 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,687 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 161 [2019-11-23 21:57:47,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:47,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:47,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:47,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:47,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-23 21:57:47,823 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-11-23 21:57:47,824 INFO L567 ElimStorePlain]: treesize reduction 617, result has 21.8 percent of original size [2019-11-23 21:57:47,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:47,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:188, output treesize:223 [2019-11-23 21:57:47,915 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:47,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 84 [2019-11-23 21:57:47,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:47,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,091 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-11-23 21:57:48,092 INFO L343 Elim1Store]: treesize reduction 72, result has 59.6 percent of original size [2019-11-23 21:57:48,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 227 treesize of output 155 [2019-11-23 21:57:48,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,112 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:48,190 INFO L567 ElimStorePlain]: treesize reduction 98, result has 49.5 percent of original size [2019-11-23 21:57:48,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:48,192 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:243, output treesize:147 [2019-11-23 21:57:48,378 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-23 21:57:48,379 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:48,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 245 [2019-11-23 21:57:48,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:48,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:48,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:48,696 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-11-23 21:57:48,698 INFO L567 ElimStorePlain]: treesize reduction 8011, result has 3.0 percent of original size [2019-11-23 21:57:48,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:48,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:274, output treesize:321 [2019-11-23 21:57:48,779 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_10|], 20=[|v_#memory_$Pointer$.base_18|]} [2019-11-23 21:57:48,786 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:48,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:49,248 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 113 [2019-11-23 21:57:49,250 INFO L343 Elim1Store]: treesize reduction 138, result has 68.2 percent of original size [2019-11-23 21:57:49,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 317 treesize of output 361 [2019-11-23 21:57:49,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:49,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,028 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 13 xjuncts. [2019-11-23 21:57:50,473 WARN L192 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 52 [2019-11-23 21:57:50,474 INFO L567 ElimStorePlain]: treesize reduction 257971, result has 0.1 percent of original size [2019-11-23 21:57:50,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:57:50,476 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:398, output treesize:291 [2019-11-23 21:57:50,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:57:50,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 295 treesize of output 215 [2019-11-23 21:57:50,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:57:50,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:57:51,314 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 8 [2019-11-23 21:57:51,315 INFO L567 ElimStorePlain]: treesize reduction 16507, result has 0.1 percent of original size [2019-11-23 21:57:51,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:57:51,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:295, output treesize:4 [2019-11-23 21:57:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:57:51,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:51,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2019-11-23 21:57:51,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787134829] [2019-11-23 21:57:51,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-23 21:57:51,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:51,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-23 21:57:51,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-11-23 21:57:51,435 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 21 states. [2019-11-23 21:57:52,575 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-23 21:57:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:53,059 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-11-23 21:57:53,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 21:57:53,060 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-11-23 21:57:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:53,063 INFO L225 Difference]: With dead ends: 71 [2019-11-23 21:57:53,063 INFO L226 Difference]: Without dead ends: 53 [2019-11-23 21:57:53,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-11-23 21:57:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-23 21:57:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-11-23 21:57:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-23 21:57:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-23 21:57:53,080 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 36 [2019-11-23 21:57:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:53,082 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-23 21:57:53,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-23 21:57:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-23 21:57:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 21:57:53,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:53,083 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:53,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:53,289 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:53,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:53,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1517530049, now seen corresponding path program 5 times [2019-11-23 21:57:53,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:53,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798858257] [2019-11-23 21:57:53,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:53,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798858257] [2019-11-23 21:57:53,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195615905] [2019-11-23 21:57:53,469 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:53,756 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-23 21:57:53,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:53,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-23 21:57:53,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:53,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 5 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:53,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:53,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-23 21:57:53,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745716175] [2019-11-23 21:57:53,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:57:53,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:53,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:57:53,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:57:53,782 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 10 states. [2019-11-23 21:57:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:53,904 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-23 21:57:53,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 21:57:53,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-11-23 21:57:53,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:53,905 INFO L225 Difference]: With dead ends: 70 [2019-11-23 21:57:53,905 INFO L226 Difference]: Without dead ends: 52 [2019-11-23 21:57:53,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-11-23 21:57:53,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-23 21:57:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-11-23 21:57:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-23 21:57:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-11-23 21:57:53,914 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 41 [2019-11-23 21:57:53,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:53,915 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-23 21:57:53,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:57:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-11-23 21:57:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-23 21:57:53,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:53,919 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:54,120 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:54,121 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:54,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:54,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2123453746, now seen corresponding path program 6 times [2019-11-23 21:57:54,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:54,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569209362] [2019-11-23 21:57:54,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:54,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569209362] [2019-11-23 21:57:54,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290518372] [2019-11-23 21:57:54,245 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:55,541 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-23 21:57:55,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:55,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-23 21:57:55,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:55,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:55,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:55,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-23 21:57:55,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006300551] [2019-11-23 21:57:55,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 21:57:55,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:55,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 21:57:55,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:57:55,567 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 11 states. [2019-11-23 21:57:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:55,704 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2019-11-23 21:57:55,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 21:57:55,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-11-23 21:57:55,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:55,706 INFO L225 Difference]: With dead ends: 75 [2019-11-23 21:57:55,706 INFO L226 Difference]: Without dead ends: 57 [2019-11-23 21:57:55,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=188, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:57:55,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-23 21:57:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-11-23 21:57:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-23 21:57:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-23 21:57:55,721 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 46 [2019-11-23 21:57:55,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:55,721 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-23 21:57:55,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 21:57:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-23 21:57:55,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 21:57:55,722 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:55,722 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:55,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:55,925 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:55,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:55,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2006390175, now seen corresponding path program 7 times [2019-11-23 21:57:55,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:55,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770064819] [2019-11-23 21:57:55,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:56,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770064819] [2019-11-23 21:57:56,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853974036] [2019-11-23 21:57:56,063 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:56,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-23 21:57:56,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:56,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 7 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:56,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:56,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-11-23 21:57:56,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227205143] [2019-11-23 21:57:56,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 21:57:56,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:56,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 21:57:56,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:57:56,184 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 12 states. [2019-11-23 21:57:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:56,354 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-11-23 21:57:56,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 21:57:56,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-11-23 21:57:56,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:56,356 INFO L225 Difference]: With dead ends: 80 [2019-11-23 21:57:56,356 INFO L226 Difference]: Without dead ends: 62 [2019-11-23 21:57:56,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2019-11-23 21:57:56,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-23 21:57:56,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2019-11-23 21:57:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-23 21:57:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-23 21:57:56,362 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 51 [2019-11-23 21:57:56,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:56,362 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-23 21:57:56,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 21:57:56,362 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-23 21:57:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 21:57:56,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:56,363 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:56,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:56,564 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:56,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:56,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1623573870, now seen corresponding path program 8 times [2019-11-23 21:57:56,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:56,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403798262] [2019-11-23 21:57:56,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:56,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403798262] [2019-11-23 21:57:56,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449787300] [2019-11-23 21:57:56,687 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:56,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-23 21:57:56,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:56,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-23 21:57:56,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:56,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 8 proven. 156 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:56,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:56,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-23 21:57:56,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418381277] [2019-11-23 21:57:56,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:57:56,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:56,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:57:56,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:57:56,804 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 13 states. [2019-11-23 21:57:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:56,964 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2019-11-23 21:57:56,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 21:57:56,965 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-11-23 21:57:56,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:56,966 INFO L225 Difference]: With dead ends: 85 [2019-11-23 21:57:56,966 INFO L226 Difference]: Without dead ends: 67 [2019-11-23 21:57:56,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:57:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-23 21:57:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2019-11-23 21:57:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-23 21:57:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-23 21:57:56,972 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 56 [2019-11-23 21:57:56,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:56,973 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-23 21:57:56,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:57:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-23 21:57:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 21:57:56,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:56,974 INFO L410 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:57,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:57,180 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:57,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash -94871295, now seen corresponding path program 9 times [2019-11-23 21:57:57,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:57,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137680417] [2019-11-23 21:57:57,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:57:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:57:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:57,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137680417] [2019-11-23 21:57:57,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273461693] [2019-11-23 21:57:57,359 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:59,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-23 21:57:59,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:57:59,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-23 21:57:59,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:57:59,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:57:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 9 proven. 198 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-23 21:57:59,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:57:59,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-11-23 21:57:59,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853466139] [2019-11-23 21:57:59,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 21:57:59,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:57:59,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 21:57:59,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:57:59,559 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 14 states. [2019-11-23 21:57:59,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:57:59,752 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2019-11-23 21:57:59,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 21:57:59,753 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-11-23 21:57:59,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:57:59,754 INFO L225 Difference]: With dead ends: 90 [2019-11-23 21:57:59,754 INFO L226 Difference]: Without dead ends: 72 [2019-11-23 21:57:59,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:57:59,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-23 21:57:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2019-11-23 21:57:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-23 21:57:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-23 21:57:59,761 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 61 [2019-11-23 21:57:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:57:59,761 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-23 21:57:59,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 21:57:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-23 21:57:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 21:57:59,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:57:59,762 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:57:59,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:57:59,971 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:57:59,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:57:59,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2005657586, now seen corresponding path program 10 times [2019-11-23 21:57:59,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:57:59,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387165726] [2019-11-23 21:57:59,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:58:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:58:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 183 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-11-23 21:58:00,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387165726] [2019-11-23 21:58:00,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412307022] [2019-11-23 21:58:00,394 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:58:00,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-23 21:58:00,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-23 21:58:00,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 120 conjunts are in the unsatisfiable core [2019-11-23 21:58:00,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:58:00,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-23 21:58:00,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-23 21:58:00,648 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-23 21:58:00,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,685 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-11-23 21:58:00,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-23 21:58:00,690 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,704 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2019-11-23 21:58:00,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-23 21:58:00,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:00,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,759 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-23 21:58:00,816 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-23 21:58:00,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,858 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.6 percent of original size [2019-11-23 21:58:00,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:00,867 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2019-11-23 21:58:00,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:00,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:00,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:00,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:00,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:38 [2019-11-23 21:58:01,080 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 99 [2019-11-23 21:58:01,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,162 INFO L567 ElimStorePlain]: treesize reduction 42, result has 61.1 percent of original size [2019-11-23 21:58:01,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:01,171 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:01,199 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:55 [2019-11-23 21:58:01,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:01,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:01,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:74, output treesize:55 [2019-11-23 21:58:01,425 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 129 [2019-11-23 21:58:01,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,542 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-11-23 21:58:01,543 INFO L567 ElimStorePlain]: treesize reduction 56, result has 60.8 percent of original size [2019-11-23 21:58:01,549 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:01,550 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:01,592 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:77, output treesize:76 [2019-11-23 21:58:01,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:01,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:01,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:01,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:01,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:95, output treesize:76 [2019-11-23 21:58:02,092 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-23 21:58:02,093 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:02,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 159 [2019-11-23 21:58:02,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:02,324 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-11-23 21:58:02,324 INFO L567 ElimStorePlain]: treesize reduction 70, result has 61.5 percent of original size [2019-11-23 21:58:02,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:02,333 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:02,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:02,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:02,416 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:98, output treesize:101 [2019-11-23 21:58:02,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:02,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:02,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:02,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:02,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:120, output treesize:101 [2019-11-23 21:58:03,048 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-23 21:58:03,049 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 189 [2019-11-23 21:58:03,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,432 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-11-23 21:58:03,433 INFO L567 ElimStorePlain]: treesize reduction 84, result has 62.7 percent of original size [2019-11-23 21:58:03,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:03,446 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,573 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-23 21:58:03,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:03,576 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:130 [2019-11-23 21:58:03,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:03,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:03,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:03,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:03,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:149, output treesize:130 [2019-11-23 21:58:04,357 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-23 21:58:04,358 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 47 treesize of output 219 [2019-11-23 21:58:04,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,689 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-11-23 21:58:04,690 INFO L567 ElimStorePlain]: treesize reduction 98, result has 64.0 percent of original size [2019-11-23 21:58:04,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:04,706 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:04,826 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-23 21:58:04,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:04,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:04,828 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:152, output treesize:163 [2019-11-23 21:58:09,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:09,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:09,160 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-23 21:58:09,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:09,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:09,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:182, output treesize:163 [2019-11-23 21:58:17,392 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-23 21:58:17,393 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:17,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 16 case distinctions, treesize of input 52 treesize of output 249 [2019-11-23 21:58:17,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:17,993 WARN L192 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 116 [2019-11-23 21:58:17,994 INFO L567 ElimStorePlain]: treesize reduction 112, result has 65.3 percent of original size [2019-11-23 21:58:18,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:18,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:18,155 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-23 21:58:18,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:18,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:18,158 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:185, output treesize:200 [2019-11-23 21:58:28,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:58:28,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:28,361 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-23 21:58:28,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:28,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:28,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:219, output treesize:200 [2019-11-23 21:58:58,877 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-23 21:58:58,878 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:58,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 57 treesize of output 279 [2019-11-23 21:58:58,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:59,433 WARN L192 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2019-11-23 21:58:59,434 INFO L567 ElimStorePlain]: treesize reduction 126, result has 66.7 percent of original size [2019-11-23 21:58:59,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-23 21:58:59,443 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-23 21:58:59,674 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-11-23 21:58:59,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:58:59,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-23 21:58:59,678 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:222, output treesize:241 [2019-11-23 21:59:16,246 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-23 21:59:16,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-23 21:59:16,473 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-23 21:59:16,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-23 21:59:16,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-23 21:59:16,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:260, output treesize:241